{"$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":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"D32","name":"Data Compliance (PII/GDPR)","shortDescription":{"text":"Data Compliance (PII/GDPR)"},"helpUri":"https://codehealth.canine.dev/dimensions/D32","relationships":[{"target":{"id":"CWE-359","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-312","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-359","CWE-312","CWE-200"],"owasp":"A01:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"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":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"EnvResults::resolve_with_toolset (cyclomatic 96): EnvResults::resolve_with_toolset has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1ad000fba2b369519305165dd688b42c4c9448b4cb8af22eca6b25704ebfa3"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::watch::runtime::run (cyclomatic 94): mise_system::history::watch::runtime::run has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"705f6b1c1ab38dda21f25be9c50a120f9f35ec968c2d6c26b751afa5d17bbd60"}},{"ruleId":"D1","level":"warning","message":{"text":"Daemons::run (cyclomatic 94): Daemons::run has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/daemons.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d1c50e78a25a3b37399681d960c17aaa71d7403cf1c6a1cbcdc0ef5790b7a9"}},{"ruleId":"D1","level":"warning","message":{"text":"Bootstrap::run_phases (cyclomatic 93): Bootstrap::run_phases has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2ca1dd285753fa4d289191792c59994669af0bce2844f98b86367913fce93c"}},{"ruleId":"D1","level":"warning","message":{"text":"DotfilesAdd::run_inner (cyclomatic 92): DotfilesAdd::run_inner has cyclomatic complexity 92 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/add.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9285da86dd1a740246916a426ec3228c40382c8106cbebc90b9164a8b7517d5c"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::render_item (cyclomatic 88): Renderer::render_item has cyclomatic complexity 88 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/render/item.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e91d8ed02b2835e40ecdab22e7b7e4b2e7e8c27cf38c8aa46d137f13aa2352"}},{"ruleId":"D1","level":"warning","message":{"text":"DotfilesTrack::run (cyclomatic 84): DotfilesTrack::run has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/track.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85429435f2311a21bcbb45fdf13e632435fb3ee530863a9dad2e71e97968492"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::attempt_locked (cyclomatic 82): Store::attempt_locked has cyclomatic complexity 82 (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":"crates/mise-system/src/history/checkpoint.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"754bd67bf28657b0b4fd519e743963d65d81d6f95970a48ca71d521038ff8412"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskExecutor::exec_program (cyclomatic 79): TaskExecutor::exec_program has cyclomatic complexity 79 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"06457c799ab3e940b990a5873fb21e1a5be17a294c668326f2a2082701869f60"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::merge_file_entry (cyclomatic 76): mise_system::files::merge_file_entry has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d30c9c4bf86cd6155c2007785793ea08fa9eb184204f9963e449112044b957"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::cask::flight::execute_flight_step (cyclomatic 76): mise_system_packages::brew::cask::flight::execute_flight_step has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/flight.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0682784ac301e6ecc72b2fd0237388c4db62688efa8793246f51c30c7b6447a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Upgrade::upgrade (cyclomatic 75): Upgrade::upgrade has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/upgrade.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45d8720a7c907759b0bf4f176fae0196921167be799dbc75b0b30a5aefc81d3"}},{"ruleId":"D1","level":"warning","message":{"text":"Upgrade::run (cyclomatic 74): Upgrade::run has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/upgrade.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c984fa02c8f1f939fa3d1a3079e0ecc78d274fce06a4ce3d50397ca3916bc7"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskExecutor::run_task_sched (cyclomatic 72): TaskExecutor::run_task_sched has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e7afc72bae337a3441abf26848937813a1684ff436d1e16612f66f21b227a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Lock::get_tools_to_lock (cyclomatic 71): Lock::get_tools_to_lock has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d251785dbdba9a3f20fa0e560db1cb0eb98321a93a6123e620ccbe33c978ef6d"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::validate_incoming_files (cyclomatic 67): mise_system::files::validate_incoming_files has cyclomatic complexity 67 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"208f83cd36212d1f579a63522a00a0852a26d36a9e9e552e987083db80dde522"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::install_version (cyclomatic 67): Backend::install_version has cyclomatic complexity 67 (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":"src/backend/mod.rs"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b140fe1503dd815302cb15f4a28da8673aec98f09f874bb6b6a75d88fa0638"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolVersion::resolve_version (cyclomatic 64): ToolVersion::resolve_version has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_version.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"df57c8a7c178b848b2304fd8cfa5cc16fb41864b3de83d0f3b37f206adfa513a"}},{"ruleId":"D1","level":"warning","message":{"text":"BrewCaskManager::install_one_with_ancestors (cyclomatic 56): BrewCaskManager::install_one_with_ancestors has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e390a4dcd33c48c79c13107fcbda5a8120a4a2432e66337a7ff3c2f0a04b56f"}},{"ruleId":"D1","level":"warning","message":{"text":"DotfilesStatus::run (cyclomatic 55): DotfilesStatus::run has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/status.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"11253832cd16c75564a6b14d564b9b5cf23e92f74d2d1808e6e2934a8cb299f7"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvList::deserialize (cyclomatic 53): EnvList::deserialize has cyclomatic complexity 53 (threshold 15). Of this number, 47 points are the body\u0027s own statements and 6 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/env.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49e5106cce4588615f93f1641bf41b6afda8b91ba5dd39c9875a266d923cf6f"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_brew_relocation::elf::patch (cyclomatic 52): mise_brew_relocation::elf::patch has cyclomatic complexity 52 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-brew-relocation/src/elf.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c172fc32b20719fe27c9c5ce4a67723783a01de92160470d5798017c1b4014c"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_daemons::load (cyclomatic 50): mise_daemons::load has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"24976cd1fb543c51d3e18d60242666e8e5e31427e77b1d36a0236702f169b86c"}},{"ruleId":"D1","level":"warning","message":{"text":"CmdLineRunner::execute_async_with_cancel_check (cyclomatic 49): CmdLineRunner::execute_async_with_cancel_check 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd197c6d07da96210407d2fa0b6ffc5ed3a680004caf4c7a27c4a57a0fb95dd"}},{"ruleId":"D1","level":"warning","message":{"text":"InteractiveConfig::handle_enter (cyclomatic 48): InteractiveConfig::handle_enter has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/actions/enter.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"45647433d58b2e98d868613edfb0b266bf756c192b62a75ecb67a994fc5f88ea"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::unapply::plan (cyclomatic 48): mise_system::unapply::plan has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/unapply.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe281cc7777e9ecc884b3a02bd2701a808aa589519c8edc99988e9d03dc37a7"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::replay::apply_steps (cyclomatic 45): mise_system::history::replay::apply_steps has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace123733963febb2aad4cff0c3d5393892158da76db5442e6d2ecf8dd10bb03"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::lockfile::update_lockfiles (cyclomatic 45): mise::lockfile::update_lockfiles has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"09739ab2e0e3cd8a52759e845e4246085858be8943ace8b3d82882fb22ab1581"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::plan_unapply_one (cyclomatic 44): mise_system::files::plan_unapply_one 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":"crates/mise-system/src/files.rs"},"region":{"startLine":5035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c540951467e626f47abc28a41f0fc7e7194d39693ebf15e158f8ea368b4aa8ad"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigSet::run (cyclomatic 44): ConfigSet::run has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/config/set.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4062eb16dabb07c14f01ca0b333ada019e21569ed6d1923a571e829e64767b"}},{"ruleId":"D1","level":"warning","message":{"text":"Run::run (cyclomatic 43): Run::run has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/run.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbc0c5d7758f1e83313217f1e23a70327f94ece7674073d40a356a1cd21ce27"}},{"ruleId":"D1","level":"warning","message":{"text":"WatchexecArgs::watchexec_args (cyclomatic 43): WatchexecArgs::watchexec_args has cyclomatic complexity 43 (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":"src/cli/watch.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e6c30ce7555e159d19c4738e7315635859400e595b6385246824b41eb32a2d"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::lockfile::generate::generate (cyclomatic 43): mise::lockfile::generate::generate has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile/generate.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d993acbbf897ce7ac77741d2cc12664bf0abb9eb07d450e864af7896054866c"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::apply_one (cyclomatic 42): mise_system::files::apply_one has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":5931}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8e40730267b96be7e253106727dd6c3d82839e37c690225a5e1ca36f769c31"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::hook_env::check_exit_early_fast (cyclomatic 42): mise::hook_env::check_exit_early_fast has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hook_env.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4070cc26d11ff061ec9bfde1fe9f3f260952f0bbcb0c5b21386bdca3dfb608"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::packslip::fetch_files (cyclomatic 42): mise::packslip::fetch_files has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packslip.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"586873a7257329af30b9ea393fa02f8da4848d7968158117ec870bb30ab6f149"}},{"ruleId":"D1","level":"warning","message":{"text":"Client::download_file_attempt (cyclomatic 41): Client::download_file_attempt has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da0f72e1143b357f75f641943fb9915bbca01573c512264005cc75aafa93acd"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::lockfile::get_locked_version (cyclomatic 41): mise::lockfile::get_locked_version has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":5414}}}],"partialFingerprints":{"codehealthFindingId/v1":"08afa6cbc03a069971e093347340b89a71e5ffe77db846fdcc24150044b2df9c"}},{"ruleId":"D1","level":"warning","message":{"text":"BrewManager::install_via_pour (cyclomatic 40): BrewManager::install_via_pour has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d4e3d30591b34d53d7d22d96d980a11ee42b90c853ae88c0b6dd9c08cd9f35"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::driver::run_manager (cyclomatic 39): mise_system::driver::run_manager has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/driver.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f0173ff44d06a86b6b0f6004c1c10b9283f1c3ef5d570b3fa33e81d52d79c3"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::replay::plan (cyclomatic 39): mise_system::history::replay::plan has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"610702e519ee00dff9eed2fb888a061846432dc3253978c5d91d473ad2f8fbd0"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::remote_repository::install_at (cyclomatic 39): mise_system::remote_repository::install_at has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/remote_repository.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b539bb82f0a4a23c622e7768513214fe2a3c9f636f943400b5225bd46144fb39"}},{"ruleId":"D1","level":"warning","message":{"text":"Run::spawn_sched_job (cyclomatic 39): Run::spawn_sched_job has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/run.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7091a5f915d94810879af1455f2abccd5d296cdf8bf9ead39ed53c98879dfe1"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::build_image_config (cyclomatic 39): Builder::build_image_config has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oci/builder.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc47d26e7ad6a187e18c43489c2a88d523e9f3742196739b3989f844e063cf6a"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::sync::run::sync_locked (cyclomatic 38): mise_system::history::sync::run::sync_locked has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe080c051e523c151b38359fb2d91ad3b938a43b5d540be6e2c7295ad8cca13"}},{"ruleId":"D1","level":"warning","message":{"text":"AquaBackend::resolve_lock_info (cyclomatic 38): AquaBackend::resolve_lock_info 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":"src/backend/aqua.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"7835e9fda89225ec535c407a817838ed8881f60b2981a58a3aa50ac45a1ea316"}},{"ruleId":"D1","level":"warning","message":{"text":"AquaBackend::verify_provenance (cyclomatic 38): AquaBackend::verify_provenance has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":3303}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf833accba09a745425350f9a73be4c83cf07ab5c10574083ed54066c8d0408"}},{"ruleId":"D1","level":"warning","message":{"text":"Watch::run (cyclomatic 38): Watch::run has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/watch.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2cb684872726187b290529a2387f947f65ca1d818ee666a2fc9bd4730f17cb"}},{"ruleId":"D1","level":"warning","message":{"text":"Task::merge_template_with (cyclomatic 38): Task::merge_template_with has cyclomatic complexity 38 (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":"src/task/task_template.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6ec09a993fff087579018c69a09768836c4bde73721ac9e6e9ae931706fc0f"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_daemons::build (cyclomatic 37): mise_daemons::build has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7461c749df7520381573b25538630b25ce9eccf375835c60689c87af2d4592e"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::resources::plan (cyclomatic 37): mise_system::resources::plan has cyclomatic complexity 37 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/resources.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c5856004e341afb3515741a2d9c8800ea2c2ad5738bcd07c706f6e072e9936"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens (cyclomatic 37): mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/state.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7acbc43a00ea0cfce79cc78ba31478c3da0eea2317bbc605bd94fc6e78dd6d1"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolStub::generate_stub (cyclomatic 37): ToolStub::generate_stub has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/generate/tool_stub.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4e9302dec493cbf8372ae2b198ac8f650ea133f5d327037c44b9e47d4fedc2"}},{"ruleId":"D1","level":"warning","message":{"text":"TasksAdd::run (cyclomatic 37): TasksAdd::run has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/add.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"de69163529162ab064614e35f37840c883ebac99fe2fa0c4eb6726ccbc5d3a4a"}},{"ruleId":"D1","level":"warning","message":{"text":"InteractiveConfig::undo (cyclomatic 36): InteractiveConfig::undo has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/actions/undo.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfb67a0bcc212da0a054f11fa133b868be935e97a02b8f821c6ec9b176a49cf"}},{"ruleId":"D1","level":"warning","message":{"text":"SecretBroker::grant_values_with (cyclomatic 36): SecretBroker::grant_values_with has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/broker.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"204282e557db6b2b44cb21080c550f71139d89b41252159bfcecd014c7bec24a"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::merge_file_and_config_tasks (cyclomatic 36): mise::config::merge_file_and_config_tasks has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":6366}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4128b32641209e9df0f0ba19aa8ccc684b6a0f530bd85eb581897096b8d1a4"}},{"ruleId":"D1","level":"warning","message":{"text":"record.run_session (cyclomatic 36): record.run_session has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/record.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"03209268fc279ca39fbb646eaef9f92e22e8755dae8dc7995d3787c7c5048f28"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::build (cyclomatic 35): Builder::build 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":"src/oci/builder.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf2bcfbe621cb3a6cac6041e00ba1b06854de57d482e3fe8626b771bfc5a563"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::lockfile::auto_lock_new_versions (cyclomatic 35): mise::lockfile::auto_lock_new_versions 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":"src/lockfile.rs"},"region":{"startLine":4212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e31ea47fa81b1882667b891677c0c23fc1f65f0331870db644dcc932d159380"}},{"ruleId":"D1","level":"warning","message":{"text":"shape.check (cyclomatic 35): shape.check 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":"docs/.vitepress/showreel-capture/shape.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9d427f35f9fc6edd2e968b4b7a37225e242874880cfa2309be485b7d17f7cb"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::package_requests_from_config_files (cyclomatic 34): mise_system::package_requests_from_config_files 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":"crates/mise-system/src/lib.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"93157abd46244836729f00c4b67a9b9ceadb120942d8ee62464ec9b579eee507"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::tracked::walk_entry (cyclomatic 34): mise_system::history::tracked::walk_entry 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":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"38204cee7f348e9c65b2948e9b13e20b0f209b1f10a09840e92da42d68db908a"}},{"ruleId":"D1","level":"warning","message":{"text":"CmdLineRunner::execute (cyclomatic 34): CmdLineRunner::execute 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf899ce73bd66fc2aa31511d26347e73c570969c6ded15d81ed131e338267bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryShow::run (cyclomatic 34): HistoryShow::run has cyclomatic complexity 34 (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":"src/cli/dotfiles/history/show.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"11048970f5fa88ee298528f4a6cd4de765b2ca4eda7fcce4824fdf007b0ca37d"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::purge::purge (cyclomatic 33): mise_system::history::purge::purge has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/purge.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d8d8f8ed535623d6166ee956c950b5fd99be6a70090401b62a5d53f1b01ecb"}},{"ruleId":"D1","level":"warning","message":{"text":"BackendArg::full (cyclomatic 33): BackendArg::full has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args/backend_arg.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"835de32d67948046a110500ccb9001049010d3b0e3ddbba9f54a9a6b86a5787b"}},{"ruleId":"D1","level":"warning","message":{"text":"Tool::output_user (cyclomatic 33): Tool::output_user has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tool.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"365618b3d07c9effb420c9022be778998b5ab0eadae18180a75b6bb37b2a97cc"}},{"ruleId":"D1","level":"warning","message":{"text":"aqua_registry::types::merge::apply_override (cyclomatic 32): aqua_registry::types::merge::apply_override has cyclomatic complexity 32 (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":"crates/aqua-registry/src/types/merge.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7205896092a5222787c0d9e1a04e6395c6e55da3199758dff65640b9cc2ff609"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::plan_apply_with_active (cyclomatic 32): mise_system::files::plan_apply_with_active 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":"crates/mise-system/src/files.rs"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1115e5f4efee186242949a48567d5b352c29d75779f47509294c6e0f31337a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Exec::run_with_context (cyclomatic 32): Exec::run_with_context has cyclomatic complexity 32 (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":"src/cli/exec.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"621d87f2fc0a959e606f6d8e2540d4d4e528e39ef41ae76f40b3b47f21bef3b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Cli::run_inner (cyclomatic 32): Cli::run_inner has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Commands::run (cyclomatic 79) 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":"src/cli/mod.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11aa1a874100d5b59867e0107f692d26952bbcb258f7dbec4b01978426faebf"}},{"ruleId":"D1","level":"warning","message":{"text":"Toolset::install_all_versions_with_progress (cyclomatic 32): Toolset::install_all_versions_with_progress 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":"src/toolset/toolset_install.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"622f2206de0ef5b2e076402e249a2201fa590d40f8f4807460d3a17a93aaf14e"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::dotfile_groups::group_entry (cyclomatic 31): mise_system::dotfile_groups::group_entry has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/dotfile_groups.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1de10c19aedcb7afeb05cc26702e6ea728c5ada7e7c48ed86c0bd5f2f5006c"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::edits::apply (cyclomatic 31): mise_system::edits::apply has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/edits.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9249432452c1b0cad7c3b443dda27b820825211f42543d479e1634cf6eba6c06"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::execute_apply (cyclomatic 31): mise_system::files::execute_apply has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":4396}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d8148e045b10eff2566a90d83525cfe6c0ca5924fd1fc06f7d4536fb9e8277"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::sync::apply::apply_locked_with_scope (cyclomatic 31): mise_system::history::sync::apply::apply_locked_with_scope has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe638361d17b0ddacbf95466c22770d8ecfee8b54f9831ca5f345e00b30bc7fe"}},{"ruleId":"D1","level":"warning","message":{"text":"UnifiedGitBackend::verify_attestations_or_slsa (cyclomatic 31): UnifiedGitBackend::verify_attestations_or_slsa has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":2858}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d118bf745d27bd8e130748842a30e181144a06ed8afc1b53a4b14457fcf2a6"}},{"ruleId":"D1","level":"warning","message":{"text":"DotfilesUntrack::run (cyclomatic 31): DotfilesUntrack::run has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/untrack.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a88976db65ddc01f5281cfaaccf3ff7dc60597be63b62d0f5f6591c54b86c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"PlatformInfo::try_from (cyclomatic 31): PlatformInfo::try_from 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":"src/lockfile.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b545a5b0328bcd1b918e4b3a21259bf3ac0829c4514a60ea8a78f45bcc8f48"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::shim::which_shim (cyclomatic 31): mise::cli::shim::which_shim has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/shim.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"22041e523f91d9824c68d51b3645bbcd06bf48f264c9a28a365e1eef94348e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::task_source_checker::compute_output_hash (cyclomatic 31): mise::task::task_source_checker::compute_output_hash has cyclomatic complexity 31 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 6 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":"src/task/task_source_checker.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9611eab6e356f3797f44670f323aaa47bf7c9fd4b257dd637b1934fb2d0b4b98"}},{"ruleId":"D1","level":"warning","message":{"text":"Runtime::prepare (cyclomatic 30): Runtime::prepare has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/runtime.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdef1478d4b430b77063fd0d9bc4003cfe5c75fc6a5f92383ef06f10bc9e53f"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryRepo::read_meta_in (cyclomatic 30): HistoryRepo::read_meta_in 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":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afaa0cd7c381ea28b584dcefd133ecdb255f54f86900209ad33923bd9670112"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::sync::reconcile::reconcile (cyclomatic 30): mise_system::history::sync::reconcile::reconcile 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":"crates/mise-system/src/history/sync/reconcile.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"a525dba8f44101a8c3ef906488d159e61a837ceed62d4bfc8c32b97203c89d55"}},{"ruleId":"D1","level":"warning","message":{"text":"PackslipBackend::install_payload (cyclomatic 30): PackslipBackend::install_payload 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":"src/backend/packslip.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeda6cf7efcda6c9b1110e2d94a0abfaa81fb04e88a3f8de0212713186897bf2"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::settings::set::set (cyclomatic 30): mise::cli::settings::set::set 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":"src/cli/settings/set.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eb8f4bfb9bf8ccea322be016a3f3d7bc9bae6add088ea6a51a81dc3b5baeb4"}},{"ruleId":"D1","level":"warning","message":{"text":"bed.arrange (cyclomatic 30): bed.arrange 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":"docs/.vitepress/showreel-bed/bed.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28424695fa2d1f635fe147d6fd1712c1d79989ae219c94f7834351c0faa95b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Screen.select_graphic_rendition (cyclomatic 30): Screen.select_graphic_rendition has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/frames.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a451709be633380b49089b87229e1ed8675896fe481dbdada2dfb6ff6f200b9"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::apt_sources::apply (cyclomatic 29): mise_system_packages::apt_sources::apply has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/apt_sources.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"990854f0d1bcba9c5b11745c5247de8305a239137f2904f7f710cea71926af47"}},{"ruleId":"D1","level":"warning","message":{"text":"AquaBackend::install_version_ (cyclomatic 29): AquaBackend::install_version_ has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"783a2380c16bb4508d913953ad6264038a34f6f63646bf824cb87d793a74c816"}},{"ruleId":"D1","level":"warning","message":{"text":"DotfilesTrack::entry (cyclomatic 29): DotfilesTrack::entry has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/track.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c46f0ce246ac5d5ccced5cd3f4f9928ae2db294620b8101d20dae3e43c12ee"}},{"ruleId":"D1","level":"warning","message":{"text":"DepsEngine::run (cyclomatic 29): DepsEngine::run has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c95788656efada823bfd589aafe65049a3f10c0d10b5db375e9cc499c06dfc7"}},{"ruleId":"D1","level":"warning","message":{"text":"bed.verify (cyclomatic 29): bed.verify has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-bed/bed.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cef6dca7f435adf98eb5591cb4388179ceceb9f62aef27d9b073dced75ea8a9"}},{"ruleId":"D1","level":"warning","message":{"text":"config-reference.data.describeKey (cyclomatic 29): config-reference.data.describeKey has cyclomatic complexity 29 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/config-reference.data.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a0f8c3c44071a284e4627d262f4a639f9310425ad7ebe7ecb94f4ea4d35176"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_lsp::complete::advance (cyclomatic 28): mise_lsp::complete::advance has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/complete.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b3126d70bedf680b14c2705d8051287b5150ac98cd5af2d6e1134da78937e0"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::enrollment::reconcile (cyclomatic 28): mise_system::history::enrollment::reconcile has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/enrollment.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a823dadeddee38d871b4b93df917794a9924d870c4fc9a3e3d98488cd93b35"}},{"ruleId":"D1","level":"warning","message":{"text":"CmdLineRunner::execute_hashes_async_with_drain_timeout (cyclomatic 28): CmdLineRunner::execute_hashes_async_with_drain_timeout has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c1ff7784ddd8281b1a07efcd573df44076ddd0e3380f7e6f9c58fcb95f0344"}},{"ruleId":"D1","level":"warning","message":{"text":"DepsEngine::check_freshness (cyclomatic 28): DepsEngine::check_freshness has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6a05918da628d0c242e22857e2d877f6ce397407daa7dee82db2037088c29a"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::backend::cargo::native_binstall::install (cyclomatic 28): mise::backend::cargo::native_binstall::install has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"929f2fefb11563ce33dc5f918b15a9d2a1ad3824ebc97cec3a14c03130a46d0d"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::lockfile::generate::is_current (cyclomatic 28): mise::lockfile::generate::is_current has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile/generate.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b79345adc5c14d072516e4b4ceb42a8839ddd1fda1df6e1deecb9fe93b574a"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::render (cyclomatic 27): Renderer::render has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/render.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"705fd1fc259f854f2f960d54fadbfa68afcab53d55fa3606b6fd2803c40fa2ed"}},{"ruleId":"D1","level":"warning","message":{"text":"Index::add_file_tasks::walk (cyclomatic 27): Index::add_file_tasks::walk has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b3f1edc672b875e93d6b9a7056b46de85a94a20ba6f62e318e16e6f34a8080"}},{"ruleId":"D1","level":"warning","message":{"text":"Pull::record_resolutions (cyclomatic 27): Pull::record_resolutions has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc62b2178076a080fc37d0344739a46fd755fbb04b4247b60905459f7302bf8"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::remote::run_staged (cyclomatic 27): mise_system::remote::run_staged has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/remote.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0d49f9102ebac503a3df301198d85d986cd1c519a6397a20ff98324a6ed0de"}},{"ruleId":"D1","level":"warning","message":{"text":"Client::send_once_inner (cyclomatic 27): Client::send_once_inner has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ca8566526f664e77cd58012e5c46becf554563b5d3b1abc2987eb2826b6035"}},{"ruleId":"D1","level":"warning","message":{"text":"Providers::run (cyclomatic 27): Providers::run has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daemons/provider_commands.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7824018d1e45888e78dcb4a9ea78be0b3982b807f9cfc4c0441c579790a6f4"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::exec::exec_program (cyclomatic 27): mise::cli::exec::exec_program has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/exec.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"213eb05598fd72498bd15bdcc27bebffecb8562afff5f1bfe5f3ead4757cb0b4"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::toolset::helpers::preflight_system_deps_inner (cyclomatic 27): mise::toolset::helpers::preflight_system_deps_inner has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/helpers.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9cfb7989b155f16f1fe19c879c09205f080ee5800cc6474c99d0fbe1562278"}},{"ruleId":"D1","level":"warning","message":{"text":"versions.main (cyclomatic 27): versions.main has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/versions.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67f24a283aa749ad8d66ef8cf9387fcdcbb1a2491efd16a187c0f4bf0d5b98b"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_daemons::presets::expand (cyclomatic 26): mise_daemons::presets::expand has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/presets.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09efe82c2e150b1d6ed340b36b8b4c84055b41d7ba81bca3dfe9b1615333e46"}},{"ruleId":"D1","level":"warning","message":{"text":"InteractiveConfig::apply_new_key (cyclomatic 26): InteractiveConfig::apply_new_key has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/actions/edit.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"620087ecf21c5312f76a428a1e797d5d6ca66b11f23b1542066bddfd6120ce52"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::validate_composed_file_footprints (cyclomatic 26): mise_system::files::validate_composed_file_footprints has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"72179e7e87ec7d5ab50f1cb0891c462ef48446da9f070bece41d204297253f8f"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::print_diff (cyclomatic 26): mise_system::files::print_diff has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":5474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bcc14dcc7e51ebe3ac9e34b8e4634335ba591af6ff5fee42d82d293a0cbbec"}},{"ruleId":"D1","level":"warning","message":{"text":"PIPXBackend::install_version_ (cyclomatic 26): PIPXBackend::install_version_ has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/pipx.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc59062b926650d0aced46fe71ba74668defcd079ec44c2d1733455a5c71171"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings::set_hidden_configs (cyclomatic 26): Settings::set_hidden_configs has cyclomatic complexity 26 (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":"src/config/settings.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"707e36b8d03f35fd0befdcfc140c8cc0a58605b759e178e76b4f8200f8c09e69"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemStatus::run (cyclomatic 26): SystemStatus::run has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/status.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4e8c23697d759d930bf407f66b0d1cd214decec0d895af8236db9ca3ef38cc"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::backend::static_helpers::rename_executable_in_dir (cyclomatic 26): mise::backend::static_helpers::rename_executable_in_dir has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/static_helpers.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0aa88a63667b7a770f0fbac2c06dd71f7bbc76ee1289463f7e7f5ffb75fbb82"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountAction::apply (cyclomatic 25): AccountAction::apply has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/accounts.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"8080cb2b6177cb7bc0da325d9ed4b50de568f8a520282ef8a1c4b6b360992898"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::enrollment::resolve (cyclomatic 25): mise_system::history::enrollment::resolve has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/enrollment.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f2a47de87cfccf8ecef43cf5786477149a1c0c15864dde3bcaaab787b3853f"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::sync::preflight::prospective (cyclomatic 25): mise_system::history::sync::preflight::prospective has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/preflight.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b686c21cbc9e26792fcd5f8f43ade7b3f10e440bd21d6fb555d6e64207eea1"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::managed_files::apply_with_accounts (cyclomatic 25): mise_system::managed_files::apply_with_accounts has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bb9545ec46566002f2b1d25fc410dec655d423a74c756befe410f7ea9b7207"}},{"ruleId":"D1","level":"warning","message":{"text":"Doctor::check_dotfiles (cyclomatic 25): Doctor::check_dotfiles has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/mod.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0bbd3c4ce4e5ba58a3db9064006d8b771a0834d3680a56bf2198423bbea83a"}},{"ruleId":"D1","level":"warning","message":{"text":"Set::run (cyclomatic 25): Set::run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/set.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"38966cb4da1cf0b4617e70d276da1458bd0471add080506a4a763a66730bc427"}},{"ruleId":"D1","level":"warning","message":{"text":"Uninstall::run (cyclomatic 25): Uninstall::run has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e82e7752bd74c5ff10665ede4f8c9c320fe53a5b1754e99d0cfdfdbb1f31c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Use::run (cyclomatic 25): Use::run has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/use.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8af64ed26251968302c10a5d14b489cc77cfcf6dd4a2dddc57cf29265631ec"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::load_all_tasks_with_context (cyclomatic 25): Config::load_all_tasks_with_context has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e07922df200938e73b7685ea474f9d0bab5f1e035043bac0fe71f0dbd179709"}},{"ruleId":"D1","level":"warning","message":{"text":"DepsEngine::run_with_deps (cyclomatic 25): DepsEngine::run_with_deps has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb5644e07dcbd9aa9678943079c101ddd3b8c82923a1953611e51e8a24a51d8"}},{"ruleId":"D1","level":"warning","message":{"text":"Lockfile::prepare_write (cyclomatic 25): Lockfile::prepare_write has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e899534a1750c6ff07232247716558ce94a85d29adf2f5cf00caf7b6aeeac5"}},{"ruleId":"D1","level":"warning","message":{"text":"Task::merge_toml_overlay (cyclomatic 25): Task::merge_toml_overlay has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeebb4c83ae80d593ef6f7b8e9297e2577d54e0a89be74477da316059122f09"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::system_install::apply_for_owner (cyclomatic 25): mise::system_install::apply_for_owner has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/system_install.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d5bc77b548f23730b82abb60d7d63fd575628f295589d46ada6e05dbc1a9f6"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::task_list::get_task_lists (cyclomatic 25): mise::task::task_list::get_task_lists has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_list.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8650cffb661d15e9938b542182a5f5716a08ceb76b18092e181fed33ba80b8f"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::workspace::gradle::tokenize (cyclomatic 25): mise::task::workspace::gradle::tokenize has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/gradle.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b20133513faab2c25a41907ed6452c342aa858f4d8dcc2c230f00fb369c2c4"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::packages_from_specs_with_config_files (cyclomatic 24): mise_system::packages_from_specs_with_config_files has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/lib.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d789568e31bdb552f754bfc0eaab137216052f92ed59aa9a451aaaca001c9cd"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::sync::origin::set_inner (cyclomatic 24): mise_system::history::sync::origin::set_inner has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/origin.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"726384ba52cfca81c3c67e9508dd675d531ba9e68e8ea276868cfeef77bf7396"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::sync::run::apply_resolutions (cyclomatic 24): mise_system::history::sync::run::apply_resolutions has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d0672610f112269885d65b095d264ad25727c7ce4da6684159c08f97e5b21e"}},{"ruleId":"D1","level":"warning","message":{"text":"MiseBackendProvider::list_backends (cyclomatic 24): MiseBackendProvider::list_backends has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/edit.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2da80555ba00c6659ed332e39eaffc8168dcfbb66ffe4b917d322ce1648a9a"}},{"ruleId":"D1","level":"warning","message":{"text":"HookEnv::build_path_operations (cyclomatic 24): HookEnv::build_path_operations has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/hook_env.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b0e7d034050fcb86fbfd4c6ba43db6baf3af9cf6eaac965bcc09152954c093"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvResults::file (cyclomatic 24): EnvResults::file has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/file.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbf2d9efff8b9689bfdafce401b49165a8282124bd91528f6aabc8f072441c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::load_env (cyclomatic 24): Config::load_env has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"676f74a161a2d952f714a5f9088b8a75887c33cfcc0a11d400dfa48ddeaec85f"}},{"ruleId":"D1","level":"warning","message":{"text":"Deps::new_with_cycle_limit (cyclomatic 24): Deps::new_with_cycle_limit has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/deps.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8750c5bc477b9f1d8dc8ddb877f66c9d48eb8599d83a6fe66bdc5baea8cd1a0"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskExecutor::inject_and_wait (cyclomatic 24): TaskExecutor::inject_and_wait has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f3e8229da52a9a1f255975d9417bd63c8656c5aaef89b373cffab4c08d8970"}},{"ruleId":"D1","level":"warning","message":{"text":"Scheduler::run_loop (cyclomatic 24): Scheduler::run_loop has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_scheduler.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"419fdab4907568e697c5432bc7101888772c7f7ce7e668515035a2b6488e8565"}},{"ruleId":"D1","level":"warning","message":{"text":"UvWorkspaceProvider::discover_with_context (cyclomatic 24): UvWorkspaceProvider::discover_with_context has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/uv.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0f76e7ab5ed23772284ba1ba968a4fab28c81f63b358de2804fb36eaef3379"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::lockfile::format (cyclomatic 24): mise::lockfile::format has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":6351}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe442561dc1ecf07f310b2cd31f4b7b4eb2c396222918718f62b94c765a31ab"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_daemons::presets::run_steps (cyclomatic 23): mise_daemons::presets::run_steps has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/presets.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24a0978646349236c20630b08eedf99ee4b056f4fd2eb479825798771fed732"}},{"ruleId":"D1","level":"warning","message":{"text":"TrackedSet::add_requests (cyclomatic 23): TrackedSet::add_requests has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbd39c1be819d31ad8b44eb29611c02d0257ab6f5424daf401e8bfef5d5b33d"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::cask::state::validate_cask_prune_candidate (cyclomatic 23): mise_system_packages::brew::cask::state::validate_cask_prune_candidate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/state.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d9646b598752cc71fcf7d8c8d542db04fbd3b822e7171b25cf6b7a53a81feb"}},{"ruleId":"D1","level":"warning","message":{"text":"Project::run (cyclomatic 23): Project::run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/project.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c70a5006bcf537334c6256d24eed4eac727149ba923e6cf5aa2427f891d958f"}},{"ruleId":"D1","level":"warning","message":{"text":"Unuse::run (cyclomatic 23): Unuse::run has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/unuse.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5590d088f7f1c5535108fcabec38171999804e1edb305e23ba80931d5077800"}},{"ruleId":"D1","level":"warning","message":{"text":"Lockfile::read (cyclomatic 23): Lockfile::read has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a953ec3d0cc9333c7941a859200a5cb12b8bf8ab0d45908fd4851b05437cfe65"}},{"ruleId":"D1","level":"warning","message":{"text":"Lockfile::set_platform_info (cyclomatic 23): Lockfile::set_platform_info has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"700bdc31e60df824b88d78c946b8b1e8c9081ea8732cc606a8e3c6b4ad5c7325"}},{"ruleId":"D1","level":"warning","message":{"text":"Toolset::install_with_deps (cyclomatic 23): Toolset::install_with_deps has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/toolset_install.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"e758b40c9a344d54bbc0cc64112ae97d3d9d0f8d1889f0a35ef4dfaa11ae4cea"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::backend::static_helpers::clean_binary_name (cyclomatic 23): mise::backend::static_helpers::clean_binary_name has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/static_helpers.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5c6ca0f73087373470428a3e21e6b308506e862da85dd7890f709102bf9036"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::generate::task_stubs::validate_stub_paths (cyclomatic 23): mise::cli::generate::task_stubs::validate_stub_paths 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":"src/cli/generate/task_stubs.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"10415a73c0e02f5e60ca13bdf2fe60b88490eebe3acf786208c392a1ab7f3821"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::load_task_sources_from_configs (cyclomatic 23): mise::config::load_task_sources_from_configs has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":7738}}}],"partialFingerprints":{"codehealthFindingId/v1":"df15f3b1e3f1dafafb09667d7d35f8b06bf62cc44e2c650b34fa7cb3ff9ea281"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::sops::decrypt (cyclomatic 23): mise::sops::decrypt has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sops.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9a4d5b0c70bfe3ea38e51d77a6727f6d5c7626885f428ef114f1628bbe55d9"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::toolset::get_versions_needed_by_tracked_configs_with_progress (cyclomatic 23): mise::toolset::get_versions_needed_by_tracked_configs_with_progress has cyclomatic complexity 23 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/mod.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cb617c5af019cc7d5584a2cd080fd43ca039636a8011151a70abfb9a12c8d7"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.compare_dirs (cyclomatic 23): scan.compare_dirs has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/scan.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4794b30184e326b5525232070b8b95a9efb859da3b66d47a0b035841ac2fad9"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_brew_relocation::relocate_keg_with_replacements (cyclomatic 22): mise_brew_relocation::relocate_keg_with_replacements 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":"crates/mise-brew-relocation/src/lib.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59514bad60dc5a4a3cb4ec9a06eaaf8c81501823fcc8462aea351d6b1359c2d"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteHost::validate_with_source (cyclomatic 22): RemoteHost::validate_with_source 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":"crates/mise-system/src/remote.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e192afd00bd443349e333847339199522076318bad7ee71bba9e9a12e22be26"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_util::agecrypt::load_identities (cyclomatic 22): mise_util::agecrypt::load_identities 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":"crates/mise-util/src/agecrypt.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"095aa99c09c5e2db679ddf2002b79aa9b5cd74595e4ca2b5c32b137b432d0e13"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_util::env_diff::normalize_escape_sequences (cyclomatic 22): mise_util::env_diff::normalize_escape_sequences 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":"crates/mise-util/src/env_diff.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"1555bce4e1b6ed9b1c63c49daa25d3ef44c866a110a440b180c24d7ec3d6e214"}},{"ruleId":"D1","level":"warning","message":{"text":"CargoBackend::install_crate (cyclomatic 22): CargoBackend::install_crate 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":"src/backend/cargo.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00f8eddc8b6fcb1e2ab725125cc5906b4cc0e061af6c478ef5f34cd5c3c557c"}},{"ruleId":"D1","level":"warning","message":{"text":"Bootstrap::run_from (cyclomatic 22): Bootstrap::run_from has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Commands::run (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":"src/cli/bootstrap.rs"},"region":{"startLine":2520}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d4c47ac9e36b33d13255867d6720876f1ebec7dbb2043f153463c49691197f"}},{"ruleId":"D1","level":"warning","message":{"text":"DotfilesPaths::run (cyclomatic 22): DotfilesPaths::run has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/paths.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcf29a025cf419efb98af679a7a0dbce13c3b331df2b80f441a86203eafacf1"}},{"ruleId":"D1","level":"warning","message":{"text":"TasksInfo::display (cyclomatic 22): TasksInfo::display 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":"src/cli/tasks/info.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f313bf1e26bca3d2a4bb107a63e5e3c861fd4b5288176f5055025bc7d2c3b2"}},{"ruleId":"D1","level":"warning","message":{"text":"MiseToml::replace_versions (cyclomatic 22): MiseToml::replace_versions 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":"src/config/config_file/mise_toml.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab372bbfdcb5ea70f2cad855ba56c4316bfba0d3d4a1d4940262510c0ff302a"}},{"ruleId":"D1","level":"warning","message":{"text":"PlatformInfo::merge_with (cyclomatic 22): PlatformInfo::merge_with 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":"src/lockfile.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38bcbaf6015ce8a4c84a5980d7d744d1a14fa7f76ca39baa7f6c9e837087e8a"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolOptions::insert_core_option (cyclomatic 22): ToolOptions::insert_core_option 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":"src/toolset/tool_version_options.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd8df32527e973070b2f57fc9461bc90ca2deea2944a6eb0c211139094961e5"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::hooks::run_one_hook_with_context (cyclomatic 22): mise::hooks::run_one_hook_with_context 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":"src/hooks.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"faeb15a6940bb7d2d056217676039daa0b3737130688140b8f559b83768f3098"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::install_layout::resolver::locate (cyclomatic 22): mise::install_layout::resolver::locate 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":"src/install_layout/resolver.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"492120d805c29e1569c85f3d51c199fe5bcb74ea5ae8d72029110b284aff2c10"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::packslip::sync_skills (cyclomatic 22): mise::packslip::sync_skills 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":"src/packslip.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f8111f334c83c3bc9c29f9ffdb33c690a72d75801823f0b7f361b2abf99749"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::shims::sync_command_wrapper_shims (cyclomatic 22): mise::shims::sync_command_wrapper_shims 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":"src/shims.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9050c5152d73f04ec68d1d598c0a4d3b233aa15055e576ee7b816788f800346"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_config::schema::settings::element (cyclomatic 21): mise_config::schema::settings::element has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/schema/settings.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"79509f4ce933ae66736ec0dd1b0d3338f9ae8c5115e106248b472f60c1791b52"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::edits::resolve_entry (cyclomatic 21): mise_system::edits::resolve_entry has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/edits.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a8574b0d4770e6c854378bc48d8e355803863f325f30170cf08c914854e6c5"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::execute_unapply (cyclomatic 21): mise_system::files::execute_unapply 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":"crates/mise-system/src/files.rs"},"region":{"startLine":4921}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8925e5f7ec0959d8d3d4575a1e2c34b35892b58d7642072ec87190d3f4a7e77"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::systemd::render_service (cyclomatic 21): mise_system::systemd::render_service has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/systemd.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"6427e735d146a67b24e500af1392ce5f7b7791bcba98c2ad3a40a6911224d84b"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::cask::installed_skip_reason (cyclomatic 21): mise_system_packages::brew::cask::installed_skip_reason has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7bde8ffdbcbde609739b94e9336268e4d990f803692228c4cffb389c0091f1"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_util::cache::prune_dir (cyclomatic 21): mise_util::cache::prune_dir 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":"crates/mise-util/src/cache.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7b2513d4ef4fc1414ff09dc5a68277560021136788bfa2d2c4e50eed1d359b"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_util::github::resolve_token_inner (cyclomatic 21): mise_util::github::resolve_token_inner 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":"crates/mise-util/src/github.rs"},"region":{"startLine":2107}}}],"partialFingerprints":{"codehealthFindingId/v1":"846c73678b18fde324fc95893d9744810d324971c6979677a5c65f7f594b51b9"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_util::github_relay::unix::forward (cyclomatic 21): mise_util::github_relay::unix::forward 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":"crates/mise-util/src/github_relay.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"470e2eb8ed7edc6f417bed65219b0bddc68387464eae0bb33815c03bf8926c69"}},{"ruleId":"D1","level":"warning","message":{"text":"UnifiedGitBackend::verify_provenance_at_lock_time (cyclomatic 21): UnifiedGitBackend::verify_provenance_at_lock_time 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":"src/backend/github.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca3551e4e2aa72ce11a8d6feb3b3bb8ce7481406be4804a2a042b657b3a2168"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::is_version_installed (cyclomatic 21): Backend::is_version_installed has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: mise::backend::arg_to_backend (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":"src/backend/mod.rs"},"region":{"startLine":3892}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a7f8ba1a1728bb609ae0264ecc2e24de20b620dafcb385123386c24cf23be2"}},{"ruleId":"D1","level":"warning","message":{"text":"BackendsSwitch::switch (cyclomatic 21): BackendsSwitch::switch 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":"src/cli/backends/switch.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"877dd74310fa20dabc3d349b81594589189a09da0136ffdf89f1ed81caf7ea64"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapStatus::collect_dotfiles (cyclomatic 21): BootstrapStatus::collect_dotfiles has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Commands::run (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":"src/cli/bootstrap.rs"},"region":{"startLine":4655}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e17b670627e585277e47d327b7259d657010e5c2f5efe86ca412a6dec7fb690"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputHandler::replay_cached_output (cyclomatic 21): OutputHandler::replay_cached_output 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":"src/task/task_output_handler.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68ae8add37063152073f25744877707ef806aa9e932f0c7359c4f2cea238a21"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::installs::migrate::recover_interrupted (cyclomatic 21): mise::cli::installs::migrate::recover_interrupted 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":"src/cli/installs/migrate.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76432fd37bc391191a3d0c1e744391e3fa3beec5176ee61efb0c35910062357"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::tool_purgatory::auto_prune (cyclomatic 21): mise::tool_purgatory::auto_prune has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_purgatory.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9943dfa2c721e5384793c7b87e8976d0349abf3c46452714c05e9eed1ae5e8b6"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_brew_relocation::macho::patch_slice (cyclomatic 20): mise_brew_relocation::macho::patch_slice 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":"crates/mise-brew-relocation/src/macho.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"34de775e30d460f4a384d11ae86fa412d7dce4638fa3199d2bc095e63a2ff587"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_unquoted (cyclomatic 20): Parser::parse_unquoted 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":"crates/mise-dotenv/src/parse.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"1740587f52d41925770d90295ddf9997a83efbbf24d632d446e15f80e0ff1b43"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::sync::run::prepare (cyclomatic 20): mise_system::history::sync::run::prepare 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":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"321cf726c1a4dfc714d75bc17efc8be9abf66ef0dd14c751f3132d0846cb6371"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::user_services::status_one (cyclomatic 20): mise_system::user_services::status_one 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":"crates/mise-system/src/user_services.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"678e976f1459c4a8466111158d09c7dfd8bb3e67b958264682a4132f07ec93e8"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::resolve::resolve_closure_pairs (cyclomatic 20): mise_system_packages::brew::resolve::resolve_closure_pairs has cyclomatic complexity 20 (threshold 15). Of this number, 16 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":"crates/mise-system-packages/src/brew/resolve.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02677cbc127ce8b33c1d9913c04c2d926286c8bdf1c039a32a4c278e6aac671"}},{"ruleId":"D1","level":"warning","message":{"text":"PIPXBackend::validate_uv_lock (cyclomatic 20): PIPXBackend::validate_uv_lock 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":"src/backend/pipx/lock.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bd0c0386c81fcd63129919e68bfd22620cd06be9f02e8168343a06bb75a0cc"}},{"ruleId":"D1","level":"warning","message":{"text":"DotfilesUnapply::run_inner (cyclomatic 20): DotfilesUnapply::run_inner has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/unapply.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d985d7e37ef0216da1890961789f5c91faf5f63536016da99d400905ab517bbe"}},{"ruleId":"D1","level":"warning","message":{"text":"HookEnv::run (cyclomatic 20): HookEnv::run has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/hook_env.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"935aa896f03d654e6432ca3541cb58e78de670cecc03944eb1826df0cf86f8c2"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::load_local_tasks_with_context (cyclomatic 20): mise::config::load_local_tasks_with_context 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":"src/config/mod.rs"},"region":{"startLine":5727}}}],"partialFingerprints":{"codehealthFindingId/v1":"4333dc78d9163a6c49990ec291349098c8cecad5659e097f844c7b406203d98a"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::expand_config_roots_inner_for (cyclomatic 20): mise::config::expand_config_roots_inner_for 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":"src/config/mod.rs"},"region":{"startLine":5952}}}],"partialFingerprints":{"codehealthFindingId/v1":"268157f501b87a430e21db697b0155d57071b0ef96942ab023a9737ec35fc3ed"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::discover_monorepo_subdirs (cyclomatic 20): mise::config::discover_monorepo_subdirs 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":"src/config/mod.rs"},"region":{"startLine":6112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e678a87df326e927f8e619f8b8f880307b0eaa8fa755b3848db64d95d14cf4c4"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::daemons::tasks::start (cyclomatic 20): mise::daemons::tasks::start 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":"src/daemons/tasks.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3ea2379161a0c93e685ead2ae756266850708575cd2540b51130295c7819ed"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposeRequest::action_args (cyclomatic 19): ComposeRequest::action_args has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/compose.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23c55daf039a908ef1cd5e6c51adea8b23c9bc6469e0e8e06a5021ea4cff77a"}},{"ruleId":"D1","level":"warning","message":{"text":"FirewallRequest::plans (cyclomatic 19): FirewallRequest::plans 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":"crates/mise-system/src/firewall.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b79aa8494e81ea77ac4b539fa7eefe1fe116d3843cdae3a79d9c52513924ad0"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryRepo::decrypted_diff (cyclomatic 19): HistoryRepo::decrypted_diff has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6938e57acdb690507b9e4e42a0fa96abd0d99ca26cbf1e2d1990c8ee6a223e0"}},{"ruleId":"D1","level":"warning","message":{"text":"RepoRequest::from_toml (cyclomatic 19): RepoRequest::from_toml has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/repos.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"df33668bead425ddc3b976fd84d7e38c82c840b25a22f86117d43f822939709d"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::merge_manager_packages (cyclomatic 19): mise_system::merge_manager_packages has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/lib.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"6539f0815d72ae30acc9139fb57faff5041f11a4e7db67fb7fdb0ad5b8c6f716"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::dotfile_groups::expand_group (cyclomatic 19): mise_system::dotfile_groups::expand_group has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/dotfile_groups.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d506fb5b333a39ae3b467842e3390d00131b65c5b36448015063fbd9b111e2"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::edits::print_diffs (cyclomatic 19): mise_system::edits::print_diffs 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":"crates/mise-system/src/edits.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73af32ecf9bde730b6bd954eb07b1f00969408a71a3eff1fadb76405c3abd42"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::replay::rollback (cyclomatic 19): mise_system::history::replay::rollback has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de317af207e8241cdf4a663aab100f5a909f9d41414a33d4811e9ccd9f04894"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::post_install::apply_mode (cyclomatic 19): mise_system_packages::brew::post_install::apply_mode 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":"crates/mise-system-packages/src/brew/post_install.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ead2e1ff33f9848283f3b20bb026255fda18dcf5154dc92b96e93bfc1029c4c"}},{"ruleId":"D1","level":"warning","message":{"text":"UnifiedGitBackend::discover_bin_paths (cyclomatic 19): UnifiedGitBackend::discover_bin_paths has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"280d76e0770b0114491339ce8cbcc8c9f41cf41eb9aa1c4a7d38ca1533148b82"}},{"ruleId":"D1","level":"warning","message":{"text":"DepsInstall::run (cyclomatic 19): DepsInstall::run 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":"src/cli/deps/install.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1837cbad7753b1da24f4157f6137ac9df6c44d76425e920be0a054e5735baa11"}},{"ruleId":"D1","level":"warning","message":{"text":"Install::install_runtimes (cyclomatic 19): Install::install_runtimes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/install.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"313c984527538125b47ca1b926daf535e8de6438a3f87489a5f982e536e74112"}},{"ruleId":"D1","level":"warning","message":{"text":"Ssh::run_inner (cyclomatic 19): Ssh::run_inner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ssh.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e955f85f34b2095ee603ae20471119447a1c13a7cf03c1feda53708009f8f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Upgrade::warn_if_newer_versions_hidden_by_minimum_release_age (cyclomatic 19): Upgrade::warn_if_newer_versions_hidden_by_minimum_release_age has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/upgrade.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f74a7c819bf2dfdf62cea7c23362f273d375d80887bef8e985abc500cb4fae2"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonPlugin::install_precompiled (cyclomatic 19): PythonPlugin::install_precompiled has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/python.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"124b7c257556d70e6a704c98c9791baa14482949985bc3f78161cb0e6194d817"}},{"ruleId":"D1","level":"warning","message":{"text":"Task::render (cyclomatic 19): Task::render has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cb1837138a18c0d8603c6743a45eecb760fbcb7337c2004deaef82ca5a5662"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskExecutor::prepare_task_context (cyclomatic 19): TaskExecutor::prepare_task_context 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":"src/task/task_executor.rs"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"95224f4242b1c8cdfc871c65d3904c5a7268ee52580b1f470d7f02729c4d14eb"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskScriptParser::register_task_source_files_function (cyclomatic 19): TaskScriptParser::register_task_source_files_function has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_script_parser.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed562c3972e0130068d6013ef5145ccfcf0f08e5643e76086a50088e228d70d6"}},{"ruleId":"D1","level":"warning","message":{"text":"CargoWorkspaceProvider::discover_with_context (cyclomatic 19): CargoWorkspaceProvider::discover_with_context has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/cargo.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbdb2d9461c4381649279c2ca7a56158b5ec460fd329546e3580b086496598f"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::backend::jq::extract_recursive (cyclomatic 19): mise::backend::jq::extract_recursive has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/jq.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da57755bdea95094b887947935c61925ee922eabedd199aeb64e6ba14ee9c64"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::backend::static_helpers::install_artifact (cyclomatic 19): mise::backend::static_helpers::install_artifact has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/static_helpers.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ac51cc7b0147dcf031ddc7e674a10ad795f38b0e09b243a3cb72b8e3cdae39"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::bootstrap::config_files_after_dotfiles_dry_run (cyclomatic 19): mise::cli::bootstrap::config_files_after_dotfiles_dry_run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Commands::run (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":"src/cli/bootstrap.rs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d3aced97771bc0736132c73aab06248a7021fbdcaa14f5913b4c900648a756"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::exec::exec_program (cyclomatic 19): mise::cli::exec::exec_program has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/exec.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f943fcd694a1bf281c72fe5c77f372a4046421e1956c6292d2b3a394e2f81bb"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::settings::load (cyclomatic 19): mise::config::settings::load 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":"src/config/settings.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66cec8e5738f41b1f0a0639d8928fdff8d0246a8671829d21215680e0e070bd"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::hooks::execute (cyclomatic 19): mise::hooks::execute 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":"src/hooks.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"a155da69c4fd0c7a8eb2a083c430db7ae0679abdee7247b7cd68e27a6cf2c8d2"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::install_layout::resolver::allocate (cyclomatic 19): mise::install_layout::resolver::allocate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/install_layout/resolver.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a035b78e90cb350a0a14871b6427baef6255a3d50ddb3478dd61227abac0a1cc"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::lockfile::migrate_monorepo_lockfiles_inner (cyclomatic 19): mise::lockfile::migrate_monorepo_lockfiles_inner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"e890cb39bb668a2c87d2770845bffa2c0edae7cfb02413d9047b4b157ccc273c"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::lockfile::merge_tool_entries (cyclomatic 19): mise::lockfile::merge_tool_entries has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":4838}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a25ea95a685177c4d164c1b9d1f9200b5c162f8ddb5a7946d7adcd3da474913"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::task_cache_store::materialize_remote_tree (cyclomatic 19): mise::task::task_cache_store::materialize_remote_tree has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache_store.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f1e10cb99e13c474dc63d2745703425cf11e769c5ab87e747a0d93ce05aebf"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::task_source_checker::sources_are_fresh (cyclomatic 19): mise::task::task_source_checker::sources_are_fresh has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_source_checker.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b734fc0312634d758d7bb25da39a491d7ea80e5c0975ef4d3592f19d0b57b7"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::workspace::go::unescape_go_string (cyclomatic 19): mise::task::workspace::go::unescape_go_string 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":"src/task/workspace/go.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fd6ffffac440034d6a6f37d3fe1670fc394786beded7140d02fd85559fc63d"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::workspace::gradle::parse_settings (cyclomatic 19): mise::task::workspace::gradle::parse_settings has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/gradle.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f0c855ffac03c486db997afbab7d3e7a6c8b75bd578aca45726b853cba317e"}},{"ruleId":"D1","level":"warning","message":{"text":"record.main (cyclomatic 19): record.main has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/record.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d3ad4a4dc9974dcc71520c6ce1f74ebd9fdd35bc1368546b5d494e96f62a40"}},{"ruleId":"D1","level":"warning","message":{"text":"config-reference.data.referenceMarkdown (cyclomatic 19): config-reference.data.referenceMarkdown has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to 7 function items inside it that branch (details, entry, about, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/config-reference.data.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a66a4771e4bc3912d8bb88bb6bea7b826c0a8ada4a5229ade976f1f9944902e"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_brew_metadata::cask::artifacts::cask_artifacts (cyclomatic 18): mise_brew_metadata::cask::artifacts::cask_artifacts 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":"crates/mise-brew-metadata/src/cask/artifacts.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"760280f66d1f210a906f9d13826f7afc09be0c8b676edb791d0564ae9a6c53ac"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_brew_metadata::cask::flight::step::parse_flight_step (cyclomatic 18): mise_brew_metadata::cask::flight::step::parse_flight_step 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":"crates/mise-brew-metadata/src/cask/flight/step.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7875393507d805c0809c33bffb7b0257ddec744bec1e33fbfda64172f21d4b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Promotion::snapshot (cyclomatic 18): Promotion::snapshot 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":"crates/mise-system/src/history/checkpoint/preimages.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb286e9e91e89d47eec730f468bf8367fe918d906083ed8a20b3b36ffcd954a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::rewrite (cyclomatic 18): Walk::rewrite 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":"crates/mise-system/src/history/purge.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88db53216fd3ae2d2307e11b8c561c3e13d027be8da53847965146c6693de75"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemdRequest::from_toml (cyclomatic 18): SystemdRequest::from_toml has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/systemd.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0f6500e42b49bf2b5aaf853d2e90f66ab22cdc7437f4bec92f27f9b75cf893"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::replay::classify_coverage (cyclomatic 18): mise_system::history::replay::classify_coverage 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":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"94001dc6a48f197e237236b77374348300708375de3920200bbe03232f73b718"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::replay::write_object (cyclomatic 18): mise_system::history::replay::write_object has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"df525d43fdfdd150f73da00c4673fb5c461abccb9869ad06627f9b0caa96d336"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::managed_files::open_or_create_directory_tree_inner (cyclomatic 18): mise_system::managed_files::open_or_create_directory_tree_inner 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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1c09143693a9453517934daae2d6de082a73fe89fedfa96aec873e6c0bc48a"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::services::apply_with_notifications (cyclomatic 18): mise_system::services::apply_with_notifications 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":"crates/mise-system/src/services.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8e33bb5653984632e274c9119f633cef254c617455f082e7412a721a806eff"}},{"ruleId":"D1","level":"warning","message":{"text":"Token::compare (cyclomatic 18): Token::compare 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":"crates/mise-system-packages/src/brew/cask/app_version.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2d2ed9c98bc9a6b01009c06644928a008608b95ea27e0079264b79ecd4aae9"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::pour::link_keg (cyclomatic 18): mise_system_packages::brew::pour::link_keg 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":"crates/mise-system-packages/src/brew/pour.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4dbd206d6967c85955a8d1426f48951190ff4f23eb765cfae1836de89ded64"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_util::github::sigstore::verify_with_mirror (cyclomatic 18): mise_util::github::sigstore::verify_with_mirror 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":"crates/mise-util/src/github/sigstore.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab64ce3b87af6c9731dbd6eabeb3d62808067acc3cd2fa3209baa1e6b833891"}},{"ruleId":"D1","level":"warning","message":{"text":"AquaBackend::install (cyclomatic 18): AquaBackend::install has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a34faeea7a13317a4414f7889879eae2540a9fce33edb943027705fe22e5ac"}},{"ruleId":"D1","level":"warning","message":{"text":"Backend::list_remote_versions_with_info_and_options (cyclomatic 18): Backend::list_remote_versions_with_info_and_options has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: mise::backend::arg_to_backend (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":"src/backend/mod.rs"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d4c71b66215ee01b5850a46b60437964173d531558bbdf51f8d3a0df7572d2"}},{"ruleId":"D1","level":"warning","message":{"text":"PIPXBackend::is_install_satisfied (cyclomatic 18): PIPXBackend::is_install_satisfied 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":"src/backend/pipx.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"4277afb2bd9223bc59cf34269198a38bec2bf2818c435c3ab1f1318afa3c092c"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapRemote::run (cyclomatic 18): BootstrapRemote::run 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: Commands::run (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":"src/cli/bootstrap.rs"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2eb7dfd8f04ec1022c5c18aa7a4bce713325aa06ac681d7796269a23a70d0b"}},{"ruleId":"D1","level":"warning","message":{"text":"TomlOpenState::feed (cyclomatic 18): TomlOpenState::feed 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":"src/task/mod.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7734051df496b41e71c26ac6f4aed753b88d3995315ff2e933f032a40f42959"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskCacheAudit::report (cyclomatic 18): TaskCacheAudit::report has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache_audit.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba093dbe7cdbef1fec1e8594aa751eb38ff53812cadbc7807a0a1b4e3db350f"}},{"ruleId":"D1","level":"warning","message":{"text":"Toolset::list_outdated_versions_selecting (cyclomatic 18): Toolset::list_outdated_versions_selecting has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/mod.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74773df6a2d126af0f68e83a0832af48fc6e2f29af9a361320533a9175d3bcd"}},{"ruleId":"D1","level":"warning","message":{"text":"Toolset::sort_by_overrides (cyclomatic 18): Toolset::sort_by_overrides 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":"src/toolset/mod.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"737be6d0891d2ce6aa8f7a342ec479e6184f7d70351b28829165a2bc9efe29eb"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::backend::version_list::parse_version_list (cyclomatic 18): mise::backend::version_list::parse_version_list 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":"src/backend/version_list.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadb08b20b8c9ac6639df7be4a19316ac0c89bfe3bc2171acceb3f9bce1499da"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::load_tasks_includes (cyclomatic 18): mise::config::load_tasks_includes 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":"src/config/mod.rs"},"region":{"startLine":6923}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c30f736ab206bd49b9e95436552ad284014826ac34730de6308b12b60d7b89a"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::config_file::trust_check (cyclomatic 18): mise::config::config_file::trust_check has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mod.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca6705ee85a56eec7931da7782ae4219f06f6383c3cf140d638bf9b266b28b3"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::packslip::completion_script (cyclomatic 18): mise::packslip::completion_script 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":"src/packslip.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c463826d22d4478b592aeef3a99576d92da9fabfdec54a1885734637ce49bcdc"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::plugins::git_plugin_drift (cyclomatic 18): mise::plugins::git_plugin_drift has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/mod.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"39dc63aaded5c8eaee0d05789fb1f686c6429bf0cc35b83a9fbda2e59295b5a0"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::secrets::grant::static_problems (cyclomatic 18): mise::secrets::grant::static_problems has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/grant.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6aacf71e9511021000b3ea3dccf501e5fa10bccd1ed827cd183cf19d9a3c56"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::task_source_checker::expand_glob_braces::find_group (cyclomatic 18): mise::task::task_source_checker::expand_glob_braces::find_group 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":"src/task/task_source_checker.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ae7ca20c883654645f90addc61c0e71e3e9d4c01ce3d2429315fe7f24ecd19"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::task_source_checker::glob_walk (cyclomatic 18): mise::task::task_source_checker::glob_walk has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 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":"src/task/task_source_checker.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15beb916e9617f42fca5054b04eb4ebd0af1450cc8fd4f9ec9dd369ba421aec"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.compare (cyclomatic 18): scan.compare 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":"docs/.vitepress/showreel-capture/scan.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecc7cca6e97e25bccaaf54fe5f66300d05f8e79d9b5312c4a5aa276a864b814"}},{"ruleId":"D1","level":"warning","message":{"text":"scan.summarize (cyclomatic 18): scan.summarize 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":"docs/.vitepress/showreel-capture/scan.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2067ac11c5a1344c05aaa2550e6ba857ecc2d58f9a5bf226b26d0dd9ad391ada"}},{"ruleId":"D1","level":"warning","message":{"text":"shape.main (cyclomatic 18): shape.main has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/shape.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f8b32b3ee6c6ff15fcc4f52e88605467c94454c47b12c5123a3abf56bd051c"}},{"ruleId":"D1","level":"warning","message":{"text":"aqua_registry::template::lex (cyclomatic 17): aqua_registry::template::lex 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":"crates/aqua-registry/src/template.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f8952bd65e89c7adb4c3d55d80af77684c3eaade20544110fd1436e3c81569"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_agent_env::detect_with_env (cyclomatic 17): mise_agent_env::detect_with_env has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: mise_agent_env::classify_generic (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":"crates/mise-agent-env/src/lib.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"252432d64ab40f5db6db32a115e71dd4aae75546ac4e169de1f548db4c6b33b6"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapTomlConfig::merge_below (cyclomatic 17): BootstrapTomlConfig::merge_below has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/lib.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5547de91974af0c4daf7f58897b43f47ed92282d253a853f8bc6d9851c7c00a"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvDirective::fmt (cyclomatic 17): EnvDirective::fmt has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/env.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f49fa6c94c1016f7aba19b969d76c4d1ef89cd7695bc41b50b0848eb5469355"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_dotenv::render::is_unquoted_safe (cyclomatic 17): mise_dotenv::render::is_unquoted_safe 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":"crates/mise-dotenv/src/render.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccc041f5a0be86e1c286d99ec0a81e07efc25185d9929ba5134a4a360c797e5"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_lsp::tasks::cycles (cyclomatic 17): mise_lsp::tasks::cycles 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":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e2d296c786ec3ee48ef392b9e146705bd3fe2a0f4f241c71f4a485a42acf2b"}},{"ruleId":"D1","level":"warning","message":{"text":"UserRequest::from_toml (cyclomatic 17): UserRequest::from_toml has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/accounts.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d21df47d5ff3673467379090d9b2b9a34ab8c5549586eafde962976a197a80"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::files_from_config_files_with_tracking_roots (cyclomatic 17): mise_system::files::files_from_config_files_with_tracking_roots 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":"crates/mise-system/src/files.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e406ed5d60db7bbd3c95ed7e0b88a5f07fa38d5bffe4cb4f0a97debb407e919c"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::confirmation_lines (cyclomatic 17): mise_system::files::confirmation_lines 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":"crates/mise-system/src/files.rs"},"region":{"startLine":4303}}}],"partialFingerprints":{"codehealthFindingId/v1":"32847e5b2a5e0f2aeb68bdbb553db60cdfc82b9f1b5c1dc246226f3389e09a98"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::touched_paths (cyclomatic 17): mise_system::files::touched_paths 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":"crates/mise-system/src/files.rs"},"region":{"startLine":5783}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa55918ece393b0db030283c88aafb46afb5ffb8981e2e2e1fca354928b950e"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::sync::onboard::run (cyclomatic 17): mise_system::history::sync::onboard::run has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/onboard.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d893cd334f7203e8e59cbb15d0aae492fdc9fab98a4044fe39d62cea23e9f3d"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::cask::prewarm_downloads (cyclomatic 17): mise_system_packages::brew::cask::prewarm_downloads 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":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1650690e0d0a9e2777014871fc50d1e296823321bf82c7fce992c10085f154"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::post_install::copy_tree (cyclomatic 17): mise_system_packages::brew::post_install::copy_tree 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":"crates/mise-system-packages/src/brew/post_install.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7ca3e04db96585db19973b8fe7d89d46ac3464b8e61f65e6611853b64822e5"}},{"ruleId":"D1","level":"warning","message":{"text":"Vfox::verify (cyclomatic 17): Vfox::verify 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":"crates/vfox/src/vfox/install.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68535f3547490d6c49568e5c4858b2140df40507e71c74052b7bc043c9cba87"}},{"ruleId":"D1","level":"warning","message":{"text":"CondaBackend::create_bin_launcher_dir (cyclomatic 17): CondaBackend::create_bin_launcher_dir has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/conda.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"938456bc0be101760884bfc59d4638aa8e6a64c5871d4ecfc7e615aa51974c8e"}},{"ruleId":"D1","level":"warning","message":{"text":"PIPXBackend::prepare_install_version (cyclomatic 17): PIPXBackend::prepare_install_version has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/pipx.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"899dc5f5b2bbb511159532d3695af47a4acd19424f81ef3d3ab3e72a80aa945b"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapStatus::collect_packages (cyclomatic 17): BootstrapStatus::collect_packages 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: Commands::run (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":"src/cli/bootstrap.rs"},"region":{"startLine":4489}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe540a09ec9b12d864dd3e2061bc9f413b5525a5a2260d7484ad55e6866d972"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigGet::run (cyclomatic 17): ConfigGet::run has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/config/get.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f192936e6b925cdcdc11cff534f1e610ab2f798351e4eda094dea701fba4728"}},{"ruleId":"D1","level":"warning","message":{"text":"Project::check (cyclomatic 17): Project::check has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/project.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf22f7d1d1d097fd99ef62251a2701682e58a8243bb60c783f8c7e3a372ec79"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryDiff::run (cyclomatic 17): HistoryDiff::run has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/history/diff.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7e038f08809476e1c05e25619aedc045f9b57ca131122b9ae73099950ba42a"}},{"ruleId":"D1","level":"warning","message":{"text":"DotfilesSave::save (cyclomatic 17): DotfilesSave::save has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/save.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0ac9cf12fdec5895d15e208492c53986f8b76491c9ae31b90e567905b4bded"}},{"ruleId":"D1","level":"warning","message":{"text":"DepsEngine::new_monorepo_with_fallback (cyclomatic 17): DepsEngine::new_monorepo_with_fallback has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ceace386ec6cb70a2a6520b5f942d73c1f0146483540ea60ec59f2f9410ca0f"}},{"ruleId":"D1","level":"warning","message":{"text":"DepsEngine::execute_command (cyclomatic 17): DepsEngine::execute_command has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5add9ba0515b89feb304d99a983f2b53275df6dd39f7ce7664e974a86c34615"}},{"ruleId":"D1","level":"warning","message":{"text":"Task::resolve_workspace_task_dependencies (cyclomatic 17): Task::resolve_workspace_task_dependencies has cyclomatic complexity 17 (threshold 15). Of this number, 13 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":"src/task/mod.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4beadd37a678d9c1e536f41e3a9f354160fc0d57b6cd1970a23de32725c0e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Task::render_runtime_templates_with_usage (cyclomatic 17): Task::render_runtime_templates_with_usage has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3ee836a7b49699c974fcece72bf580b2ac38aaf086c03809135439bda97969"}},{"ruleId":"D1","level":"warning","message":{"text":"GradleWorkspaceProvider::discover_with_context (cyclomatic 17): GradleWorkspaceProvider::discover_with_context has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/gradle.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13cdaec8eee3abcc6ff18cad386f30a90955015d2681e5427c0e45295e2d5ee"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolsetBuilder::warn_overridden_lockfiles (cyclomatic 17): ToolsetBuilder::warn_overridden_lockfiles has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/builder.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c4a05fcc321dfbda9caebd55a00f391973103dfadf6d285a6e7396edf63b41"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::escape_task_args (cyclomatic 17): mise::cli::escape_task_args 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: Commands::run (cyclomatic 79) 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":"src/cli/mod.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80d0bb029d2a4f3e6bdbc9277a4b038dfeeff17d30a939a6642ded77a0a28bb"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::bootstrap_dry_run_vars (cyclomatic 17): mise::config::bootstrap_dry_run_vars has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":4564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4494bc4fe3d10514209d4774007a50c676138c7b98a083cb686991d6a19ea453"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::packslip::completion_sources_among (cyclomatic 17): mise::packslip::completion_sources_among has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packslip.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb16571dfd2705a74183da080f9ce9e332b6baf872d667e2fe15929bc249a04"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::runtime_symlinks::list_symlinks_for_dir (cyclomatic 17): mise::runtime_symlinks::list_symlinks_for_dir has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_symlinks.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6708637f727603e65a8a68b4ee884ba38ffaaacc668edb230b9ad8faf49a6306"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::resolve_task_pattern (cyclomatic 17): mise::task::resolve_task_pattern has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":3360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a135808372f415110f969b7de40ded0900c2de77162fcfcd81d6da643c034fc2"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::toolset::install_state::remove_credential_named_installs_in (cyclomatic 17): mise::toolset::install_state::remove_credential_named_installs_in has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/install_state.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd4f90ac2e64641d3143d81cffe041d539faf45ab9d2d031b367e143222bc65"}},{"ruleId":"D1","level":"warning","message":{"text":"AquaChecksum::merge (cyclomatic 16): AquaChecksum::merge has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/aqua-registry/src/types/verification.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"901a5202b06ea7b3c8928a7876777892675fcd1bcf3c4a95f7276d3ec2282e7b"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_daemons::presets::resolve_options (cyclomatic 16): mise_daemons::presets::resolve_options 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":"crates/mise-daemons/src/presets.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd69fd02c04c6b036666f4060c7ed7139819711d54020a16c76b6751beb34918"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_daemons::prune::remove (cyclomatic 16): mise_daemons::prune::remove has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/prune.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffba769a0d5d9248d9f4940b2ac150ad6240a311459f8a984e93928887fa6d8"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::evaluate_substitution (cyclomatic 16): Parser::evaluate_substitution has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-dotenv/src/parse.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"d451bb1ea2f1b86c89d82d6cffed64fc003b6599db7238e6773aa846a70ee7a6"}},{"ruleId":"D1","level":"warning","message":{"text":"TomlDocument::parse (cyclomatic 16): TomlDocument::parse 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":"crates/mise-interactive-config/src/document/parse.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"879bea2971d9981cee7d5d481a145cd68be8b9bf7a84cc5486b82f54ee2ac0f3"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_lsp::semantic::tokens (cyclomatic 16): mise_lsp::semantic::tokens 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":"crates/mise-lsp/src/semantic.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"805201ae419630174fca1367a72e8ae01363b2e903f5e2488348baa362d616bf"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_oci::registry::parse_challenge_params (cyclomatic 16): mise_oci::registry::parse_challenge_params has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-oci/src/registry.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1595b88ba6e9f931473bc862e6ac3f67e91f1e0cab67c8d817b798e14eee367a"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_oci::registry::push_image (cyclomatic 16): mise_oci::registry::push_image 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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b778d4fb0eea0e16d3bfa5bd5b26655392d522f5cb1338aac3448735a5cb49c"}},{"ruleId":"D1","level":"warning","message":{"text":"Manifest::validate (cyclomatic 16): Manifest::validate 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":"crates/mise-system/src/history/manifest.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"69682821c3950d424d584fc035bdcec1031d006da76836f6cd3e82b6aaaab01e"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::validate_file_variants (cyclomatic 16): mise_system::files::validate_file_variants 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":"crates/mise-system/src/files.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24146d266210a719883ca0c2fb35c6669a4b0e687badda385575f488704d544"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::files::check_symlink_each (cyclomatic 16): mise_system::files::check_symlink_each has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":2822}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f6f916fe6c2e660b692e7f2a03780d0cd0ea7e8ada983883fb62260cd48f79"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::replay::undo (cyclomatic 16): mise_system::history::replay::undo 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":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a01a3946f16500dfbce2ca59a8bf7dbc9260d614375fd9a13f89dd3a75a41cc"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::history::replay::unsaved_paths (cyclomatic 16): mise_system::history::replay::unsaved_paths 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":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c32d950546358b80b5906828ce7c663f0656c04389e82e46567927ac76139fb"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::managed_files::plan_file (cyclomatic 16): mise_system::managed_files::plan_file has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df699aaa2c6c08e851963e0815cd83d23b3f50b8359eefb1a01abf24deb7b18"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::managed_files::change_runs_elevated (cyclomatic 16): mise_system::managed_files::change_runs_elevated has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62cbf2a7622530bddc73bd3e51ffe9357b23dabef5831aa5872f2ee07bd6634"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system::scheduled_tasks::apply (cyclomatic 16): mise_system::scheduled_tasks::apply 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":"crates/mise-system/src/scheduled_tasks.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1895d1239ac013930d34533ae259a5f5137b74e518fbdcef3b49921ad7178132"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::cask::app_version::compare_app_versions (cyclomatic 16): mise_system_packages::brew::cask::app_version::compare_app_versions has cyclomatic complexity 16 (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":"crates/mise-system-packages/src/brew/cask/app_version.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe52d48c71c3098861ddf046932299fab806ba9021111df59ab1a9034cf07a83"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::cask::fetch::fetch_cask (cyclomatic 16): mise_system_packages::brew::cask::fetch::fetch_cask has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/fetch.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9598c9a695e4c79f0d906ca125b6bdbe90bc2369cb9055471598be8a174c8f44"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::pour::remove_abandoned_staging_dirs (cyclomatic 16): mise_system_packages::brew::pour::remove_abandoned_staging_dirs 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":"crates/mise-system-packages/src/brew/pour.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba95cadf34a1109ef056296fa241bdbc90a815cfb7fd75fce2ada60032ee4785"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_system_packages::brew::prefix::bootstrap (cyclomatic 16): mise_system_packages::brew::prefix::bootstrap 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":"crates/mise-system-packages/src/brew/prefix.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"807a77a96b54ec4f3f9704b3b7a93acb36158f58d299d5c93f88f7ab8a78fed4"}},{"ruleId":"D1","level":"warning","message":{"text":"Client::send_scoped (cyclomatic 16): Client::send_scoped 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":"crates/mise-util/src/http.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"7500a6d77aa11358ffc96466b61965a98eedb34a69b9f41a0ca561162b006902"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_util::github::sigstore::detect_with_mirror (cyclomatic 16): mise_util::github::sigstore::detect_with_mirror 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":"crates/mise-util/src/github/sigstore.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7dc12ebe7bf5eb53ae92eb92feec577884c6d5a226ccc3335b664a73ab95143"}},{"ruleId":"D1","level":"warning","message":{"text":"mise_util::tera::tera_exec (cyclomatic 16): mise_util::tera::tera_exec 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":"crates/mise-util/src/tera.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af494d58b16616803cbff7c07b0014007fb290cdfcc429a601d70397d81661e"}},{"ruleId":"D1","level":"warning","message":{"text":"UnifiedGitBackend::detect_provenance_type (cyclomatic 16): UnifiedGitBackend::detect_provenance_type 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":"src/backend/github.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67254808293546e08a4e109a3a7c463639e27e79718bf3c8ab157d98f2569c9"}},{"ruleId":"D1","level":"warning","message":{"text":"BootstrapLaunchdStatus::run (cyclomatic 16): BootstrapLaunchdStatus::run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Commands::run (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":"src/cli/bootstrap.rs"},"region":{"startLine":5714}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c81443c729b997a52857dbed20535fa4919335b4a1956aee13acfaf4500a67"}},{"ruleId":"D1","level":"warning","message":{"text":"Install::hint_missing_system_packages (cyclomatic 16): Install::hint_missing_system_packages has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/install.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7fed5d8a4d8cfa9a1891cfbf19b5b1b66409c6afaf18a9fabdfc2f2fb08311"}},{"ruleId":"D1","level":"warning","message":{"text":"InstallsMigrate::run (cyclomatic 16): InstallsMigrate::run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/installs/migrate.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1035efb6288be76de9840ddf8b11ce83a725cbb8dc03c6889c215f0dc7909d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Lock::run_with_installed (cyclomatic 16): Lock::run_with_installed has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a52b8f9d96de6811bd656b1a21e4a2c80329766e4331805a42d789a3c039cd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Cli::settings_layer (cyclomatic 16): Cli::settings_layer has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Commands::run (cyclomatic 79) 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":"src/cli/mod.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"1549bbeac82f11f84ac5810a26fd8ec8540a49f27707b73f81f2348d88f7da70"}},{"ruleId":"D1","level":"warning","message":{"text":"Run::run (cyclomatic 16): Run::run has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/oci/run.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1275adcc2cb4e6d2bcee9372a658589dea4b49000ad78a3bf75a0346ffdcc2b"}},{"ruleId":"D1","level":"warning","message":{"text":"RubyPlugin::fetch_ruby_release_dates (cyclomatic 16): RubyPlugin::fetch_ruby_release_dates has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/ruby.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a246249db4e7fc8edc237b5853843fc797a47e3cd5d846f79be17abc3e4d2dc"}},{"ruleId":"D1","level":"warning","message":{"text":"OutdatedInfo::resolve (cyclomatic 16): OutdatedInfo::resolve has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/outdated_info.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58f93c562072b15ce3de71e005f2b370d2829c811457444fca0e7dc5068a413"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::config::explain::fits (cyclomatic 16): mise::cli::config::explain::fits has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/config/explain.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"68634d1f7b319ed20bdcbd0eb09b237d4f6980da0ac3b6f7b3ee03456b9dc3bd"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::prune::delete (cyclomatic 16): mise::cli::prune::delete 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":"src/cli/prune.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09e34b9f2b91749c642303387b66042e6e72c96c1e671a97e5d4b44bf63ac0c"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::cli::sync::reconcile::reconcile_all (cyclomatic 16): mise::cli::sync::reconcile::reconcile_all 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":"src/cli/sync/reconcile.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52ae356d60ba68f7363fcf835a71078e2eb7739f0b644c2b5705b305e534c52"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::config_file::config_root::config_root (cyclomatic 16): mise::config::config_file::config_root::config_root has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/config_root.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1467736eeabd7aa6c5dcd7ff395d6a06e6d876012d2e4e1400949faa30c5f519"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::config::miserc::scan_tag (cyclomatic 16): mise::config::miserc::scan_tag has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/miserc.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9ae70c1ce945275ba792e87fa04fd41bfad5a75309bff5a2b50afa3c1e61cb"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::lockfile::warn_outdated_lockfiles (cyclomatic 16): mise::lockfile::warn_outdated_lockfiles 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":"src/lockfile.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"512145d23d4d5a41b6c83f6bc9fedce0bd50b19e29e37fef1b65e46b1dfd12ac"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::lockfile::generate::populate_uv_locks (cyclomatic 16): mise::lockfile::generate::populate_uv_locks 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":"src/lockfile/generate.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"69156364ed648a5dc3937e432350196a1c15800bff15f2d6a15f4f1094055bed"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::oci::builder::build_dotfiles_layer (cyclomatic 16): mise::oci::builder::build_dotfiles_layer has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oci/builder.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b7366d842e759ef430319b7715dfaa8723aacaa43d7ecbc7e53f94bf4b801e"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::plugins::core::rust::nightly_channel::refresh (cyclomatic 16): mise::plugins::core::rust::nightly_channel::refresh has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/rust/nightly_channel.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ee21ef5dadbdaa03254adc1feb92db265ffd5fffbd77e8d954c2ea53675823"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::secrets::template::scan_tag (cyclomatic 16): mise::secrets::template::scan_tag has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/template.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b990fafefd5a4c13e071e85891d46a572ad12d56cf87d07c70f14cb43846a7d0"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::sops::resolve_age_key (cyclomatic 16): mise::sops::resolve_age_key has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sops.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"be52629ed456c2ad77900410065e89f1165f7f7d6638f0d2db7c9aa92d2633c4"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::task_cache::copy_excluded_outputs (cyclomatic 16): mise::task::task_cache::copy_excluded_outputs 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":"src/task/task_cache.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb28371f5717013af00f4f8571d621be65b3cb20bae9642752d72569498fb2e"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::task_cache_store::archive_to_cas (cyclomatic 16): mise::task::task_cache_store::archive_to_cas has cyclomatic complexity 16 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 5 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":"src/task/task_cache_store.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"a170a4711c3be644af6fffba678efc4c3ce0e62e3e0ad5fbf25906ee8d5f1dc3"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::task::task_source_checker::get_last_modified (cyclomatic 16): mise::task::task_source_checker::get_last_modified 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":"src/task/task_source_checker.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"2295ee53918cfaef615c557b4d8e3bff53ce356e848467e0f60b0440f5950a1d"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::toolset::keep_uv_python_variants (cyclomatic 16): mise::toolset::keep_uv_python_variants 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":"src/toolset/mod.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cab5606a6c5daaff531f360c130dccc50dfd47a52a747ab066bbb9e29e1513"}},{"ruleId":"D1","level":"warning","message":{"text":"mise::toolset::install_state::scan_versions (cyclomatic 16): mise::toolset::install_state::scan_versions 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":"src/toolset/install_state.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0615a3bb9e99e3cc93bbf0e05d9d59bce671592dbbf96bcc61b4740fc5972a1"}},{"ruleId":"D1","level":"warning","message":{"text":"export.main (cyclomatic 16): export.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/export.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bbaf143147ab9894a5a41a33e551712ca764d49d997bb303ab4f4ad7d406c9"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvResults::resolve_with_toolset (cognitive 231): EnvResults::resolve_with_toolset has cognitive complexity 231 (threshold 15). Drivers by points: if/else 57 (158 pts), loops 11 (31 pts), match/switch 12 (29 pts), boolean chains 13 (nesting depth added 138). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7adf7c81a7e9d8fe95e4d2977f2a6ac493ba623483d6a22c0b219a95875ee53"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::watch::runtime::run (cognitive 220): mise_system::history::watch::runtime::run has cognitive complexity 220 (threshold 15). Drivers by points: if/else 39 (113 pts), match/switch 26 (75 pts), loops 7 (26 pts), boolean chains 6 (nesting depth added 142). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3ab9d2934fa4b282d70281e8d8ad7e9b2ce669ae6e6429693ae4590cbc07c3"}},{"ruleId":"D2","level":"warning","message":{"text":"Lock::get_tools_to_lock (cognitive 197): Lock::get_tools_to_lock has cognitive complexity 197 (threshold 15). Drivers by points: if/else 35 (117 pts), match/switch 8 (34 pts), boolean chains 23, loops 9 (23 pts) (nesting depth added 122). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"becfcac0304deaed2437c551d7dd75e17a43d8986fe692366022945ddaafec35"}},{"ruleId":"D2","level":"warning","message":{"text":"Bootstrap::run_phases (cognitive 178): Bootstrap::run_phases has cognitive complexity 178 (threshold 15). Drivers by points: if/else 109 (154 pts), boolean chains 21, loops 1 (3 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c947c50567296a6ba3e6919c754b449f5313021c43b3e78ea4ad736e424a51a"}},{"ruleId":"D2","level":"warning","message":{"text":"DotfilesAdd::run_inner (cognitive 169): DotfilesAdd::run_inner has cognitive complexity 169 (threshold 15). Drivers by points: if/else 56 (114 pts), boolean chains 26, loops 9 (18 pts), match/switch 3 (11 pts) (nesting depth added 75). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/add.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"252db61db18b42c83456284449a1a4038789e790a96ef4a18e5aa1d955e9c943"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::flight::execute_flight_step (cognitive 163): mise_system_packages::brew::cask::flight::execute_flight_step has cognitive complexity 163 (threshold 15). Drivers by points: if/else 49 (118 pts), loops 12 (30 pts), boolean chains 12, match/switch 2 (3 pts) (nesting depth added 88). 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":"crates/mise-system-packages/src/brew/cask/flight.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"f880f096e44b79a862f1aa1fbbcb383e5dfdd277e155463c812ca68d1cc8c4cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Daemons::run (cognitive 162): Daemons::run has cognitive complexity 162 (threshold 15). Drivers by points: if/else 60 (108 pts), loops 13 (26 pts), boolean chains 16, match/switch 6 (12 pts) (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/daemons.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e21de7b20ff39e5aa11233e8617482d0b53614c6b752bf3bf5a698143d0aad"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskExecutor::run_task_sched (cognitive 160): TaskExecutor::run_task_sched has cognitive complexity 160 (threshold 15). Drivers by points: if/else 55 (125 pts), boolean chains 21, match/switch 3 (9 pts), loops 1 (5 pts) (nesting depth added 80). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8a7d14653af6011008f43307d0b700f7597b7052f7ef4c6776923fad6054ce"}},{"ruleId":"D2","level":"warning","message":{"text":"DotfilesTrack::run (cognitive 150): DotfilesTrack::run has cognitive complexity 150 (threshold 15). Drivers by points: if/else 50 (95 pts), boolean chains 27, loops 12 (25 pts), match/switch 2 (3 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/track.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"194329fa88b46cdd6c7c947a845c329a09206766dc2a3b936677b015989fb684"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::validate_incoming_files (cognitive 137): mise_system::files::validate_incoming_files has cognitive complexity 137 (threshold 15). Drivers by points: if/else 33 (90 pts), boolean chains 27, loops 5 (16 pts), match/switch 1 (4 pts) (nesting depth added 71). 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":"crates/mise-system/src/files.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f3aeb7a576f7d56ab666b43753cf3ef1ab2b7dd4eb5cd6af0d0837e05a86ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::render_item (cognitive 135): Renderer::render_item has cognitive complexity 135 (threshold 15). Drivers by points: if/else 53 (110 pts), match/switch 6 (13 pts), boolean chains 12 (nesting depth added 64). 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":"crates/mise-interactive-config/src/render/item.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8d879551eff7b5adcc5f597528f6a8eb9cbccb7a6ecd784bd051444df5752e"}},{"ruleId":"D2","level":"warning","message":{"text":"Upgrade::upgrade (cognitive 134): Upgrade::upgrade has cognitive complexity 134 (threshold 15). Drivers by points: if/else 50 (87 pts), loops 15 (23 pts), match/switch 6 (17 pts), boolean chains 7 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/upgrade.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bf370dd67895268bd75087877ef92919eedeccb1b5a9481e5d269e3f9cbcfe0"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskExecutor::exec_program (cognitive 133): TaskExecutor::exec_program has cognitive complexity 133 (threshold 15). Drivers by points: if/else 74 (113 pts), boolean chains 18, match/switch 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e4360ddb0f8c3e09493a185f6906a02023b24e66585c44c63d98d0f5e3899c"}},{"ruleId":"D2","level":"warning","message":{"text":"Upgrade::run (cognitive 128): Upgrade::run has cognitive complexity 128 (threshold 15). Drivers by points: if/else 48 (89 pts), boolean chains 27, loops 5 (12 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/upgrade.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"580fd30e8aad141b46c85d58a25383e812730acbb3e7588b6d7b039f058bc4f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::attempt_locked (cognitive 115): Store::attempt_locked has cognitive complexity 115 (threshold 15). Drivers by points: if/else 35 (54 pts), boolean chains 28, loops 9 (21 pts), match/switch 10 (12 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/checkpoint.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"baea24e4994735b3ca8fd15bd8b1f86289d0a119ffb0449b49fa5195a6e0ea30"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvList::deserialize (cognitive 112): EnvList::deserialize has cognitive complexity 112 (threshold 15). Drivers by points: if/else 18 (55 pts), match/switch 11 (36 pts), loops 5 (15 pts), boolean chains 6 (nesting depth added 72). Of this number, 97 points are the body\u0027s own statements and 15 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/env.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73d009dcc185ec16cfee27e591808e1facd5dd8b4546bd86d1c1901bbe240a9"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::replay::plan (cognitive 112): mise_system::history::replay::plan has cognitive complexity 112 (threshold 15). Drivers by points: if/else 19 (73 pts), loops 8 (24 pts), boolean chains 11, match/switch 1 (4 pts) (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f7457bdc3a9bc23030decf9dfdfe46959a41fdffaead57a22bb691a2c35b1c"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::format (cognitive 110): mise::lockfile::format has cognitive complexity 110 (threshold 15). Drivers by points: if/else 11 (64 pts), loops 6 (36 pts), match/switch 1 (8 pts), boolean chains 2 (nesting depth added 90). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":6351}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de21c021835491d9b53f6e44be56318d447e3f9220a4c448ad28761382da95f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::update_lockfiles (cognitive 101): mise::lockfile::update_lockfiles has cognitive complexity 101 (threshold 15). Drivers by points: if/else 24 (61 pts), loops 12 (28 pts), boolean chains 9, match/switch 1 (3 pts) (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9635b4d2e7092d0922b9f0c7451955fe00c3cfc7d099519fe36699a7c6c8d769"}},{"ruleId":"D2","level":"warning","message":{"text":"record.run_session (cognitive 96): record.run_session has cognitive complexity 96 (threshold 15). Drivers by points: if/else 21 (57 pts), ternaries 7 (25 pts), loops 5 (11 pts), boolean chains 3 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/record.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc349a69c3f3f3f01dd84f87d2cdec3e57b7b282c72cab8fe307d9e8015867d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::merge_file_entry (cognitive 94): mise_system::files::merge_file_entry has cognitive complexity 94 (threshold 15). Drivers by points: if/else 37 (51 pts), boolean chains 22, match/switch 14 (20 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed42f154b449221d5e86b2a2b2ae0963d3a8788c0d49ad1328467612fac8520"}},{"ruleId":"D2","level":"warning","message":{"text":"CmdLineRunner::execute_async_with_cancel_check (cognitive 91): CmdLineRunner::execute_async_with_cancel_check has cognitive complexity 91 (threshold 15). Drivers by points: if/else 29 (64 pts), match/switch 6 (13 pts), loops 5 (8 pts), boolean chains 6 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"31be26f086d7575608e3b4f911af765d1cc7c9b6f2aad87f48c9ca0fb3d79a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::download_file_attempt (cognitive 91): Client::download_file_attempt has cognitive complexity 91 (threshold 15). Drivers by points: if/else 31 (75 pts), boolean chains 10, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0296183221ae485d99a632d54eb7d87c43689fd704edea33f149ca3b06943b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::unapply::plan (cognitive 90): mise_system::unapply::plan has cognitive complexity 90 (threshold 15). Drivers by points: if/else 28 (62 pts), match/switch 8 (16 pts), loops 8 (11 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/unapply.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac3ca57e2d815e4bd91024700f3d302b7b248f47b245bfa079cbc935dd24c7f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_daemons::load (cognitive 89): mise_daemons::load has cognitive complexity 89 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 15 (22 pts), boolean chains 9, match/switch 4 (9 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a1c23f1650c058a4f14bf10b127cd504e208af7b15c3410ecd990413ce00c0"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::replay::apply_steps (cognitive 89): mise_system::history::replay::apply_steps has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (69 pts), loops 5 (8 pts), boolean chains 7, match/switch 2 (5 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b18671c8ecec089703651be78e4f3b5a4e36d45d1721027032a6fff91bccf0a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::packslip::fetch_files (cognitive 89): mise::packslip::fetch_files has cognitive complexity 89 (threshold 15). Drivers by points: if/else 24 (73 pts), match/switch 4 (9 pts), boolean chains 6, loops 1 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packslip.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"553a62fde0a5cd4cb8eeb63ebf3cd123b4ef85e45d2100bfc6a582177b35594f"}},{"ruleId":"D2","level":"warning","message":{"text":"BrewManager::install_via_pour (cognitive 85): BrewManager::install_via_pour has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (50 pts), match/switch 5 (17 pts), loops 9 (15 pts), boolean chains 3 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b792850c980b00d2877d83a7d63eef7ebb7d05b8d741f723cb8232dacb298d62"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::auto_lock_new_versions (cognitive 85): mise::lockfile::auto_lock_new_versions has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 10 (23 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":4212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f919554578b799430d9e3ebe450663d189474e26c42230cfcbbe9e498cec20d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::install_version (cognitive 82): Backend::install_version has cognitive complexity 82 (threshold 15). Drivers by points: if/else 43 (55 pts), boolean chains 25, match/switch 2 (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b7036b3aad6663205b24b96731fb14b3e1d2e539a4106d7ca27211df73159c"}},{"ruleId":"D2","level":"warning","message":{"text":"DotfilesStatus::run (cognitive 81): DotfilesStatus::run has cognitive complexity 81 (threshold 15). Drivers by points: if/else 25 (46 pts), match/switch 7 (14 pts), loops 6 (11 pts), boolean chains 10 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/status.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40d4c22ce28f432e37372eac8cc25e7eabced34e8acd9f5b630c916eb084a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveConfig::handle_enter (cognitive 80): InteractiveConfig::handle_enter has cognitive complexity 80 (threshold 15). Drivers by points: if/else 31 (69 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 43). 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":"crates/mise-interactive-config/src/editor/actions/enter.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"182b12daed6ad6e1468f060d07951cc22df33444e12e49f931e92d6529783f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::apply_one (cognitive 80): mise_system::files::apply_one has cognitive complexity 80 (threshold 15). Drivers by points: if/else 29 (58 pts), match/switch 4 (11 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":5931}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ca5a1d800c87163ec177a0a9fa455c47fd96c3391a9c9add2f57ceae9fb874"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens (cognitive 79): mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens has cognitive complexity 79 (threshold 15). Drivers by points: if/else 25 (55 pts), match/switch 5 (13 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/state.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf60b4c61a17a856502ca45ee44977fc82fac23eb065952318972aa344bce34"}},{"ruleId":"D2","level":"warning","message":{"text":"Watch::run (cognitive 79): Watch::run has cognitive complexity 79 (threshold 15). Drivers by points: if/else 28 (53 pts), loops 7 (17 pts), match/switch 2 (8 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":"src/cli/watch.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"716a6eb23cd88c3faebea8677a1112ccca3714580d9474eeb1a394eb8dd5b359"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolVersion::resolve_version (cognitive 79): ToolVersion::resolve_version has cognitive complexity 79 (threshold 15). Drivers by points: if/else 29 (47 pts), boolean chains 22, match/switch 6 (10 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_version.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"217ae64e9067d4922c64c8a30701bf6361ade555f1946efb8b1b0f2c6a4de1ae"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::generate::generate (cognitive 77): mise::lockfile::generate::generate has cognitive complexity 77 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 16 (28 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile/generate.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3131227a9345a11c880c127651a0a8cb6003f783c8c025a77c958665a819fa74"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolStub::generate_stub (cognitive 75): ToolStub::generate_stub has cognitive complexity 75 (threshold 15). Drivers by points: if/else 27 (59 pts), boolean chains 9, loops 3 (7 pts) (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/generate/tool_stub.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d090a375a405e7235428360f365c61283751919f4726fe0c14f6b95f7ac8805"}},{"ruleId":"D2","level":"warning","message":{"text":"BrewCaskManager::install_one_with_ancestors (cognitive 74): BrewCaskManager::install_one_with_ancestors has cognitive complexity 74 (threshold 15). Drivers by points: if/else 29 (44 pts), loops 18 (21 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac34f81d128e3a1b00bed64ff866517445005076e2f5de062e24bd8db6699c8c"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::plan_unapply_one (cognitive 70): mise_system::files::plan_unapply_one has cognitive complexity 70 (threshold 15). Drivers by points: if/else 26 (48 pts), boolean chains 11, loops 3 (10 pts), match/switch 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":5035}}}],"partialFingerprints":{"codehealthFindingId/v1":"121317fd42346cd7ee37aba66cc8a7ff6e39e64708e884d1357a9efd3c0db1ee"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::expand_config_roots_inner_for (cognitive 70): mise::config::expand_config_roots_inner_for has cognitive complexity 70 (threshold 15). Drivers by points: if/else 16 (46 pts), match/switch 5 (18 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 46). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":5952}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd35724551c905b5d1cbf458cb0c13dba158712e821347b567beecfb5e991e4"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::merge_file_and_config_tasks (cognitive 70): mise::config::merge_file_and_config_tasks has cognitive complexity 70 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 8 (19 pts), boolean chains 11 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":6366}}}],"partialFingerprints":{"codehealthFindingId/v1":"88889be90eaa1ef2dbdfa18b331369f1bb615cdeaad8c5a5fc6541e03889d1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::remote_repository::install_at (cognitive 69): mise_system::remote_repository::install_at has cognitive complexity 69 (threshold 15). Drivers by points: if/else 30 (54 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/remote_repository.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42d9516d031dfe4ac92a6818439452517f52458e372c9ce9daea2458e45f2de"}},{"ruleId":"D2","level":"warning","message":{"text":"Run::run (cognitive 68): Run::run has cognitive complexity 68 (threshold 15). Drivers by points: if/else 36 (49 pts), loops 6 (9 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/run.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcde205ad4c6e187bc42f224d00574d001e87670c4588417f6fd9448c66f460d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::package_requests_from_config_files (cognitive 67): mise_system::package_requests_from_config_files has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (43 pts), match/switch 4 (13 pts), boolean chains 10, loops 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/lib.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fa23b40cc5031a38ffdd48e384fe21f9b8f14fee1a3527fe7a463449cd10bd"}},{"ruleId":"D2","level":"warning","message":{"text":"DotfilesUntrack::run (cognitive 67): DotfilesUntrack::run has cognitive complexity 67 (threshold 15). Drivers by points: if/else 22 (56 pts), boolean chains 6, loops 3, match/switch 1 (2 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/untrack.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b4bd6942df29619b9df0b6b305a74238c999fe91a9a827b65de78720c65924"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::build_image_config (cognitive 67): Builder::build_image_config has cognitive complexity 67 (threshold 15). Drivers by points: if/else 26 (45 pts), loops 9 (15 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oci/builder.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa837fcefc0f27bc29d37fee169f1ff4d8bdacd55ee4996cfd43085ad59fc336"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_source_checker::compute_output_hash (cognitive 67): mise::task::task_source_checker::compute_output_hash has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (46 pts), match/switch 3 (10 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 38). Of this number, 57 points are the body\u0027s own statements and 10 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":"src/task/task_source_checker.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd813ff1dcfc6980b27d9031186047283c22370c8e85a693a79229781f6a0d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::resources::plan (cognitive 66): mise_system::resources::plan has cognitive complexity 66 (threshold 15). Drivers by points: loops 24 (39 pts), if/else 14 (26 pts), boolean chains 1 (nesting depth added 27). 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":"crates/mise-system/src/resources.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"13030a96855a133bf08fcd5fbc1442a9004b5e3c2215951fbbd7a2e7970a97e6"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::sops::decrypt (cognitive 66): mise::sops::decrypt has cognitive complexity 66 (threshold 15). Drivers by points: if/else 30 (57 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/sops.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc17ff19f5debec0376ea2f36661814fc75b1ef7a265a57660a2690a509e1f76"}},{"ruleId":"D2","level":"warning","message":{"text":"shape.check (cognitive 66): shape.check has cognitive complexity 66 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 12 (17 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/shape.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb747c4cf56652dcae7b67e43c4aa1ea2301d4e597ab2e3527b0c0afca00cda"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::toolset::get_versions_needed_by_tracked_configs_with_progress (cognitive 64): mise::toolset::get_versions_needed_by_tracked_configs_with_progress has cognitive complexity 64 (threshold 15). Drivers by points: loops 9 (30 pts), if/else 8 (25 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 41). 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":"src/toolset/mod.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"da473e8b0cbf27a7fdc761b4d462af1c40ef6fa49ab22b7ca446b97c9979f874"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_brew_relocation::elf::patch (cognitive 63): mise_brew_relocation::elf::patch has cognitive complexity 63 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 14, loops 7 (12 pts), match/switch 8 (10 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":"crates/mise-brew-relocation/src/elf.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d2c3d9a7dd5433674510eb310954f9c43b78f17c1bfecb3e14544926e4b284"}},{"ruleId":"D2","level":"warning","message":{"text":"Pull::record_resolutions (cognitive 63): Pull::record_resolutions has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (47 pts), boolean chains 9, match/switch 2 (6 pts), loops 1 (nesting depth added 36). 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":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8c4bf8aea319bd27c491bbaa417813d2729e316aaf645c5e3e8311fc24a87e"}},{"ruleId":"D2","level":"warning","message":{"text":"Tool::output_user (cognitive 63): Tool::output_user has cognitive complexity 63 (threshold 15). Drivers by points: if/else 38 (57 pts), loops 1 (3 pts), match/switch 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tool.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec4ef18f2bc723e4790527240e8c69717030917de1e942620c42650b2675c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::get_locked_version (cognitive 63): mise::lockfile::get_locked_version has cognitive complexity 63 (threshold 15). Drivers by points: if/else 18 (38 pts), boolean chains 15, match/switch 5 (10 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":5414}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a3dd1054389754ce44a4eb4f7f1922689222fafa79d157fb9190f7e3ce7d18"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::generate::is_current (cognitive 62): mise::lockfile::generate::is_current has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (47 pts), boolean chains 9, loops 3 (6 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile/generate.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4bdb6f81e973aced2a0dd58ad8c05c381c2c037943a93682f16b2d5a01bc96"}},{"ruleId":"D2","level":"warning","message":{"text":"Run::spawn_sched_job (cognitive 61): Run::spawn_sched_job has cognitive complexity 61 (threshold 15). Drivers by points: if/else 28 (43 pts), boolean chains 12, loops 1 (4 pts), match/switch 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/run.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e32dbf2d8f3073fddcc0198ae1f04cde613b0399f5e76aab5dbbc4f16429dbf"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksAdd::run (cognitive 61): TasksAdd::run has cognitive complexity 61 (threshold 15). Drivers by points: if/else 31 (43 pts), loops 6 (18 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/add.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e1991877e12fdf730f32457bb8ff7b559727e8bf5153833e89bdd7f783507d"}},{"ruleId":"D2","level":"warning","message":{"text":"DepsEngine::run (cognitive 61): DepsEngine::run has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (48 pts), loops 5 (7 pts), boolean chains 5, match/switch 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a2d8978005e440cf96cf21f600ca4a614ad317cdc6485ed20de5916a037a06"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::static_helpers::rename_executable_in_dir (cognitive 61): mise::backend::static_helpers::rename_executable_in_dir has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (54 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/static_helpers.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34782fd4ccfdf3cf3e02571cfeec19a91736f4ed411c57c733f9aec29eb9e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Lockfile::set_platform_info (cognitive 60): Lockfile::set_platform_info has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (54 pts), boolean chains 6 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d5f6941b27bbeab66b7c4c59025fe896f7380dfba530bb74e63b0d808b3043"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryShow::run (cognitive 59): HistoryShow::run has cognitive complexity 59 (threshold 15). Drivers by points: loops 13 (27 pts), if/else 17 (25 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 25). 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":"src/cli/dotfiles/history/show.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5948252aa7333d160569913950038f3b82b39d3facaafa8fadd51df94edef16b"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskScriptParser::register_task_source_files_function (cognitive 59): TaskScriptParser::register_task_source_files_function has cognitive complexity 59 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 3 (11 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_script_parser.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eab9c03c85162e995b8fab68d6deb297a777ea14e50eca6fe195b381df8681"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::discover_monorepo_subdirs (cognitive 59): mise::config::discover_monorepo_subdirs has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (51 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":6112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f02c7dd2ea2345bc990b608667ecc9b090d4318212ce3faf93792477dcf123d"}},{"ruleId":"D2","level":"warning","message":{"text":"CmdLineRunner::execute (cognitive 58): CmdLineRunner::execute has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (33 pts), match/switch 6 (14 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfe3aec715eeadd1d406033a7709ac6053a2f46d686ede601606252321781a9"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::tracked::walk_entry (cognitive 57): mise_system::history::tracked::walk_entry has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 7 (15 pts), boolean chains 6, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"2571efd74eb0a82972c97fc152ca9bdf66f80d878cc6f5c8172bde1074ffe3ab"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::run::sync_locked (cognitive 56): mise_system::history::sync::run::sync_locked has cognitive complexity 56 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 12, loops 4 (9 pts), match/switch 3 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"349227285296a3bfdbf1a79704d3c6069bedab52e709cab5f8d8144ff138e02b"}},{"ruleId":"D2","level":"warning","message":{"text":"DepsEngine::run_with_deps (cognitive 56): DepsEngine::run_with_deps has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 6 (13 pts), match/switch 4 (10 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"7defc249e97340defd73de104272b8cd12da79fe822e588799db98c8a13e6009"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::build (cognitive 56): Builder::build has cognitive complexity 56 (threshold 15). Drivers by points: if/else 30 (44 pts), loops 7 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oci/builder.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa5fd692919bbefb69b5a81de883fddf16dabad907d73736597798c63b6f71a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::system_install::apply_for_owner (cognitive 56): mise::system_install::apply_for_owner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (34 pts), match/switch 7 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 32). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/system_install.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d53b2f9fb8de2b59f4f9578bbd7e8d7baeb20334c8618f7efb26490d09987a1"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::merge_manager_packages (cognitive 55): mise_system::merge_manager_packages has cognitive complexity 55 (threshold 15). Drivers by points: if/else 7 (39 pts), match/switch 3 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/lib.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"4361d789a360cea96eb4887df54cd7c47b2ad422ff225d435fc34170195127b1"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformInfo::try_from (cognitive 55): PlatformInfo::try_from has cognitive complexity 55 (threshold 15). Drivers by points: match/switch 16 (36 pts), if/else 8 (18 pts), boolean chains 1 (nesting depth added 30). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"530295f34ef2c21bedea5bc2d2e2aaa3df637cda46f9e7a4cad190c966d5b487"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::execute_apply (cognitive 54): mise_system::files::execute_apply has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 9 (17 pts), boolean chains 6 (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":"crates/mise-system/src/files.rs"},"region":{"startLine":4396}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ce755c83dfd78bcc98cf61ab1e67206e7330eb5e1fa532cbfe790fa1269867"}},{"ruleId":"D2","level":"warning","message":{"text":"AquaBackend::install_version_ (cognitive 54): AquaBackend::install_version_ has cognitive complexity 54 (threshold 15). Drivers by points: if/else 25 (36 pts), match/switch 4 (12 pts), boolean chains 6 (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":"src/backend/aqua.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc32c4823e544c61f9e80e422bb1e48504d7789f0e4b4db327e4e262cd1d1b0"}},{"ruleId":"D2","level":"warning","message":{"text":"AquaBackend::verify_provenance (cognitive 54): AquaBackend::verify_provenance has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 17, match/switch 2 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":3303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e334e83d9774e4da5054f94537639d80a4ff1e61d53f40bc9c9fced9407a99"}},{"ruleId":"D2","level":"warning","message":{"text":"Set::run (cognitive 54): Set::run has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 4 (11 pts), match/switch 4 (11 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/set.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ed04b6e34c52b9b6901f1c4db86db12e38314a8b861a117863a9c1aaf3845c"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretBroker::grant_values_with (cognitive 54): SecretBroker::grant_values_with has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (33 pts), loops 10 (13 pts), boolean chains 7, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/broker.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"717435d96acc681ba3d37a1fcd3de5c5b4c6a9e54994344bb4758ee780e124eb"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::static_helpers::clean_binary_name (cognitive 54): mise::backend::static_helpers::clean_binary_name has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 7 (12 pts), boolean chains 2, match/switch 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/static_helpers.rs"},"region":{"startLine":1716}}}],"partialFingerprints":{"codehealthFindingId/v1":"73be7fcf6819b6a5ac3e44bf039d6fd330d7b9c1ef392eaaef881652bd61dd34"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryRepo::read_meta_in (cognitive 53): HistoryRepo::read_meta_in has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 7 (12 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ace9c140212bef33f2bf1c89c788c2750ca34b634a4ebbcf74d8fc6e7088a09"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::load_all_tasks_with_context (cognitive 53): Config::load_all_tasks_with_context has cognitive complexity 53 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 9 (20 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"767af6fac1761698d1f8c911f33db47f19d54d3fee760099ec235af78009c128"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::cargo::native_binstall::install (cognitive 53): mise::backend::cargo::native_binstall::install has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (40 pts), loops 7 (13 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c4431bac65fc74c328e64e2fe8b4fed1bc9f898bde3df64208cc538d791eed"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::hook_env::check_exit_early_fast (cognitive 53): mise::hook_env::check_exit_early_fast has cognitive complexity 53 (threshold 15). Drivers by points: if/else 29 (39 pts), boolean chains 10, loops 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hook_env.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b9ae67a0f82ed33f7e81ddd5eb78b70fa469732af00ac38c2511e593ad6d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveConfig::undo (cognitive 52): InteractiveConfig::undo has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (41 pts), boolean chains 9, match/switch 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/actions/undo.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"212e3baa540781fde00bfa261d9944cf01b68223c8a0c5d425267f75c909af88"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::reconcile::reconcile (cognitive 52): mise_system::history::sync::reconcile::reconcile has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 8, match/switch 3 (8 pts), loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/reconcile.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f550b37d18322abd171210964fff642962ca460bcf46cc46eb333909b9912add"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::shim::which_shim (cognitive 52): mise::cli::shim::which_shim has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 9, loops 5 (9 pts), match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/shim.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1b50d0186eefe3a9608e47ed4fb6d8bd1ae1b3bad4c9d8d7b4e7a915934b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::merge_tool_entries (cognitive 52): mise::lockfile::merge_tool_entries has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 5 (13 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":4838}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e3ec15d1f3e6fb95eeee5ae88adc088af966774ce2d14869c5a715d3801499"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_daemons::presets::run_steps (cognitive 51): mise_daemons::presets::run_steps has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 4 (11 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/presets.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d849dcb1a29d3724aee4e288712ad36c6fb33195876742a6cc24b19c84396f15"}},{"ruleId":"D2","level":"warning","message":{"text":"AquaBackend::resolve_lock_info (cognitive 51): AquaBackend::resolve_lock_info has cognitive complexity 51 (threshold 15). Drivers by points: match/switch 11 (21 pts), if/else 14 (18 pts), boolean chains 10, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"457911902647a0d8e9547d1d25f9484cf80a2393baa98dc0dffeca2241ba3be5"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedGitBackend::discover_bin_paths (cognitive 51): UnifiedGitBackend::discover_bin_paths has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 3 (10 pts), boolean chains 2 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":2135}}}],"partialFingerprints":{"codehealthFindingId/v1":"135d6035917fe40e5fcb2d879ccd6e93a213071c8ee5abc16d81afb0515097a6"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskDocs::run (cognitive 51): TaskDocs::run has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (39 pts), loops 4 (12 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/generate/task_docs.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e467e7f8d7b17a91770884170cfdf7a2ca3819f9d7454e02b1a5836153dac4e"}},{"ruleId":"D2","level":"warning","message":{"text":"UvWorkspaceProvider::discover_with_context (cognitive 51): UvWorkspaceProvider::discover_with_context has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (39 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/uv.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7889e8351f2250933c188ecf903285e9d4346bf3bfc7e2e9e1389818fe8b899e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_daemons::build (cognitive 50): mise_daemons::build has cognitive complexity 50 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 7, match/switch 4 (6 pts), loops 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb215efca7a55e9ab1eb105f826c57d34c7ad28e7097bc6ff0333ec70b7554e0"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::packages_from_specs_with_config_files (cognitive 50): mise_system::packages_from_specs_with_config_files has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (39 pts), match/switch 2 (6 pts), boolean chains 3, loops 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/lib.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63f2f2f2f75462b471c2b4aabf64ccb0cc93632b7ca91e59ef77ededa9b7cd0"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::plan_apply_with_active (cognitive 50): mise_system::files::plan_apply_with_active has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 9, match/switch 3 (7 pts), loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"65244b4ffc54bdc4afcd4237f4fc213fe3e6e90ee3203a81067879abc63faecb"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::enrollment::reconcile (cognitive 50): mise_system::history::enrollment::reconcile has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (40 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/enrollment.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b913d47aa365c58cf3a2093f2bce93869c19c4345ac6b01f7e2494ee033fdf93"}},{"ruleId":"D2","level":"warning","message":{"text":"Scheduler::run_loop (cognitive 50): Scheduler::run_loop has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (32 pts), boolean chains 7, loops 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_scheduler.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f778121b20f855d6e28815e24016fb3aaa47e7d91f9700aaf32661c06e172e04"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_lsp::complete::advance (cognitive 49): mise_lsp::complete::advance has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/complete.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a4978173ecbffa9bba1352c583d6f5b85d233f129fc6892f323d2adcf74682"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::edits::apply (cognitive 49): mise_system::edits::apply has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 5 (11 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/edits.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26ada3004be5401beab7b26d7ea391a6abe7c5387004ac9ae043f5637860719"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::apt_sources::apply (cognitive 49): mise_system_packages::apt_sources::apply has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 4 (11 pts), loops 4 (8 pts), boolean chains 6 (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":"crates/mise-system-packages/src/apt_sources.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb917ba9fa53c56dd5b7998bd8edc88b76112d7d6d084534b88c3edeb0177fb"}},{"ruleId":"D2","level":"warning","message":{"text":"PIPXBackend::install_version_ (cognitive 49): PIPXBackend::install_version_ has cognitive complexity 49 (threshold 15). Drivers by points: if/else 26 (41 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/pipx.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fc058b7c5923611d1593f6c9ad750ad9cdb0b011ca18704c63978f7a59712d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::workspace::gradle::tokenize (cognitive 49): mise::task::workspace::gradle::tokenize has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 6 (18 pts), boolean chains 10 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/gradle.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"72aede7e1a41ca1689317a85cda8185d818a3fb8a7fd79ee980a09ebd36adf98"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvResults::file (cognitive 48): EnvResults::file has cognitive complexity 48 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 9 (16 pts), match/switch 3 (9 pts), boolean chains 4 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/file.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daadb15edd931aa2bba40b65117847ee78ecc7b63f014d8cda9f407d6904caf"}},{"ruleId":"D2","level":"warning","message":{"text":"Toolset::install_all_versions_with_progress (cognitive 48): Toolset::install_all_versions_with_progress has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 8, loops 3 (7 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":"src/toolset/toolset_install.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2375d8a30c5011301ae0773d50693de1921e7e84ad12306f35c15876131e4982"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::driver::run_manager (cognitive 47): mise_system::driver::run_manager has cognitive complexity 47 (threshold 15). Drivers by points: if/else 25 (34 pts), boolean chains 8, match/switch 4 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/driver.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f875a5dd666a661c5430460620ef31431edb3994635706f8630017b7e8f3aa3"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::resolve::resolve_closure_pairs (cognitive 47): mise_system_packages::brew::resolve::resolve_closure_pairs has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 8 (17 pts), match/switch 1 (3 pts) (nesting depth added 27). Of this number, 43 points are the body\u0027s own statements and 4 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":"crates/mise-system-packages/src/brew/resolve.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2270b7fa81e3fb9436f764d1158006ca57898c3645ebac1db1ec45945bebf33a"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendsSwitch::switch (cognitive 47): BackendsSwitch::switch has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/backends/switch.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"95351aff2894bffa28ea049340a151c1e47352b87b05a79bb48f315b084e3a77"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::installs::migrate::recover_interrupted (cognitive 47): mise::cli::installs::migrate::recover_interrupted has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/installs/migrate.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"4430c8c23c40e024f48f8e3b0d10a7279118f599978e6266e2121c617dec9173"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::purge::purge (cognitive 46): mise_system::history::purge::purge has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (30 pts), loops 6 (8 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/purge.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ded3ade54ff59431185f047e197f071c4be1a7d7f0b0970e274a67d3fc0f15f"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksGraph::display_explain (cognitive 46): TasksGraph::display_explain has cognitive complexity 46 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 6 (22 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/graph.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3f3377d3db306ba82cae414942dafac64abea4d40fb846ef2ebd1907b02cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.summarize (cognitive 46): scan.summarize has cognitive complexity 46 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 5 (14 pts), ternaries 4 (13 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/scan.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d3563f842dd03d6069a200d99e4b45487775033ce4143411d58e620c10cc95"}},{"ruleId":"D2","level":"warning","message":{"text":"Index::add_file_tasks::walk (cognitive 45): Index::add_file_tasks::walk has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 11, match/switch 1 (4 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"366a6ade63c3015fc20ff9cb08bde0f95a600c5f0a27e17b4349fe5b1221ece1"}},{"ruleId":"D2","level":"warning","message":{"text":"CmdLineRunner::execute_hashes_async_with_drain_timeout (cognitive 45): CmdLineRunner::execute_hashes_async_with_drain_timeout has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (28 pts), match/switch 5 (11 pts), loops 4 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cb3116fa35bac39d9f5af60ded119bc7828fec27650641e7f8cdc3ffddd346"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::load_tasks_includes (cognitive 45): mise::config::load_tasks_includes has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":6923}}}],"partialFingerprints":{"codehealthFindingId/v1":"53c3deb4743186e33fff2be5b87723eb2a47cdd3ca48a413680b906ae404d463"}},{"ruleId":"D2","level":"warning","message":{"text":"Lockfile::prepare_write (cognitive 44): Lockfile::prepare_write has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (30 pts), loops 5 (10 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2709df369605845ca431bc811e2d2ac3789d69590e293da7f6158a63f2ae8cf"}},{"ruleId":"D2","level":"warning","message":{"text":"config-reference.data.describeKey (cognitive 44): config-reference.data.describeKey has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (17 pts), ternaries 9 (14 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 18). Of this number, 40 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/config-reference.data.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb1575d2af889e0836ab19bdd6f9b12beeb3bf3cf89e215b082c6c64d789720"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchexecArgs::watchexec_args (cognitive 43): WatchexecArgs::watchexec_args has cognitive complexity 43 (threshold 15). Drivers by points: if/else 31 (32 pts), loops 10, 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":"src/cli/watch.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"18911d69bd6a51332631edf28fa2c80f09652237decb25b3b461227f5a28ae32"}},{"ruleId":"D2","level":"warning","message":{"text":"Deps::new_with_cycle_limit (cognitive 43): Deps::new_with_cycle_limit has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 12 (18 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/deps.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d0cddf4c87c8ec92c95e1e907bb7b2f9f42c345522ceff4d460e18ff94669f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_source_checker::get_last_modified (cognitive 43): mise::task::task_source_checker::get_last_modified has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 5 (13 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_source_checker.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c93bacadf6560cb2c4c4a3b8a3503baa61e81a288b8b6ca0a8126a40a498bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_brew_relocation::relocate_keg_with_replacements (cognitive 42): mise_brew_relocation::relocate_keg_with_replacements has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 8, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-brew-relocation/src/lib.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad55180a775f83abe65f6725ba16822059e7104306f14e76aaf575be36b6185"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::execute_unapply (cognitive 42): mise_system::files::execute_unapply has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 5 (12 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":"crates/mise-system/src/files.rs"},"region":{"startLine":4921}}}],"partialFingerprints":{"codehealthFindingId/v1":"230778203418bec1c3c9358546616a439d1fcdc5446f938bfd927e3ba0f4fd46"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::post_install::copy_tree (cognitive 42): mise_system_packages::brew::post_install::copy_tree has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (39 pts), boolean chains 2, loops 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/post_install.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d02215a98c3da1d1fe863947c2666a0ad7bba69426da8a6e298426ae21d7264"}},{"ruleId":"D2","level":"warning","message":{"text":"Doctor::check_dotfiles (cognitive 42): Doctor::check_dotfiles has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 5, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/mod.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"0016994b467eecebdabdd679586d0e4c36682026faa8f2d9dda700de66f0ba59"}},{"ruleId":"D2","level":"warning","message":{"text":"Exec::run_with_context (cognitive 42): Exec::run_with_context has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (30 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/exec.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c3b7a509f9a2abcb5206fe172160f2fca636814aca926c3fa6b0071c0136d3"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemStatus::run (cognitive 42): SystemStatus::run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 4 (10 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/status.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72ea97100e4404446d01b4d221f8fcff6658a75d402a9397c4cf8201035029b"}},{"ruleId":"D2","level":"warning","message":{"text":"Toolset::install_with_deps (cognitive 42): Toolset::install_with_deps has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 7 (16 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/toolset_install.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"1883e0becf53bfc7ff8710e17bf9a727d4acc60dd6e634e26e9748deb6393f92"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_list::get_task_lists (cognitive 42): mise::task::task_list::get_task_lists has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_list.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81d56e1017c2e99685e7956034edeb8170e39a477fa39835eea4bdea884e23e"}},{"ruleId":"D2","level":"warning","message":{"text":"bed.verify (cognitive 42): bed.verify has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 8 (15 pts), boolean chains 7, loops 4 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-bed/bed.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58d30841a22974f37ca9ab1a2e5d50cc80b42547c22a87369d2c42c17ee248a"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.compare_dirs (cognitive 42): scan.compare_dirs has cognitive complexity 42 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 5 (11 pts), ternaries 4 (11 pts), boolean chains 5 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/scan.py"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a591ebdefaa84847aebda07d310e8bca8b28285e8fa4f0efbc331bf2af1786"}},{"ruleId":"D2","level":"warning","message":{"text":"aqua_registry::template::lex (cognitive 41): aqua_registry::template::lex has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/aqua-registry/src/template.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae5fd7b19018ad13f3055b73816430ca3c23c9e37a0eb3bd59ca2f76f63b14b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::validate_composed_file_footprints (cognitive 41): mise_system::files::validate_composed_file_footprints has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 7 (12 pts), boolean chains 6 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cbc362ccec7624ab875c143a238ecb305adcf75c61d1e791d385053704e366"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::agecrypt::load_identities (cognitive 41): mise_util::agecrypt::load_identities has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (8 pts), match/switch 3 (7 pts), boolean chains 5 (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":"crates/mise-util/src/agecrypt.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"56de5bd880aed41e2881e4e5286b4826af40b08e9d3aea92f515028c2e52bc0c"}},{"ruleId":"D2","level":"warning","message":{"text":"DotfilesPaths::run (cognitive 41): DotfilesPaths::run has cognitive complexity 41 (threshold 15). Drivers by points: loops 13 (23 pts), if/else 8 (14 pts), match/switch 2 (4 pts) (nesting depth added 18). 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":"src/cli/dotfiles/paths.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb7e0d391ab876b3632074e9526a536dca9703a908a10d803ecf8f2b154f5b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolsetBuilder::warn_overridden_lockfiles (cognitive 41): ToolsetBuilder::warn_overridden_lockfiles has cognitive complexity 41 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 3 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/builder.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7a8567bde9c0ae4613c6f4368c5ca697ed2a792c7644427176cdaa750427fe"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::jq::extract_recursive (cognitive 41): mise::backend::jq::extract_recursive has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (10 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/jq.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf9691061ad1ffcdc7767930d7a599137898d560db41d3d48ca87c3755d7efa"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::managed_files::open_or_create_directory_tree_inner (cognitive 40): mise_system::managed_files::open_or_create_directory_tree_inner has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3139eaa6a64380adb14a59e56c5a36cd780a5289fd040d5b178956bfea324522"}},{"ruleId":"D2","level":"warning","message":{"text":"DotfilesTrack::entry (cognitive 40): DotfilesTrack::entry has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 4 (10 pts), boolean chains 8, match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/track.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"a120927e2d7e706afd35d8da444173706b29e6737645a1e3139e9a6f1b4d0b6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::load_env (cognitive 40): Config::load_env has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 2 (5 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a996b817a0537dcc32f2d59aac1d3b7550c51b50805c9f98d4616149e463336"}},{"ruleId":"D2","level":"warning","message":{"text":"Providers::run (cognitive 40): Providers::run has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 4 (7 pts), boolean chains 6, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daemons/provider_commands.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99ce57d9f0671170949b54e11fd1e1fedb6516d0abdfed2461ffe78d1f7f7d6"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::escape_task_args (cognitive 40): mise::cli::escape_task_args has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (36 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c298d9d0780dd754e21bd667f68cd3f2bf9602ec04491fda5bf806a637194e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::hooks::run_one_hook_with_context (cognitive 40): mise::hooks::run_one_hook_with_context has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fc27b03534eecbed8490eacc09e517e2caacb1f4a10b1a68ecb708a5a7c4ce"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_cache::copy_excluded_outputs (cognitive 40): mise::task::task_cache::copy_excluded_outputs has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 3 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5b830a3c4eae609edd60c66b21ad957eee627b4ee9da2e86aebbdccf915350"}},{"ruleId":"D2","level":"warning","message":{"text":"bed.arrange (cognitive 40): bed.arrange has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (22 pts), ternaries 4 (10 pts), boolean chains 6, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-bed/bed.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61422bf1a65750e3414aa6cec2038071cb0a5802eb56b0b3de5ffdb8385dc5e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::dotfile_groups::group_entry (cognitive 39): mise_system::dotfile_groups::group_entry has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 8, match/switch 3, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/dotfile_groups.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d49abba85eaf8513007693ddf8ce1006c79c9386eac29897048e93d63913497"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::pour::link_keg (cognitive 39): mise_system_packages::brew::pour::link_keg has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 5 (10 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":"crates/mise-system-packages/src/brew/pour.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f562c1fa6463175e011f3dac87aaf8a82abbb15d689fd22cbeb09cb642ae88b"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendArg::full (cognitive 39): BackendArg::full has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (27 pts), match/switch 3 (7 pts), boolean chains 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args/backend_arg.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"65131be63e26e5edc6df1903bdf80ea72ed437a676533e4d39ed878d0f305ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"PackslipBackend::install_payload (cognitive 39): PackslipBackend::install_payload has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (27 pts), loops 3 (5 pts), boolean chains 4, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/packslip.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7ee9119dc26f4e423cb53ae10df722acb7b9df07e4b227c8d12fcb76d71e78"}},{"ruleId":"D2","level":"warning","message":{"text":"HookEnv::build_path_operations (cognitive 39): HookEnv::build_path_operations has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 4, loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/hook_env.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0650e7bf49c8f03425a787e5e87456a0823f38c6e45b626f15a3ff1312e33b"}},{"ruleId":"D2","level":"warning","message":{"text":"Uninstall::run (cognitive 39): Uninstall::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (28 pts), boolean chains 7, loops 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c93c7a7457245f8133bede17ed6b97b35b5b9ff69d82cc5f1a6c761783aac9"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::toolset::helpers::preflight_system_deps_inner (cognitive 39): mise::toolset::helpers::preflight_system_deps_inner has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 8 (10 pts), boolean chains 2, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/helpers.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"8127798e4f47ef445b9107427a00bfc55300fc88f7c7d4386626494cd590e08a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_daemons::presets::expand (cognitive 38): mise_daemons::presets::expand has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (25 pts), loops 8 (11 pts), match/switch 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":"crates/mise-daemons/src/presets.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b317dbee7b994d54451c2fe78bea00722f39fb323e8d5c1f07cd3cddfa2ecb13"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackedSet::add_requests (cognitive 38): TrackedSet::add_requests has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 3 (9 pts), boolean chains 6, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"c994e73b8b28ef94e3de43553b81d8f42359b9d944021b65a0862a28f98e6e95"}},{"ruleId":"D2","level":"warning","message":{"text":"MiseToml::replace_versions (cognitive 38): MiseToml::replace_versions has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 5 (11 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mise_toml.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4646f4ddb60cb8e932e7924cc636b0143f92099587ffd475f68ce9c9025151"}},{"ruleId":"D2","level":"warning","message":{"text":"DepsEngine::check_freshness (cognitive 38): DepsEngine::check_freshness has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 5 (8 pts), boolean chains 6, match/switch 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdca38eb647ca6873f1ad4c29d80539f7f684c5c39cf2559886b56c1c264c75"}},{"ruleId":"D2","level":"warning","message":{"text":"Task::merge_template_with (cognitive 38): Task::merge_template_with has cognitive complexity 38 (threshold 15). Drivers by points: if/else 24 (25 pts), boolean chains 12, 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":"src/task/task_template.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8415f907c3c2061cd529ef141493758008cf935bfb657be680023a61a67bb99"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_cache::resolve_output_roots (cognitive 38): mise::task::task_cache::resolve_output_roots has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (11 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"98342fda335548ddcb3029c6575382eb7a4215841ea965ab76eebd502dd5a2d8"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_brew_relocation::macho::patch_slice (cognitive 37): mise_brew_relocation::macho::patch_slice has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-brew-relocation/src/macho.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e18b351901b7b04038c6d0c762b0cd814ec91d6ec33b33d21e56e1b5a23721"}},{"ruleId":"D2","level":"warning","message":{"text":"Runtime::prepare (cognitive 37): Runtime::prepare has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 12, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/runtime.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"d305a69de8d43264b448a9ae03429dac0b8932d0ca1205da2708b55236409b3e"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountAction::apply (cognitive 37): AccountAction::apply has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 2, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/accounts.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4170a1f067645f8a808f7398e4c7132d685b7ebf5dc519ecdab5e942b9441e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::files_from_config_files_with_tracking_roots (cognitive 37): mise_system::files::files_from_config_files_with_tracking_roots has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6587a64a78b28d41d1138412d004b33bbf1753972f7b3c2760382a61649178db"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::apply::apply_locked_with_scope (cognitive 37): mise_system::history::sync::apply::apply_locked_with_scope has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 9, loops 1 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"61020eb90eee6363922983ce2adc24365a71971b858e9d65c96a2d2145b41430"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::run::apply_resolutions (cognitive 37): mise_system::history::sync::run::apply_resolutions has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (7 pts), boolean chains 5, loops 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":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"476247cd430d12a754f4ab59a4eb6fe2f7990c27d3ccc8d7889377e9df7c8db6"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::send_once_inner (cognitive 37): Client::send_once_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 8, match/switch 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c252cea2896db145f2713f478ceb0c1352b85e7c7297290472bfcd3413a879d4"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::jq::extract_auto (cognitive 37): mise::backend::jq::extract_auto has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 3 (8 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":"src/backend/jq.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ae9f6d5b76512d44826bc1afab02ae8030214a8138492805fd7587cc912003"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::load_local_tasks_with_context (cognitive 37): mise::config::load_local_tasks_with_context has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (10 pts), boolean chains 5, match/switch 1 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":5727}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1157707ef145766023ecd7b271a64003630cd89de4fcbd0fbc602946647c10"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::daemons::tasks::start (cognitive 37): mise::daemons::tasks::start has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 7 (11 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daemons/tasks.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe24fe7ad403d4d85a808a873a14b451e99241c325444be069763bc2fb6901a5"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::workspace::gradle::parse_settings (cognitive 37): mise::task::workspace::gradle::parse_settings has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 4, loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/gradle.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf673258f943297612e0d14e12f432fc1309026accaf4020a52f0a4123fe8885"}},{"ruleId":"D2","level":"warning","message":{"text":"record.main (cognitive 37): record.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 5 (10 pts), boolean chains 3, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/record.py"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"f396257a5cc37e87402a9095d401959679b8ead6897d1773654c9a261ddc3efc"}},{"ruleId":"D2","level":"warning","message":{"text":"aqua_registry::types::merge::apply_override (cognitive 36): aqua_registry::types::merge::apply_override has cognitive complexity 36 (threshold 15). Drivers by points: if/else 26, match/switch 5 (10 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/aqua-registry/src/types/merge.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d6c0ee6f6724a10fb5f5d0f23d0640c1ad244c016c214e7f95315fdc5bf2bb"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::shell_activation_from_config_files (cognitive 36): mise_system::shell_activation_from_config_files has cognitive complexity 36 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 7 (11 pts), match/switch 2 (8 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":"crates/mise-system/src/lib.rs"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed3d8120d4561dadc63d15aaa1d1a9fcc10ade21ef3f926ee085c2fa6776bf7"}},{"ruleId":"D2","level":"warning","message":{"text":"CondaBackend::create_bin_launcher_dir (cognitive 36): CondaBackend::create_bin_launcher_dir has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/conda.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c57bc1fbc65ed33fd0134925d0563220313301d939f003b8f68c102238df370"}},{"ruleId":"D2","level":"warning","message":{"text":"DepsEngine::new_monorepo_with_fallback (cognitive 36): DepsEngine::new_monorepo_with_fallback has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e92e36ead598c7a847a6d2611acfa474d505559202a93682cf3826e4ebcf668"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonPlugin::install_precompiled (cognitive 36): PythonPlugin::install_precompiled has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (2 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":"src/plugins/core/python.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc3d7d19529ba0c3008d21f95c231364fe9e8afdb3d1d52afa29f83d5b975e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Promotion::snapshot (cognitive 35): Promotion::snapshot has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (11 pts), boolean chains 1, match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/checkpoint/preimages.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a5764409c6e68b7a643aee23c5fe3867bb1df2211ba0ad22fb9dccb0f22fab"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryRepo::decrypted_diff (cognitive 35): HistoryRepo::decrypted_diff has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 3 (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":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd454108a29fffafa6b2af40cf4b2acf3717965601582bf37c00b419c47fc9a0"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::enrollment::resolve (cognitive 35): mise_system::history::enrollment::resolve has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 4, loops 4, match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/enrollment.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9977b180ae715b3bce41b9b3e906c612efe68adf62e87b1d21e9d2ec2feb1f9"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::managed_files::apply_with_accounts (cognitive 35): mise_system::managed_files::apply_with_accounts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 5 (7 pts), boolean chains 6 (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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecd13e3a387d0113fd37adbec68b89a2b027e15011e6f77ec856dc1d64a761b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedGitBackend::verify_attestations_or_slsa (cognitive 35): UnifiedGitBackend::verify_attestations_or_slsa has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 10, match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":2858}}}],"partialFingerprints":{"codehealthFindingId/v1":"598900756a47cab2cb77cee7278c43e5c7a6400e3129079974040e5d91c695be"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigSet::run (cognitive 35): ConfigSet::run has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 9 (13 pts), if/else 10 (12 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/config/set.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d1afa63a1ac1cd54d437e8238a31a0da8a00e97f3a6a56fb7f173a638705e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Unuse::run (cognitive 35): Unuse::run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 2 (4 pts), boolean chains 3, loops 3 (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":"src/cli/unuse.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc441cbd4fda6e8c0990fdc63a5cf87150c58cba04b0db3f1ebbdb06ae7f8dd"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvResults::source (cognitive 35): EnvResults::source has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 3 (9 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/source.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6049201d45b222cbd19e103dd229312ced8897c52101dc529c87616604d06493"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::load_task_sources_from_configs (cognitive 35): mise::config::load_task_sources_from_configs has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 5 (9 pts), boolean chains 4, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":7738}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f7d75594f8adafcfe0db31eee9ed713a0801883afd4a151910a83e3ab3a56f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::task_tool_requests (cognitive 35): mise::config::task_tool_requests has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 5 (10 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":8261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4c137f8d41c47668a36d7194a2be1e3891d208bbb43fe4ca8db7b650245ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::install_layout::resolver::locate (cognitive 35): mise::install_layout::resolver::locate has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 2 (5 pts), boolean chains 4, match/switch 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":"src/install_layout/resolver.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d20a5605fb012e37bad17156c7030e54429ac1b0d51f600eba979f52e0195ee"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.compare (cognitive 35): scan.compare has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 5 (13 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/scan.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"782c4c858ab1f837d023feccb00d82ca520856e84e1bde9b67f1a3417d7c0c31"}},{"ruleId":"D2","level":"warning","message":{"text":"versions.main (cognitive 35): versions.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (25 pts), loops 4 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/versions.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8015bd6eded1b263b0c00baeb8aebee709ccbfad7fefcf4a77d35da080f1b05f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::remote::run_staged (cognitive 34): mise_system::remote::run_staged has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (27 pts), boolean chains 3, loops 2, match/switch 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/remote.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2b6fcc5d561eef4d08bb07c4cdd8fe0ff6f273998070563947be74c58a0397"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapMacosDefaultsStatus::run (cognitive 34): BootstrapMacosDefaultsStatus::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (9 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":5962}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b4fe967da6b36ec85aacca779ba5cf6c38a3c3e27319b987253b02f98c59fb"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapLaunchdStatus::run (cognitive 34): BootstrapLaunchdStatus::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 3 (9 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":5714}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad24b141247aec4e42a7b8029a9c5fd5b14df719ef1bd8b0e9124efad4db209"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapSystemdStatus::run (cognitive 34): BootstrapSystemdStatus::run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":5835}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17a7343ef2af327ba9934a9c084e695c8a93f07bb604fb47fc5b03eeaf58d4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Cli::run_inner (cognitive 34): Cli::run_inner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a932fdbe2613e6d4dfbf81ef3a9e52a3025bb1aaec1a0521f1ff3b2409e3d02"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::env::environment (cognitive 34): mise::env::environment has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/env.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"999979ec9f5d4c406c38d3ca33ae7c3690725b83d1f9ad070f92c94e653403c3"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::runtime_symlinks::list_symlinks_for_dir (cognitive 34): mise::runtime_symlinks::list_symlinks_for_dir has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/runtime_symlinks.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6bd530e9725fd4229efa733fbd73bc4db972d9e9ab3504aa20681bb5d327b3"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::secrets::grant::scan_get_env_name (cognitive 34): mise::secrets::grant::scan_get_env_name has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (13 pts), boolean chains 3 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/grant.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d4849fcbc6c320dee16eac87340e4f224e0e2be01db051dc03eb3715e26336"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::deps::find_cycles (cognitive 34): mise::task::deps::find_cycles has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/deps.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e28a85348e584761d2ca8f5215fc3b0fc88e37dbcd6102e5bd5d0473b7c558c"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_cache_store::materialize_remote_tree (cognitive 34): mise::task::task_cache_store::materialize_remote_tree has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 6 (9 pts), match/switch 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache_store.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"9488cf7c25df8885742ff3efca6149119b66a530614c1fad8768f8e60acfb649"}},{"ruleId":"D2","level":"warning","message":{"text":"shape.main (cognitive 34): shape.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (11 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/shape.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"cece5b7d84c2eaf1c4d677b369e8f3936d48ab613bf5ffba48256c40fcd2475e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_unquoted (cognitive 33): Parser::parse_unquoted has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-dotenv/src/parse.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"54308e7f954823e2aeca3202bdff81b83769e81369b8ff60b39431ddd0f482cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Cursor::build_visible_items (cognitive 33): Cursor::build_visible_items has cognitive complexity 33 (threshold 15). Drivers by points: loops 6 (22 pts), if/else 2 (6 pts), match/switch 1 (5 pts) (nesting depth added 24). 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":"crates/mise-interactive-config/src/cursor.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"233d6b7f138b55d5fb4fb9c684ffd2f67f341616efb0ff37de5d4a632b519bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::scheduled_tasks::apply (cognitive 33): mise_system::scheduled_tasks::apply has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/scheduled_tasks.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3583430c3ab1b9aa99a5b913afeeb5767f32c88dffef3ef5ffbe664c5e3866e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::tera::tera_exec (cognitive 33): mise_util::tera::tera_exec has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 4 (7 pts), loops 1 (3 pts), boolean chains 2 (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":"crates/mise-util/src/tera.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc66daaa0d2ac98b4d7349f1af7a44396cb0b285d0a7809d4be6f6c7520bfb1"}},{"ruleId":"D2","level":"warning","message":{"text":"Vfox::verify (cognitive 33): Vfox::verify has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (30 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":"crates/vfox/src/vfox/install.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2915946d4f83ee219632782c3c70ff8e21fcc43f6ca7fdc450d50d5e6a038dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Project::run (cognitive 33): Project::run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, match/switch 3 (5 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/project.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3842d6b299871c51f48ebafbc6c1747471d757b48f6d680abef72daa172cf31"}},{"ruleId":"D2","level":"warning","message":{"text":"Lock::process_tools (cognitive 33): Lock::process_tools has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 6 (9 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":2885}}}],"partialFingerprints":{"codehealthFindingId/v1":"532bb7c734f02d8b2435121c2caa4c13b7f990269798c297d572778f30049f08"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskExecutor::exec_task_run_entries (cognitive 33): TaskExecutor::exec_task_run_entries has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c079864aa81ea8144618640c110ac8901e23e934ddc3c45c8e9341ffa4a490"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoWorkspaceProvider::discover_with_context (cognitive 33): CargoWorkspaceProvider::discover_with_context has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/cargo.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"833ce7425fb2b1eb3a6042d2931e26bd430fc7594765001c02570d896e8cde8b"}},{"ruleId":"D2","level":"warning","message":{"text":"Toolset::sort_by_overrides (cognitive 33): Toolset::sort_by_overrides has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 9 (13 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/mod.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f912eaacc1baf4d61cd1dc3b2008259162bf6ca42aa6be117a4d00daf015a1"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::version_list::parse_version_list (cognitive 33): mise::backend::version_list::parse_version_list has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/version_list.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf82ed4f712e94db7e7e334088f71a7e1ffba31ee3a108d05044744af3134cf"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::bootstrap::config_files_after_dotfiles_dry_run (cognitive 33): mise::cli::bootstrap::config_files_after_dotfiles_dry_run has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 6 (15 pts), loops 2, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"031c6703414688d68aa171159b47c855b5bf3d333dbfc4e0c43324ac1e654d44"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::shims::sync_command_wrapper_shims (cognitive 33): mise::shims::sync_command_wrapper_shims has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 5 (7 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":"src/shims.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2250f0d1f44219d8a90cfd41e50c99d46e71afee9de06a6d2a95bca508fc4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::tool_purgatory::auto_prune (cognitive 33): mise::tool_purgatory::auto_prune has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 5 (12 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_purgatory.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2766252a7cf8feb457acb1c7dcf917c98c0ee40ca1bbb5156f0a9afc801f6928"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::cache::prune_dir (cognitive 32): mise_util::cache::prune_dir has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 6, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/cache.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"f490b8f6b688bf849add0648befd628ad8f8df9b9e43aa83df66cf65376a5d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Bootstrap::run_from (cognitive 32): Bootstrap::run_from has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 4, 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":"src/cli/bootstrap.rs"},"region":{"startLine":2520}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b4cc7e59a6f3526d121e35229eb74600249660b19e03fbc5bc49e96c32e1c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Upgrade::warn_if_newer_versions_hidden_by_minimum_release_age (cognitive 32): Upgrade::warn_if_newer_versions_hidden_by_minimum_release_age has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/upgrade.rs"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"65da2dad3da6707fd66d1c4b2a5d158940e648eed86fbc5d15354b7cb1305403"}},{"ruleId":"D2","level":"warning","message":{"text":"PlatformInfo::merge_with (cognitive 32): PlatformInfo::merge_with has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22, boolean chains 5, match/switch 2 (5 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81f8b11b9df217d2c2a99692d22f09226429735d981016126064f731f6e46ec"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskExecutor::inject_and_wait (cognitive 32): TaskExecutor::inject_and_wait has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 6 (10 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fd8ea851d09dc38141e9c7360f8f645cd405d01903c0f8318220544665da38"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::untrusted_task_reached (cognitive 32): mise::config::untrusted_task_reached has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 5 (12 pts), match/switch 1 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":5370}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd582e9637a611aeb825a6a4f01d9b6013364d24413654b0ee5bf3ece89a440e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::packslip::sync_skills (cognitive 32): mise::packslip::sync_skills has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 8, loops 3 (4 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":"src/packslip.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79a0fd04c6505696a5d857a7a8c0c2f82c5d7f984a144f3841245b1ca962312"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::resolve_task_pattern (cognitive 32): mise::task::resolve_task_pattern has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 8 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":3360}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2b80f3284658fe0d593ef7f25f421863d9c6cb410a5c8cd87ca0c2e329d952"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_source_checker::expand_glob_braces::find_group (cognitive 32): mise::task::task_source_checker::expand_glob_braces::find_group has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 2 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (mise::task::task_source_checker::expand_glob_braces::expand) 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":"src/task/task_source_checker.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf94244bccff2882a0ea7c7bb4a2362c8adfdacbc3f079cd865a16b8c35af9a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_source_checker::save_checksum (cognitive 32): mise::task::task_source_checker::save_checksum has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_source_checker.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e750933f3565a56cebda4e071da6290cf7fffbb54d571c56246c08e31b1f53"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_oci::layer::collect_sorted_entries (cognitive 31): mise_oci::layer::collect_sorted_entries has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-oci/src/layer.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96aabfed8953fbc07f7e133f1a81fa002406b546d24ee5c8fff558d83fda63b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::print_diff (cognitive 31): mise_system::files::print_diff has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 4 (7 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":5474}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac01fc45dc5d507862f7db590198275110057eea238531f7a441f2c448be7a9"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::replay::rollback (cognitive 31): mise_system::history::replay::rollback has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (6 pts), match/switch 2 (4 pts), boolean chains 3 (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":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9306254c1b13cf29d92b92a4faf0347cb88d8c26c7b296fceb7c2da975606b7"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::origin::set_inner (cognitive 31): mise_system::history::sync::origin::set_inner has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5 (8 pts), boolean chains 5, 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":"crates/mise-system/src/history/sync/origin.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c472a9f1d7e5a4364e67c091ccbd10570115b7d4b30271c7d2e73f11615a2c9"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::preflight::prospective (cognitive 31): mise_system::history::sync::preflight::prospective has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 4 (8 pts), boolean chains 4, loops 3 (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":"crates/mise-system/src/history/sync/preflight.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcdf61f34bbcd146935232b1d7a223b07915cb8a97b2997cd39b28e063ad9c4"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::run::prepare (cognitive 31): mise_system::history::sync::run::prepare has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, loops 3 (5 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"7512c890b0b3c7e5fb5b610b723b72ecad63e97f960e8eda943bfcea3d133242"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedGitBackend::verify_provenance_at_lock_time (cognitive 31): UnifiedGitBackend::verify_provenance_at_lock_time has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 3 (11 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a566ab1b3a5c948993734d38e37028517f901e54442d3bd3417cb83954d5d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Project::check (cognitive 31): Project::check has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 3 (6 pts), loops 3 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/project.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b31dd91257fb97402dc2ecc71274f208364cd288021fff7b5c4639c7b339e6"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolStub::fetch_checksums (cognitive 31): ToolStub::fetch_checksums has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 1 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/generate/tool_stub.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fcfc6ca1abd13c70db5cc3fbc848490666fb85c441b7ae691d6d2fc86e574a"}},{"ruleId":"D2","level":"warning","message":{"text":"Lock::add_task_tools_to_lock (cognitive 31): Lock::add_task_tools_to_lock has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 1 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f43c9033853606033cf076f56f8588d66fd4999dc3bfb9d19345009e58f577"}},{"ruleId":"D2","level":"warning","message":{"text":"Use::run (cognitive 31): Use::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, loops 3 (4 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/use.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"645db8a1530f9ea411cec5dd549e2291200c89ed882347a428ef3f1dafb4d81c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lockfile::read (cognitive 31): Lockfile::read has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 5 (9 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb84606600766dd9f6198fcd6c035a1c21606feba96ce4859d534650a09a084f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::static_helpers::install_artifact (cognitive 31): mise::backend::static_helpers::install_artifact has cognitive complexity 31 (threshold 15). Drivers by points: if/else 21 (29 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":"src/backend/static_helpers.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"d854d5c263d478ecfc9916354400abbac876c158e7e735ca4da8f6b63624675e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::edits::print_diffs (cognitive 30): mise_system::edits::print_diffs has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/edits.rs"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f796105271fbeecac0fe222564ee00e4ee822678981b8127c2d651e9406b24"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::github::sigstore::verify_with_mirror (cognitive 30): mise_util::github::sigstore::verify_with_mirror has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/github/sigstore.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3162171bbd89cb3c8af99b73cf1796a91ddee8027acc1aed7e930b403fe3d8"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::github_relay::unix::forward (cognitive 30): mise_util::github_relay::unix::forward has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 4 (5 pts), boolean chains 2, 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":"crates/mise-util/src/github_relay.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b201234bbea1684a31c962af0d001e257312f456336206807ae7e011cbcf1fd"}},{"ruleId":"D2","level":"warning","message":{"text":"RubyPlugin::fetch_ruby_release_dates (cognitive 30): RubyPlugin::fetch_ruby_release_dates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (12 pts), match/switch 4 (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":"src/plugins/core/ruby.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5a244e7932ef1d2e889059ebfe7b28ace16fdac165d38a3462190831dfe90f"}},{"ruleId":"D2","level":"warning","message":{"text":"GradleWorkspaceProvider::discover_with_context (cognitive 30): GradleWorkspaceProvider::discover_with_context has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 6 (9 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/gradle.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6f98acfa8b4dba2feffe533c64cbee7942ecca063a40ddabccf74c5d0a8d20"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::static_helpers::list_available_platforms_with_key (cognitive 30): mise::backend::static_helpers::list_available_platforms_with_key has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/static_helpers.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd6490c8ca9325d61352876811b078981f757f13fcdade820b092eaedbf2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::exec::exec_program (cognitive 30): mise::cli::exec::exec_program has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 6 (9 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/exec.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"13858b83e5c48c3f7099713523d3b83f23f0d5622762d531f6270e0fceedc68c"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::secrets::template::scan_tag (cognitive 30): mise::secrets::template::scan_tag has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (11 pts), boolean chains 6 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/template.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c729d85e9f4144b4c8eb30450cfb163c139e84700a8ad7ce53e2928de30b58"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::toolset::install_state::scan_versions (cognitive 30): mise::toolset::install_state::scan_versions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/install_state.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa699e92a3dbaf5db1cf44296380aa0b0a6f018626921972ba1b59f601b2e63"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_brew_metadata::cask::artifacts::cask_artifacts (cognitive 29): mise_brew_metadata::cask::artifacts::cask_artifacts has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (27 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":"crates/mise-brew-metadata/src/cask/artifacts.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4ed2247425ee64d89d29b9ca1b8d88788dd45f08ce8dd074533b7cea08852b"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskDep::parse_shell_style_env (cognitive 29): TaskDep::parse_shell_style_env has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/task/dep.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a047440234c15ed09c8360ab90ac641019e4bf299ccd5d280465dd821092762b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_daemons::presets::resolve_options (cognitive 29): mise_daemons::presets::resolve_options has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (8 pts), boolean chains 2, match/switch 1 (2 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":"crates/mise-daemons/src/presets.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d53964b2d7f3f8555b89c8cbd35f321a151c5566f23771c70666cb35146c717"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_lsp::tasks::cycles (cognitive 29): mise_lsp::tasks::cycles has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (10 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf220b8f190547c4931519640626392ca0f409735eeb5ee0c3fd16cc50a366a5"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryRepo::capture_tracked_files (cognitive 29): HistoryRepo::capture_tracked_files has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a18aac8ac7e318f7bef952edb7e62e9b5ece7abe07320ab42e2326417b3701d"}},{"ruleId":"D2","level":"warning","message":{"text":"MiseToml::remove_alias (cognitive 29): MiseToml::remove_alias has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 2, boolean chains 1 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mise_toml.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"5672a592d8627c6721d02039083cbf0797957476c348fb4ccc2a9cabc8fdd341"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvResults::validate_required_vars (cognitive 29): EnvResults::validate_required_vars has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/mod.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23fecf0e86747810aadf09a0a8f1def8e3340285ef81b99a6fa9f929f04c086"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskCacheAudit::report (cognitive 29): TaskCacheAudit::report has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (4 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache_audit.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd6d8c02a2827695c28e8621c28dd0b0bf0fac4ee76caf2968aa31fea5bcfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskFetcher::fetch_tasks (cognitive 29): TaskFetcher::fetch_tasks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 4, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_fetcher.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51ad5f4df664b5b709bda90bb5b03655a6c7ac0f7ffa94f9c5930c10212398a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::bootstrap_dry_run_vars (cognitive 29): mise::config::bootstrap_dry_run_vars has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 3 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":4564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33f013e0cfd87bb1b72384c438beb9d32b2b91717182ceb6d0642c7ff7f83f1"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::install_layout::snapshots::observe_config (cognitive 29): mise::install_layout::snapshots::observe_config has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (7 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/install_layout/snapshots.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d794ec7992c90ac8836f4d89ddb3984843de7905646cc258b2a41a77ef8edd"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::generate::populate_uv_locks (cognitive 29): mise::lockfile::generate::populate_uv_locks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (2 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":"src/lockfile/generate.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"e862be88ce9691acec0f9a29be2e817935e4406eb58f5903a74ccf17508279cd"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_oci::layer::build_layer_from_sources (cognitive 28): mise_oci::layer::build_layer_from_sources has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-oci/src/layer.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c75c53d3abdd210251703edb60fa2d3456ee08a5c593773fdb666d2a44cb56"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::services::apply_with_notifications (cognitive 28): mise_system::services::apply_with_notifications has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (10 pts), boolean chains 3 (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":"crates/mise-system/src/services.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"778aaf1240424fd7b78e9627dc94125cc5d0b7e3c82e72b53ddc3a6ad6a659eb"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::github::resolve_token_inner (cognitive 28): mise_util::github::resolve_token_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/github.rs"},"region":{"startLine":2107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93256f28263766bb26cf80dc4c7d6bdd227acd26b15705df99b17722d1cb08b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::http::apply_url_replacements (cognitive 28): mise_util::http::apply_url_replacements has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":3403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8dafe1f116f64913ae962612648931cd36358cb9556d5a483f47392133a9ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"PIPXBackend::prepare_install_version (cognitive 28): PIPXBackend::prepare_install_version has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, 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":"src/backend/pipx.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1fbc0e0e90ab8c5fd94de9fbf4b3823cf3a1864f2a32fccf13b0131c2928f0"}},{"ruleId":"D2","level":"warning","message":{"text":"UbiBackend::_list_remote_versions (cognitive 28): UbiBackend::_list_remote_versions has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/ubi.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c365aca36b271007b7a829978a591e26f9b679b333ba2445f546d31ffbe693d"}},{"ruleId":"D2","level":"warning","message":{"text":"CacheClear::run (cognitive 28): CacheClear::run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (10 pts), match/switch 2 (3 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":"src/cli/cache/clear.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"760927a82716a1ffba487628da4cfddf2bf365c47b0774dcd043db12d29af23a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::workspace::go::missing_path_resolves_outside (cognitive 28): mise::task::workspace::go::missing_path_resolves_outside has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/go.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bf7313a6554222bfd76b942c0bf7c8d378f1c03a1daf8168552591c4754d49"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::render (cognitive 27): Renderer::render has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 3 (6 pts), loops 2 (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":"crates/mise-interactive-config/src/render.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"576ebd7fe08431a176f20df889e3d6527dbc59009529651712f7cc0d67030aa4"}},{"ruleId":"D2","level":"warning","message":{"text":"Manifest::validate (cognitive 27): Manifest::validate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/manifest.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc3c5d47bc56fc889658a9b56cb603bca70a7413225d7385d4f6f082b0d8af2"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::state::validate_cask_prune_candidate (cognitive 27): mise_system_packages::brew::cask::state::validate_cask_prune_candidate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, loops 5 (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":"crates/mise-system-packages/src/brew/cask/state.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bfb657ae6e535fc6e4111f035170309b1fdec566b6ede05b3157995d856c3d1"}},{"ruleId":"D2","level":"warning","message":{"text":"CargoBackend::install_crate (cognitive 27): CargoBackend::install_crate has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 2 (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":"src/backend/cargo.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"37068a468c02acd3157be91c73479886ad48cec26386f11ae2d33764ee3d8ecb"}},{"ruleId":"D2","level":"warning","message":{"text":"PIPXBackend::validate_uv_lock (cognitive 27): PIPXBackend::validate_uv_lock has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/pipx/lock.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a166cd3de732efc3260c9f6e7cfbe8492418ab0a6ad9a50bbcbdc4a57b7782"}},{"ruleId":"D2","level":"warning","message":{"text":"PIPXBackend::is_install_satisfied (cognitive 27): PIPXBackend::is_install_satisfied has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 6 (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":"src/backend/pipx.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"48645d2fb9cede5cddf3d6c2c30711f0d14887876b61fa6ed7456993d1186021"}},{"ruleId":"D2","level":"warning","message":{"text":"S3Backend::fetch_versions_from_listing (cognitive 27): S3Backend::fetch_versions_from_listing has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/s3.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31ca38f280a74c940797f82ab46d838bf1484ccebdf9cc6c307094e5a9a7c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"HookEnv::run (cognitive 27): HookEnv::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 4 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/hook_env.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae75ff9a73fc3aaee6955f6bb71d40dd23b82e3fe2f68e323debba58f3a81eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Install::install_runtimes (cognitive 27): Install::install_runtimes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 4, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/install.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d21ed56954c95b102afafe8520805a71ecb1a94235c3ffbfad7ad52c21cba00"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings::set_hidden_configs (cognitive 27): Settings::set_hidden_configs has cognitive complexity 27 (threshold 15). Drivers by points: if/else 23 (25 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/settings.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed7cbe5066e98b4df2bbee8ec0929e868a88ad593df5e7f44614717aa85df3b"}},{"ruleId":"D2","level":"warning","message":{"text":"Ssh::run_inner (cognitive 27): Ssh::run_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ssh.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"757c8d2d12dec40c269f30fc2d89f43b10fe54ec222cd2f5f88e31359ff74c22"}},{"ruleId":"D2","level":"warning","message":{"text":"MiseToml::build_tool_request_set (cognitive 27): MiseToml::build_tool_request_set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (9 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mise_toml.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe636695831386ed1f2af33b6b589d6644bb3602069a8c2a94d979d4228eb74"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::http::header_map (cognitive 27): mise::backend::http::header_map has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/http.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f217c72cd0402700b52cc48ef240bbaf2ecb4cb40138c8c37b4b2214e40321"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::npm::virtual_store_entry_links_dependencies (cognitive 27): mise::backend::npm::virtual_store_entry_links_dependencies has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/npm.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"8990fd803604332baaf3b74cdf53bfc749b0bfdd55b9f7ca0eebec7749b53326"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::settings::set::set (cognitive 27): mise::cli::settings::set::set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (15 pts), match/switch 4 (7 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/settings/set.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"711a1b383a8f1d9203c6a8ce8aad484b62ca45d177249284dcbaff8aeaa86558"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::load_aliases (cognitive 27): mise::config::load_aliases has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), boolean chains 4 (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":"src/config/mod.rs"},"region":{"startLine":4322}}}],"partialFingerprints":{"codehealthFindingId/v1":"807fbc1b362edb5a3aca5f9b19847f48db4cb81da04566cd5b25bbfb8890c8f1"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::generate::populate_aube_locks (cognitive 27): mise::lockfile::generate::populate_aube_locks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (7 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":"src/lockfile/generate.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee88615951e34ab4378a85e41fe1a540ccbeba1e2e76a1b10eb0fef41f589d6"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_source_checker::sources_are_fresh (cognitive 27): mise::task::task_source_checker::sources_are_fresh has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_source_checker.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"090827ad13909ed3ab37e0a5d59415f84a2b6868a2f7df1fe06065a7e6bcf44c"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapTomlConfig::merge_below (cognitive 26): BootstrapTomlConfig::merge_below has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (9 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 12). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/lib.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bb78ec90e2d5f3b211347f217c3eddf2ee8ad7aa09482beebe085a2885cfc2"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::defaults_from_config_files (cognitive 26): mise_system::defaults_from_config_files has cognitive complexity 26 (threshold 15). Drivers by points: loops 6 (16 pts), match/switch 2 (6 pts), boolean chains 2, if/else 1 (2 pts) (nesting depth added 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":"crates/mise-system/src/lib.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"800c838bc67ab507093f90c3c8ce6a4fc380b51b6f9643cce82fbfb2788c10cf"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::systemd::apply (cognitive 26): mise_system::systemd::apply has cognitive complexity 26 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 6 (12 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/systemd.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ede1c8d94cbd35390ccbde54acd8f48bfab2437d70bd3102a59cfda48cef307"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::send_scoped (cognitive 26): Client::send_scoped has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ae807a74dc552252069b17ec57f5248963b85750ef1952bf93472f8df61f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedGitBackend::resolve_lock_info (cognitive 26): UnifiedGitBackend::resolve_lock_info has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (4 pts), boolean chains 3, loops 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":"src/backend/github.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e888241c2222bfcdf23f3d7793e08002e20aa46cd83eaa340efb21f2edb84249"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::is_version_installed (cognitive 26): Backend::is_version_installed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 10, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":3892}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcc71b6e0c1ae066a90824e8a9b429e1853fdda6a6771c4030726bf5350e5a2"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapRemote::run (cognitive 26): BootstrapRemote::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 3, 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":"src/cli/bootstrap.rs"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"d982297546bb4eca5291a0f1030cb719e02fc7566f47a4486a36a2af079706aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderBase::resolve_path_patterns (cognitive 26): ProviderBase::resolve_path_patterns has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/providers/mod.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"efec4f0d58de2a8244d54df4042a45312b9cf2169b58fa621d14605786b943bf"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceProjectGraph::with_overrides (cognitive 26): WorkspaceProjectGraph::with_overrides has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (9 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1970d71b2d826800192ef63a5a1c0720b9169f7e2ea9852e1143ee995fc11ab"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceProjectGraph::affected_projects_for_changes (cognitive 26): WorkspaceProjectGraph::affected_projects_for_changes has cognitive complexity 26 (threshold 15). Drivers by points: loops 9 (16 pts), if/else 4 (8 pts), boolean chains 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"04db86f85cf0558e8239f7b871169551ba48adae50d1729b632e47b0689e790f"}},{"ruleId":"D2","level":"warning","message":{"text":"Toolset::install_missing_bin (cognitive 26): Toolset::install_missing_bin has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (8 pts), match/switch 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":"src/toolset/toolset_install.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0632b832510da81e1110c031069f4427b4258a44606738418a777b4a9d2eff5"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::migrate_monorepo_lockfiles_inner (cognitive 26): mise::lockfile::migrate_monorepo_lockfiles_inner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":2863}}}],"partialFingerprints":{"codehealthFindingId/v1":"333c2aa1407ac1fa911a12a2a479a8d504424ecf419ee65c514efe4f43e97743"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::secrets::grant::grant_for_task (cognitive 26): mise::secrets::grant::grant_for_task has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (7 pts), match/switch 2 (5 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":"src/secrets/grant.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c50f28aad2054bc645947d7962fdbf7978563b109b912f52594ac88aaa0ad91"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::secrets::grant::scan_tag (cognitive 26): mise::secrets::grant::scan_tag has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/grant.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b82f65e035c1ee759d26bab7842ef737a65f60625ee54c2356e320e45dbd1b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_cache_store::archive_to_cas (cognitive 26): mise::task::task_cache_store::archive_to_cas has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). Of this number, 20 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":"src/task/task_cache_store.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bd47491bca802510cb9be88f84d2a8a1c7a5bc60e7bb906d70c191d15f976b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_list::err_no_task (cognitive 26): mise::task::task_list::err_no_task has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (7 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":"src/task/task_list.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fa145358182c53f60508b87165c6f7b8be18911f06c845ed379698a12812f7"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::toolset::outdated_info::compute_config_bumps_for_paths (cognitive 26): mise::toolset::outdated_info::compute_config_bumps_for_paths has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/outdated_info.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"987edbe531e8a6650e0c8632de2d4e29888bd4c094093a432928dfff3aeed7a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Index::add_includes (cognitive 25): Index::add_includes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2, match/switch 1 (2 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":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1c44b67e05fdc846f1f42a49d50fb3ffce8b3421aa9dc38a8b5e8ebe253567"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_oci::registry::parse_challenge_params (cognitive 25): mise_oci::registry::parse_challenge_params has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (11 pts), boolean chains 7, if/else 4 (7 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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4219389a884ba0cfcfe137a907bf71afb010a253fe68961264bb4da87a04f1b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::touched_paths (cognitive 25): mise_system::files::touched_paths has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 6 (8 pts), match/switch 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":5783}}}],"partialFingerprints":{"codehealthFindingId/v1":"857be7d5a6978f7250357112683e7fc375ec9edfebf8ff2659337e4d60cbbac8"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::checkpoint::retain_omitted (cognitive 25): mise_system::history::checkpoint::retain_omitted has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/checkpoint.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"03792555e3ded1e730d35b26e8ae3dfc9d879c05f80ff908807b33662d224e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::replay::newest_differing (cognitive 25): mise_system::history::replay::newest_differing has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1954f5c8eec9dc543aa5ad8f6ce898a6268d0dfa6fa159a4c5a90b70edf30d8"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::prewarm_downloads (cognitive 25): mise_system_packages::brew::cask::prewarm_downloads has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a89b5be626b942a4c23b85c7cde70c60af5904455039114daf767a0de23c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::copy_staged_artifact_closure (cognitive 25): mise_system_packages::brew::cask::copy_staged_artifact_closure has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":2329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b595dbb3a32283ca421db2c1687b28ba42f2b42929a94fd34e78a619b367c123"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::github::sigstore::detect_with_mirror (cognitive 25): mise_util::github::sigstore::detect_with_mirror has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/github/sigstore.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"69448002ac748dd9675ab263d17b8484c9e121abca9d4b51160d0fc3820fded6"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginsLs::run (cognitive 25): PluginsLs::run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugins/ls.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7d6d611bac6f15b4469c58a849333e78782bb0de757477bd4d2e6215885bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"RustPlugin::outdated_info (cognitive 25): RustPlugin::outdated_info has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/rust.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d3527fd8b6bdbf5b353eb7fc49265995842f558c7f438aaf70f9f9f9fc9331"}},{"ruleId":"D2","level":"warning","message":{"text":"Task::merge_toml_overlay (cognitive 25): Task::merge_toml_overlay has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (20 pts), loops 3, boolean chains 2 (nesting depth added 1). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b38a7391ee90c77e1e006232e56a6c9101328da876a963bd62ee66327826c1b"}},{"ruleId":"D2","level":"warning","message":{"text":"TomlOpenState::feed (cognitive 25): TomlOpenState::feed has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd9cdf5d04f6ef558c9c7d41fb8fba518aaf9f0b7a6adb79ff68bfc8c092ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputHandler::replay_cached_output (cognitive 25): OutputHandler::replay_cached_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (6 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":"src/task/task_output_handler.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"e743363a1de2885e4115d51204df13cd37c928004d819c69193d6eb3b3646ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::static_helpers::current_platform_options (cognitive 25): mise::backend::static_helpers::current_platform_options has cognitive complexity 25 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 3 (8 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/static_helpers.rs"},"region":{"startLine":1989}}}],"partialFingerprints":{"codehealthFindingId/v1":"1845414c46a178a07d6ddedad8d8956510ac0bef2e8d91421d284f81df46dec9"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::bootstrap::checkout_bootstrap_repository (cognitive 25): mise::cli::bootstrap::checkout_bootstrap_repository has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":5330}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c3ba7f2157355c1b216734a3859be712759aafb37a455efbbccff1a1c11eca"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::sync::reconcile::reconcile_all (cognitive 25): mise::cli::sync::reconcile::reconcile_all has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/sync/reconcile.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e2d854b836843f9cf4500d885972752c605c40922142cbe2183d7d2f343eb1"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::detect_auto_env_candidate_files (cognitive 25): mise::config::detect_auto_env_candidate_files has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (15 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 14). 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":"src/config/mod.rs"},"region":{"startLine":3289}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c7ff86fb2f23a21bd5257c26027b610f6e8616034feef84c90de5af89a934d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::load_task_file (cognitive 25): mise::config::load_task_file has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":8004}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b57fb9b7cbfac4352caf9d422e5296bc28b842ea0ecdf3307dcafd2481b8d7"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::env_directive::shell_expand_env (cognitive 25): mise::config::env_directive::shell_expand_env has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (8 pts), match/switch 1 (2 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":"src/config/env_directive/mod.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf702296f85130f4878644981e6142d66a62f603a73f5f305da02ba53cb1609"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_load_context::expand_colon_task_syntax (cognitive 25): mise::task::task_load_context::expand_colon_task_syntax has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 3 (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":"src/task/task_load_context.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9ffbb2f0cdd3a984cde417d76506f6874492351392fe04c89dd0721cfb7440"}},{"ruleId":"D2","level":"warning","message":{"text":"Index::add (cognitive 24): Index::add has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 2 (6 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"448264fd8d4ddd486cb837252077531eb171d848e938b3493ce673f55a848f6b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_lsp::includes::glob_matches (cognitive 24): mise_lsp::includes::glob_matches has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (6 pts), loops 2 (4 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":"crates/mise-lsp/src/includes.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1cdf5757abe9f6e4598213769b3fc0d537bd956238215fb2a00fda23f9c861"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_oci::registry::push_image (cognitive 24): mise_oci::registry::push_image has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (8 pts), loops 2, 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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68c7426c3156065a705765d34ef9bfd877838aca234e731e182fd36cd6f9d80"}},{"ruleId":"D2","level":"warning","message":{"text":"Applying::check_planning_still_holds (cognitive 24): Applying::check_planning_still_holds has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3138259837d0d1b874c78942667a1b28e53918d2672c832b005c6d3f002ad39"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteHost::validate_with_source (cognitive 24): RemoteHost::validate_with_source has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/remote.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0435e8fbd7578d3c10abf2c84437dbf8b441c36aa6cab60751852601418d5d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::scope::recover_records (cognitive 24): mise_system::history::scope::recover_records has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/scope.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ddfc22542df95e0836fe0c2799d7074f58a223f2b812f93484da981ec3bef7"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedGitBackend::detect_provenance_type (cognitive 24): UnifiedGitBackend::detect_provenance_type has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad75d31176969eeb8d19355f7644e3d72ae3a3709a7c8f5a65e81063e6f1374"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapStatus::collect_packages (cognitive 24): BootstrapStatus::collect_packages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (6 pts), match/switch 1 (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":"src/cli/bootstrap.rs"},"region":{"startLine":4489}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab7c97e938bcdd417baf82c9d965c1f801c1fccfdebdbf290246e91f6888f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryDiff::run (cognitive 24): HistoryDiff::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 3 (7 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/history/diff.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac05ed249ce60cdb818913020e100304829828d535b5ac5cab537de464022b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"VfoxPlugin::ensure_installed (cognitive 24): VfoxPlugin::ensure_installed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/vfox_plugin.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"810ee84dc57bfc7d641fdce01334c851a136ef23114ff6578e2d9998d0e02df8"}},{"ruleId":"D2","level":"warning","message":{"text":"Task::render (cognitive 24): Task::render has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, loops 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f20b2e68a278e6f1669a0a8c934f4a345f446d30a7c82a8eb770ea9704ec97"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskExecutor::prepare_task_context (cognitive 24): TaskExecutor::prepare_task_context has cognitive complexity 24 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":2717}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a146062c76ed55c31f251bf271db4c42ca32d7754eac5ce241347656be3affa"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::pipx::fix_venv_python_symlink_in (cognitive 24): mise::backend::pipx::fix_venv_python_symlink_in has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (6 pts), match/switch 1 (3 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":"src/backend/pipx.rs"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8756ec5399e70c0004d089540b80fc70498f016d68d1e35c3e9a625c5f1c2f2"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::dotfiles::history_status::print_capture (cognitive 24): mise::cli::dotfiles::history_status::print_capture has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts), boolean chains 3 (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":"src/cli/dotfiles/history_status.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec678dd4f62d624ff535286c9022d42ce458aeff3ca6721c1fcd7c5c1ded5e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::dotfiles::track::activate_and_baseline (cognitive 24): mise::cli::dotfiles::track::activate_and_baseline has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 1 (3 pts), loops 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":"src/cli/dotfiles/track.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa7772cf275efba38c243d9ae39b656d79b264b7286d46881fe418fc24a68d8"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::generate::task_stubs::validate_stub_paths (cognitive 24): mise::cli::generate::task_stubs::validate_stub_paths has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (7 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/generate/task_stubs.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71da154af857c41a2d62a10227ff883ed4c23e9084e41d9ed5e870776000f58"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::packslip::completion_script (cognitive 24): mise::packslip::completion_script has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packslip.rs"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9a8e9f4eb7a76244e2e01e3cf2ed237432c6897520992699763009d2523ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::runtime_symlinks::rebuild_symlinks_in_dir (cognitive 24): mise::runtime_symlinks::rebuild_symlinks_in_dir has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, 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":"src/runtime_symlinks.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bc29d27f2d2493ae00a0359194a1952f6b99a2df4ed4f309de03648d6890ba"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::toolset::install_state::remove_credential_named_installs_in (cognitive 24): mise::toolset::install_state::remove_credential_named_installs_in has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/install_state.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b42385c471424aab00d28c7e66d5a86bcc3b1ce845989a724a6cfa1363a3393"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposeRequest::action_args (cognitive 23): ComposeRequest::action_args has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/compose.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4aa5584fb45405ce48bbf9eddd4be7688ede7885c871fd0f430738060ed6d6"}},{"ruleId":"D2","level":"warning","message":{"text":"RepoRequest::from_toml (cognitive 23): RepoRequest::from_toml has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2, loops 1 (2 pts), match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/repos.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7eea39cf4441d81a594a7d539c28c05110af7d0fe8b83f03ce62fada18700a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::dotfile_groups::expand_group (cognitive 23): mise_system::dotfile_groups::expand_group has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, loops 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/dotfile_groups.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ed19f58bd1b77cae01e6542c4d2d0dde572453ea70033bcc5b8cd52bc92bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::replay::unsaved_paths (cognitive 23): mise_system::history::replay::unsaved_paths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, match/switch 1 (4 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":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cda7337e0570920b0dec7c3f85b9dc30c0ba1670cc16c21db0dd8b3d38b9df"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::onboard::run (cognitive 23): mise_system::history::sync::onboard::run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/onboard.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a43e261de1bd6e5f41c98bda7efa95a595fbfb6e0b725a3778dd6bc32fa90d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::installed_skip_reason (cognitive 23): mise_system_packages::brew::cask::installed_skip_reason has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bb07b8eb96f0cfc13aa885815dc297b04e7de3e73b37737b9d5d0e8219e20f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::state::cask_target_claimed_by_another (cognitive 23): mise_system_packages::brew::cask::state::cask_target_claimed_by_another has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/state.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"af845638a48ea9d4f84524a7d6297fdea85ee41aa2139ff8c47d351855243124"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::pour::remove_abandoned_staging_dirs (cognitive 23): mise_system_packages::brew::pour::remove_abandoned_staging_dirs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/pour.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"160b0662d76a122a8394ece795d973e2806da7a70b5b3e6526239842901de5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::prefix::bootstrap (cognitive 23): mise_system_packages::brew::prefix::bootstrap has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/prefix.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14383bab743f13f83d8a172b59eaeac6c3ee7633390055352017639d29c4207"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::http::cas::evict (cognitive 23): mise_util::http::cas::evict has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http/cas.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcba3cab3758fc4125c5f6ee90509aa54e543c8174ecb5dcd676fc2f5b199059"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::run_postinstall_hook (cognitive 23): Backend::run_postinstall_hook has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 5 (8 pts), match/switch 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":5460}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc832afe34a80087bb9c38f0d4fd9fe023d818a1bc8c5bae9c79cd1d84496f62"}},{"ruleId":"D2","level":"warning","message":{"text":"Run::setup_output_and_validate (cognitive 23): Run::setup_output_and_validate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (11 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/run.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e46ca38ae02e1711ede58d794a9e2456c57da1b91c3f0fbb50513677ec5ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"Set::get (cognitive 23): Set::get has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/set.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cb2c9a74710154f6a8b011c14f103537f5b1d57a906d0993c7ef617db1c8ea"}},{"ruleId":"D2","level":"warning","message":{"text":"DepsEngine::execute_command (cognitive 23): DepsEngine::execute_command has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 3, boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1f98f8d2d3746a641f998c506234f56119a0382ef4618ab3ce32e5a0999d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::spm::artifactbundle_binaries (cognitive 23): mise::backend::spm::artifactbundle_binaries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 3 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/spm.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b815257c1ce1874a3f644d823af80df70b2d79e319a81cf88583b51c0895090"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::prune::delete (cognitive 23): mise::cli::prune::delete has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/prune.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f88c3738285d5f3ac011b1cf1b431652429ae4306d367b6cd270ee73d409a8"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::tool_update::update_due_tools (cognitive 23): mise::cli::tool_update::update_due_tools has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tool_update.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5947649871149aab29b3058ae47fa06ff2076e098b9d617631b548841e5cf76"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::miserc::find_miserc_files (cognitive 23): mise::config::miserc::find_miserc_files has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/miserc.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab72e0bcd44fc9208c9b5865134aac274d4e587c4f36fecfbbba0a44887abef"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::secrets::template::check_toml_locations (cognitive 23): mise::secrets::template::check_toml_locations has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (9 pts), match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/template.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee64629404b16d09bebcd1bd01a14f473ef555f14c1f66851146788d9eb05177"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::toolset::keep_uv_python_variants (cognitive 23): mise::toolset::keep_uv_python_variants has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (6 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/mod.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccad89a13dda50d4abcbef2a47c62c6c746dcd1e8a46b48098683bbea8bdc985"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::watch_files::execute_runs (cognitive 23): mise::watch_files::execute_runs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watch_files.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4df8992fc90ab1d20123ba01c224aa4f81285fa2765fb5bd358d7e9d7898c7"}},{"ruleId":"D2","level":"warning","message":{"text":"export.main (cognitive 23): export.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 6 (10 pts), ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/export.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b286a3b521d2fb9bd3d94222c0a946467ba1d551c7d2f47ff404874e7ab4419b"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.main (cognitive 23): scan.main has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/scan.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce36da8a41b7ae7d5d22ff71645d4be4a5fa48921b7845ad6898841ec8ac029"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_daemons::import (cognitive 22): mise_daemons::import has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0aaae9c49c8b72431c683d7d6f42037d2a75eaf01a03a66a4eaa822100c6241"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_daemons::prune::remove (cognitive 22): mise_daemons::prune::remove has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (7 pts), loops 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/prune.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"549fa78431b7a4cef86e9d52d47a24b39deb7fd4c3adf35dd69b55edb93990cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::strip_one (cognitive 22): Walk::strip_one has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/purge.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"badaf0312a3189dcd1aaa9a3618bb3e250d5e3f314eeb4f6a552c39676f9a71b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::edits::resolve_entry (cognitive 22): mise_system::edits::resolve_entry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 5 (8 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/edits.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb62b55cfe4d664b16fa945970af130739a08f8ac4025fb368b4dfaf176dc1d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::replay::classify_coverage (cognitive 22): mise_system::history::replay::classify_coverage has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2366913b8654b2482fa3e9984945f7213347be06930f5438ab1253547d1331"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::tracked::unselected_declarations_with (cognitive 22): mise_system::history::tracked::unselected_declarations_with has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e142e1dcd47f1f9beb483ae4bae61c3c9bb03359ceaaccd92e1a1c7f6e77b35"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::systemd::status (cognitive 22): mise_system::systemd::status has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/systemd.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b256b7b3f3e2ecfb1bd25eb5d97f4ec1005106a24c20aa7c5f0429c1d96fc154"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::app_version::compare_app_versions (cognitive 22): mise_system_packages::brew::cask::app_version::compare_app_versions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, loops 1 (nesting depth added 5). 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":"crates/mise-system-packages/src/brew/cask/app_version.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"8619223fc20d7668d6b651647528282fc03c3cf58157bcb80fc6ff5c326e5d01"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::github::oauth::refresh_cached_token (cognitive 22): mise_util::github::oauth::refresh_cached_token has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/github/oauth.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"156c119078ed2613f4e173453bde0c9ff829662f2c2411297b32fdc1299cf1ca"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapUserStatus::run (cognitive 22): BootstrapUserStatus::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":6161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac76826f486b55c6ac29797f95144462d1a52870dcce662ad6358eadbf8a0c37"}},{"ruleId":"D2","level":"warning","message":{"text":"Lock::prepare_targets (cognitive 22): Lock::prepare_targets has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 5 (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":"src/cli/lock.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5b9afa47cab104797fb3fde89030b3c72fd1a91e5d28df270d284e4a11364d"}},{"ruleId":"D2","level":"warning","message":{"text":"Ls::run (cognitive 22): Ls::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ls.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c006186f0ee75e6dd19d3fbf5fe7663ea13a012507a7f9446cf5a07a7bb27fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"Cli::get_command (cognitive 22): Cli::get_command has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa6d5bbdfde1e6ff448e3460e120b13d53bd296a594cb708f9e6e6cbb369c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings::parse_settings_file (cognitive 22): Settings::parse_settings_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/settings.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6770f1fef4f3ab75e2536fb0cee14efe21e34dccc9df6ac29485aa0f637b6ecd"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemUse::run_inner (cognitive 22): SystemUse::run_inner has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (7 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/use.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b8f8bfeba0496d9d8c03449c3250a1eac48743e7c77fea42ecf0fef1e9c7ec"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallDependencyContext::resolve (cognitive 22): InstallDependencyContext::resolve has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, match/switch 1 (3 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/install_context.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b27f23e92049edbfea48e36e5656efac18abb660072cfcb616a0665798eeef1"}},{"ruleId":"D2","level":"warning","message":{"text":"RubyPlugin::find_precompiled_asset_in_repo (cognitive 22): RubyPlugin::find_precompiled_asset_in_repo has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/ruby_lock.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5f9da75e1305d1a6d2cbfdfadb10aedcd9f9e2e7e23fe68c2607fb51cac2de"}},{"ruleId":"D2","level":"warning","message":{"text":"Task::resolve_workspace_task_dependencies (cognitive 22): Task::resolve_workspace_task_dependencies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, loops 3 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 7 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":"src/task/mod.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01ed59d072c2d57f390086db65c019adc74ec4d26226a4a3d587dba5aa5ef46"}},{"ruleId":"D2","level":"warning","message":{"text":"Toolset::ensure_plugins_installed (cognitive 22): Toolset::ensure_plugins_installed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (5 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":"src/toolset/toolset_install.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e83a192970fd985beb91dcd41aeb5b8f5322348a5efc2a9d18a4a98eae2d007"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRequest::is_install_satisfied (cognitive 22): ToolRequest::is_install_satisfied has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (5 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":"src/toolset/tool_request.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ebcd9715646a72dc53be1c88d931ad92c1f39caedec3c573d53932b62f1f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::exec::exec_program (cognitive 22): mise::cli::exec::exec_program has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 3 (6 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/exec.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e3715290d92194124cd8354ac2fe7c764e82cd50dd366e44fd0db5f5c9e908"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::hook_env::config_search_dir_mtimes (cognitive 22): mise::hook_env::config_search_dir_mtimes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (9 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":"src/hook_env.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"42af322312300db19f4fb93c0f7fa8fdb59734bbdfe63eef6cee5b055b560430"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::hooks::run_matched_hook (cognitive 22): mise::hooks::run_matched_hook has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d304f48d0afad0643cf0b55fe2bf43711de59c283f0f49f4bc9adcb0e0a8248"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::hooks::execute (cognitive 22): mise::hooks::execute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac0169b0131ffc9f06edd2c07e154975a4455abb4d8a68c566ec0b641ac1444"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::install_layout::resolver::allocate (cognitive 22): mise::install_layout::resolver::allocate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/install_layout/resolver.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1688029c3a99afe6ee3bb6897467008fae13c35262e8972a012ebbde20e94dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::plugins::core::swift::missing_sonames (cognitive 22): mise::plugins::core::swift::missing_sonames has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (7 pts), loops 3 (6 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":"src/plugins/core/swift.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"54308d3800a5ecd1c6b96bf5c30176e8d899fdcb79d723dc708d412f28da03ba"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::secrets::template::check_task (cognitive 22): mise::secrets::template::check_task has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 4 (8 pts), loops 2 (4 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":"src/secrets/template.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"d277691e8281600f7db8e7104ec63130b7d1e58512923e4415f9a94adc05c506"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_source_checker::glob_walk (cognitive 22): mise::task::task_source_checker::glob_walk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 3 (nesting depth added 4). Of this number, 16 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":"src/task/task_source_checker.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b78efdb14f27c2ebee1f64afe190c74a8e2ee0bb071b76367edcc34e3b082d"}},{"ruleId":"D2","level":"warning","message":{"text":"frames.render (cognitive 22): frames.render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 6 (8 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/frames.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed330200af73ad2a9b8a78f967517f496e7e3320f0c850aca9a884ffe0084aac"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskToolValue::render_templates (cognitive 21): TaskToolValue::render_templates has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), match/switch 2 (nesting depth added 11). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (render_value). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68921b31f256edb424d1509c13a1ed5787bc8e0c1e2881bd9a4ed49e7895d83"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveConfig::apply_new_key (cognitive 21): InteractiveConfig::apply_new_key has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/actions/edit.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"26250392f46462c74783d75ece0e342a4e5b834bceadf711cb504fa63d6aa9e5"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_oci::registry::merge_artifact_tree (cognitive 21): mise_oci::registry::merge_artifact_tree has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (7 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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e006f697c5cdaba92e704159898eb418f533790a4fae863c25a8581d7f6fac9"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::rewrite (cognitive 21): Walk::rewrite has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 6, match/switch 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/purge.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c15e3d26183a1df889dd20e18467ea38cbf2eba3ee96bb12d4335385354c5b"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryRepo::compose (cognitive 21): HistoryRepo::compose has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (8 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59f412e83bd600b232543f8332d43e66ffc2ddb6a2634691924e271d870c592"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemdRequest::from_toml (cognitive 21): SystemdRequest::from_toml has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/systemd.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccb0f1d74622a693ecf52dfbd2c8d59aa7fe1950601c549e7a80f30c2abbc49"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::share::current (cognitive 21): mise_system::history::sync::share::current has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (7 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":"crates/mise-system/src/history/sync/share.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"45487a350c8de80db4bcb38cc269142812ec4c2205eb7d9b335ceb56d0137f91"}},{"ruleId":"D2","level":"warning","message":{"text":"FlightTargetTransaction::rollback (cognitive 21): FlightTargetTransaction::rollback has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 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":"crates/mise-system-packages/src/brew/cask/flight.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9694cc54146da1c5eab516a91b04ffaf13d097bd7e82d621caab93b362cee42"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::bulk::top_level_elements (cognitive 21): mise_system_packages::brew::cask::bulk::top_level_elements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/bulk.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6123b0645994834c84a51208d2c1eb4fd5ac9452cf1eb6a1b1256afd114a47c"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::file::link_target_stays_within (cognitive 21): mise_util::file::link_target_stays_within has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/file.rs"},"region":{"startLine":2990}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0527e160d7640643701a6627b543434783e39e9028633db306e12413ae4b22"}},{"ruleId":"D2","level":"warning","message":{"text":"AquaBackend::verify_provenance_at_lock_time (cognitive 21): AquaBackend::verify_provenance_at_lock_time has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0637f11ef5823c665503d5174623203b96ed07ef9877f03a87c4d68466ef1a"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigLs::display (cognitive 21): ConfigLs::display has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/config/ls.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c374e831aea20a82a34e7a1fd0b6763d91af386145d562b5feff2bca76971a"}},{"ruleId":"D2","level":"warning","message":{"text":"DepsInstall::explain_provider (cognitive 21): DepsInstall::explain_provider has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/deps/install.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf010a7ce487b65f225cfa5e63a1c7d770c8f1d192516200aa243d4cc850ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"Doctor::doctor (cognitive 21): Doctor::doctor has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b1591b27e70e26b1a5226f9e841c6620109f8071d7092b88f214e45c082041"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryLs::run (cognitive 21): HistoryLs::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/history/ls.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6718abd3c1e53f1982cb97bad026059643510b784ddebb8fd94422fab262939"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsLs::run (cognitive 21): SettingsLs::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/settings/ls.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bae88d0f0fc9e9f808390567bcaaec7b6ea13600fe8542f02b82b88c09e706"}},{"ruleId":"D2","level":"warning","message":{"text":"Trust::clean_in (cognitive 21): Trust::clean_in has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (6 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/trust.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8955083875cb156bb781bcdef3c5a085e34d12f478d8fb94612aed03192bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"Toolset::list_installed_versions (cognitive 21): Toolset::list_installed_versions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (7 pts), loops 3 (5 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":"src/toolset/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c835ef0b17948934c1524fc3d78ddc4c59f10ab4c3accd5710507f4e027d30a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::args::tool_arg::parse_input (cognitive 21): mise::args::tool_arg::parse_input has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args/tool_arg.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e6dce3ccbf5d7d09f2e991a860569f457a6e43c995939c4bcb2d832828a6f3"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::jq::extract_values (cognitive 21): mise::backend::jq::extract_values has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/jq.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"7106cf79dac25dd36d4dd22194f3a8bea32f8749a5c96751890c0e3c806cf410"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::npm::aube_install_tree_health (cognitive 21): mise::backend::npm::aube_install_tree_health has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/npm.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"49642a67afa60544dfbea3635874482046510a4f5723271f645cbf8f8e809de0"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::static_helpers::rename_executable_in_app_bundle (cognitive 21): mise::backend::static_helpers::rename_executable_in_app_bundle has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 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":"src/backend/static_helpers.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cb4494df6e82db817771b5ad290e7e17a6e41ff51864b1f42871dc58f5454c"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::config_file::trust_check (cognitive 21): mise::config::config_file::trust_check has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mod.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f3e2be2def7690e4b9ac62eb9ce7869cd0e7ada87a105b0a111cf4c47c4aed"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::miserc::scan_tag (cognitive 21): mise::config::miserc::scan_tag has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/miserc.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4f6279f8a981517de724e913b882b2dc91d7d6e289906e5853f0b162eb7b62"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::settings::normalize_hidden_config_aliases (cognitive 21): mise::config::settings::normalize_hidden_config_aliases has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (21 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":"src/config/settings.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccecd9d0c896f9810b163090932d4c69a73c139d9bbd5cca1457102446aa3d1"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::settings::load (cognitive 21): mise::config::settings::load has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/settings.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"28260d03bb3bcdec03a33891f43bcea034d0dfc94c67934fbc88c73a93e37178"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::warn_outdated_lockfiles (cognitive 21): mise::lockfile::warn_outdated_lockfiles has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82ad5ac0539fbefd762d32c6e2a901f5370e89cdceaafdb61ced6c6f8872e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::merge_lockfile_preserving_root (cognitive 21): mise::lockfile::merge_lockfile_preserving_root has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":3183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9b2c87b43f49b8cd8c6b0279789762f353fda8d9439ad57bb4e56647631920"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::oci::builder::build_dotfiles_layer (cognitive 21): mise::oci::builder::build_dotfiles_layer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oci/builder.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4accd4b460f27037e65d684fd7d97e504704545123d0ed2b065bbbeb484b703"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_cache::write_archive (cognitive 21): mise::task::task_cache::write_archive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache.rs"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a807d7fa8e6955f3c5a21189457c6640808dfa0499c0d7e9b56a5ceb54c56d6"}},{"ruleId":"D2","level":"warning","message":{"text":"AquaChecksum::merge (cognitive 20): AquaChecksum::merge has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (20 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/aqua-registry/src/types/verification.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbe37e20e5265a7624d2c2a06b9199e7ea786a8799431d914b49d8d237128c1"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapPlan::ordered (cognitive 20): BootstrapPlan::ordered has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-bootstrap/src/plan.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6b33024d3b64991a58001552c5ac686e285d5d2d5cf21a5a5ed533eaf28ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_dotenv::render::is_unquoted_safe (cognitive 20): mise_dotenv::render::is_unquoted_safe has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-dotenv/src/render.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"102a8c531ff62da2f88d6925f23594939bcb17643414f8f0bfe0bcc80801d179"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_lsp::semantic::tokens (cognitive 20): mise_lsp::semantic::tokens has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (6 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/semantic.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f730deee4e2176b13abfef7226e69a6ce8637ee6242bd9fc9b31b6f06348fd8c"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_lsp::tasks::references_in (cognitive 20): mise_lsp::tasks::references_in has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 1 (2 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":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8ab9c15413166c3639ab17e6ad5ed523169b6a40205fb77d23985b54667e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchPlan::build (cognitive 20): WatchPlan::build has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/watch/plan.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b84a954d6de5f8c00af650ac0525426ca93717e511318889b675ddc390d39b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::check_symlink_each (cognitive 20): mise_system::files::check_symlink_each has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":2822}}}],"partialFingerprints":{"codehealthFindingId/v1":"88296ff001591bd03c5322c2c1a1478daecabede779555b609027751f81dfa02"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::find_conflicts (cognitive 20): mise_system::files::find_conflicts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":5360}}}],"partialFingerprints":{"codehealthFindingId/v1":"0322bfdc74d9d0bb0ec875f860af121062729bb1d571a42302556cea737f2468"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::systemd::render_service (cognitive 20): mise_system::systemd::render_service has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, loops 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/systemd.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f5f1ab575b5d32abb4e1a756155f32c3b5500001fa81c673dd8f408df3d05c"}},{"ruleId":"D2","level":"warning","message":{"text":"AptSource::parse (cognitive 20): AptSource::parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, 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":"crates/mise-system-packages/src/apt_sources.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6310c76e23a858d3f5409de9c7f9801d057e7e10499756e78d2d4fe522bfe61"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::path::split_shell_command_windows (cognitive 20): mise_util::path::split_shell_command_windows has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 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":"crates/mise-util/src/path.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"803c8735c2c2a93e5d00284e72b6796128f84dad107e44ea42ba0ca2d385deed"}},{"ruleId":"D2","level":"warning","message":{"text":"AquaBackend::run_cosign_check (cognitive 20): AquaBackend::run_cosign_check has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 7 (9 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4af28d4fd6b34060a17304c9633b2245c86102c87a384a21339eb772cc13a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"AquaBackend::install (cognitive 20): AquaBackend::install has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dcb3175c92c7f897d42d78b8de01d4cc642d75c139040d1b5c4d177e5355bf"}},{"ruleId":"D2","level":"warning","message":{"text":"OptionSpec::unknown_keys (cognitive 20): OptionSpec::unknown_keys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc526ebc7c3179c49f563d760718a064dede618d70a4764f31acb4e63a747a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::list_remote_versions_with_info_and_options (cognitive 20): Backend::list_remote_versions_with_info_and_options has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, match/switch 5 (7 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c2980128bde368532f5176d3a3f0aaf7c6758af234ad92b4fb86923df6dbd2"}},{"ruleId":"D2","level":"warning","message":{"text":"Env::run (cognitive 20): Env::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (13 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/env.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e538048aa2324a2ee042aae58778f378916da065e97f982106ce3ec541e14e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Search::get_matches (cognitive 20): Search::get_matches has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 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":"src/cli/search.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"51837d20e466cf7d0255045eb7aebb32c4c12176bb9948cc20088a7c7ffcb4c2"}},{"ruleId":"D2","level":"warning","message":{"text":"LockfileTool::try_from (cognitive 20): LockfileTool::try_from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":6210}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bd30080a7606339934568e40c5ea03c31cc15a4ec34da642a2c74574b2c838"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolOptions::insert_core_option (cognitive 20): ToolOptions::insert_core_option has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (5 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_version_options.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2e9d8369f597146b898c7b1f4da2807e9b1490df9dd7e77e72e4ae4b8fe992"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::gem::rewrite_gem_shebangs_in (cognitive 20): mise::backend::gem::rewrite_gem_shebangs_in has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (3 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":"src/backend/gem.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b9eff7e818c79660551603de2691050b8d5b8f027e24a25d631b64539fa3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::resolve_target_config_path (cognitive 20): mise::config::resolve_target_config_path has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":4018}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b257afe29010d3da1e42d18e136281004bcd2344abbb24f8d0a66c4e327f2e3"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::load_all_config_files (cognitive 20): mise::config::load_all_config_files has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":4172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cc564726abefa9c1b1341a316ec03bc780ace8be24b76b7ba59b85fc3862b7"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::config_file::detect_idiomatic_backends (cognitive 20): mise::config::config_file::detect_idiomatic_backends has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mod.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb4e4f754ff9e889b92d2c7eba2dc584bf4a341c94328a6b9fbef9891ed0bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::config_file::config_root::config_root (cognitive 20): mise::config::config_file::config_root::config_root has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/config_root.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd1ebc00358548fea53b7e471115a992707f11bd7e50f33266851b538cf466d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::oci::builder::build_rust_homes_layer (cognitive 20): mise::oci::builder::build_rust_homes_layer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oci/builder.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9870b429275493fd3e72ce698ff95a716fec6a29d0c08c55c9f97890d87af01"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::secrets::grant::static_problems (cognitive 20): mise::secrets::grant::static_problems has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/grant.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba81819d6422e554e6f3f805b0ea8f3da83eff4379c819b14280744c965ab21"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::shims::reshim_for (cognitive 20): mise::shims::reshim_for has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 6, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c9e4c68540e0f6edf58137269febee84206d390c90d10efca3738608ffd31f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::shims::publish_staged_shim_farm (cognitive 20): mise::shims::publish_staged_shim_farm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fa1b466f74e6694a54affcdf450c2479bf15097a21d1474e7dda262885ab75"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::usage_command_for_args (cognitive 20): mise::task::usage_command_for_args has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 5, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"011323d56d8ae9d0ced5a7d60f947e894244ffc92c802e72a29c798d4edb206c"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_cache::enforce_task_cache_limits (cognitive 20): mise::task::task_cache::enforce_task_cache_limits has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6b53406835bf7954bfb2303993787a8dcb9300ad5dd0992e400d293d8efc89"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::toolset::running_windows::absolute_paths (cognitive 20): mise::toolset::running_windows::absolute_paths has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/running_windows.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a23ef1c52dc2aaf0ba0ea9e3e316315918948bd8626cc5b6f0e93be80299f0b"}},{"ruleId":"D2","level":"warning","message":{"text":"scan.scan_capture (cognitive 20): scan.scan_capture has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 3 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/scan.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbe7d693dabbfa6e45868deb98c6c92f9012252a227a31a2e53dea150e8562a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_agent_env::detect_with_env (cognitive 19): mise_agent_env::detect_with_env has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-agent-env/src/lib.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe71eb85f9c23e99b80d1500bde8fe64e3b23e6d47a8f2f131a8815bc71c401"}},{"ruleId":"D2","level":"warning","message":{"text":"TomlDocument::parse (cognitive 19): TomlDocument::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/document/parse.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"02390d7a5beddbcb1f351ab71b0a075c00e6393d898ebef5e4f943234eb7e068"}},{"ruleId":"D2","level":"warning","message":{"text":"TomlDocument::entry_value_to_item (cognitive 19): TomlDocument::entry_value_to_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/document/serialize.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3024f2a06097ceb494a52653e4e48e67b4e29f590d09d1740b4a1690acbbdd67"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_lsp::includes::task_include_files (cognitive 19): mise_lsp::includes::task_include_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/includes.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"364d820d73614d10087c1ed7f7358e2365872060e6fe98847dc77071b3653260"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_lsp::rpc::read_message (cognitive 19): mise_lsp::rpc::read_message has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/rpc.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d6160a91cde9c5629903b4d795212d408e26f56e95243cd6d0ecff6f22ec6f"}},{"ruleId":"D2","level":"warning","message":{"text":"FirewallRequest::plans (cognitive 19): FirewallRequest::plans has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (9 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/firewall.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1415e0c6b0d867a7bbb7ba39c64a978ccaba3d8476697690798444e3bb4cd6d"}},{"ruleId":"D2","level":"warning","message":{"text":"Applying::adopt_history (cognitive 19): Applying::adopt_history has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07ddf41756adc45130a6f4fa2f32768f82e39d534fc46c5cdbc4630fb1ade5c"}},{"ruleId":"D2","level":"warning","message":{"text":"TrackedSet::walk_entries (cognitive 19): TrackedSet::walk_entries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46ea908a2cc9e856cb13b01db4fa0acf5fb227b15b9745dac5eb8d050c8166b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::edits::plan_unapply (cognitive 19): mise_system::edits::plan_unapply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (7 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":"crates/mise-system/src/edits.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fbcceb9f0458915514b7fe4ab38cfe60a1c304ee9a52d7c0d106a1fd16c628f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::validate_file_variants (cognitive 19): mise_system::files::validate_file_variants has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5f76b02e5159b1901432054659ce2a8726c00a49ce60b0f9b710f2731e0435"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::remove_created_dirs (cognitive 19): mise_system::files::remove_created_dirs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 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":"crates/mise-system/src/files.rs"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5302cef264cf272a5711ad6e9ab77074571c8756ab9b4f891d7e0bb3f2ae83b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::checkpoint::file_modes (cognitive 19): mise_system::history::checkpoint::file_modes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/checkpoint.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"5963e1e13ea3459a7ed258e18875a7bfd4b7afbcbd7fea4fefb976468e7d3ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::replay::undo (cognitive 19): mise_system::history::replay::undo has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4368162381f81c07315b50b3fd14e1513c7e217abcb07a75b21fde24ed9c585"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::replay::decide (cognitive 19): mise_system::history::replay::decide has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de4406fa07c6258f2bf9c3ba250dbbda35c02ee51224e38b3179b71da753a34"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::reconcile::upstream_with_interaction (cognitive 19): mise_system::history::sync::reconcile::upstream_with_interaction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (5 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/reconcile.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cef1801b3243c59727127c0c2215aaa61d7099d597e222d58213a401e49e343"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::hooks::run_phase (cognitive 19): mise_system::hooks::run_phase has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (4 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":"crates/mise-system/src/hooks.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94b7fed1c4b8c5b9633a686852187febc7c2d39202518bd0387b119b5b34d8e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::check_name_conflicts (cognitive 19): mise_system_packages::check_name_conflicts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 1 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/lib.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3192dcc0224646aeacf674d6673aabdc9f18123b6ef1fcd361017e781d02e61"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::remove_obsolete_app_targets (cognitive 19): mise_system_packages::brew::cask::remove_obsolete_app_targets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 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":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":3214}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44e5a8e14cbf5a42c2ba9fa19f81dd159217b8293c24185268ad89792429b34"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::state::validate_cask_prune_claims (cognitive 19): mise_system_packages::brew::cask::state::validate_cask_prune_claims has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/state.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f859507158e6148a7f2d2c076126a281fd26cf6d1bcb466818895a61e525115"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::post_install::apply_mode (cognitive 19): mise_system_packages::brew::post_install::apply_mode has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 3 (8 pts), loops 3 (5 pts), if/else 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/post_install.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd5232963ee2806c8e19f0172ff0b87cefed14e942f4f8331d273db4ffecdfb"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::http::cas::keep_file (cognitive 19): mise_util::http::cas::keep_file has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http/cas.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57e070740f4be71518295c82fdeed6c0d36295aa634d59a54586b589cd9947f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::path::resolve_posix_shell_program_path (cognitive 19): mise_util::path::resolve_posix_shell_program_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/path.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b88d7125b829a38f2e1cfc6d80eafdc1aff016e6c1c5e93a83d6d8f18febf2"}},{"ruleId":"D2","level":"warning","message":{"text":"vfox::vfox::install::link_target_stays_within (cognitive 19): vfox::vfox::install::link_target_stays_within has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfox/src/vfox/install.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76a058d4127921baa71e57df72ca211a6cc0d462473fd1928147b47a9bd52af"}},{"ruleId":"D2","level":"warning","message":{"text":"Backend::latest_version_with_selection_options (cognitive 19): Backend::latest_version_with_selection_options has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 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":"src/backend/mod.rs"},"region":{"startLine":4541}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30275d4f7559e684447842765499fdbbb46ca26e473f83804679280dec9b933"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendsSwitch::find_switches (cognitive 19): BackendsSwitch::find_switches has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/backends/switch.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a703d214274fd94b50de1abf16c9fb1479740c6c895882b47c17458a00acb55"}},{"ruleId":"D2","level":"warning","message":{"text":"DotfilesRecover::recover (cognitive 19): DotfilesRecover::recover has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/recover.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"096acb2fa7a43be8d0d055b4164a5ec9e08b8c1213077a7aaa4640e2e8a70635"}},{"ruleId":"D2","level":"warning","message":{"text":"DotfilesUnapply::run_inner (cognitive 19): DotfilesUnapply::run_inner has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 6, loops 2, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/unapply.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d517852f2f8b02d7ce507127c864830844355a362029c6c2fd8142ce86a709"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings::load_sources_from (cognitive 19): Settings::load_sources_from has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/settings.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d648d5da372a0972d288f587c8bafc54a8e0cfd7364c4c05a040ee5c81c1c0"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemImport::run_brew (cognitive 19): SystemImport::run_brew has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (7 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":"src/cli/system/import.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"769ac4874225f1a2e4464037bce9674c722901d6f011a92ee3170b7561b3684b"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksInfo::display (cognitive 19): TasksInfo::display has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, boolean chains 1, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/info.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ee3cad972d6391debb02506138d29210fbb4c80a236b4221821bb7b8077b21"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksValidate::validate_run_entries (cognitive 19): TasksValidate::validate_run_entries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), boolean chains 2, 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":"src/cli/tasks/validate.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18b976188fe9f0a6928ac956d5197358e72458e882dc0fc6531e86f76191826"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::load_tracked_config_files (cognitive 19): Config::load_tracked_config_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (7 pts), boolean chains 3, 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":"src/config/mod.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c294ade0f58afd55835259c861b691f8f383f2a0a1008954a4b33fdc98615ada"}},{"ruleId":"D2","level":"warning","message":{"text":"AsdfPlugin::ensure_installed (cognitive 19): AsdfPlugin::ensure_installed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/asdf_plugin.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e0ab32c17358fca8088865952027f5b2acfec5be3bc65ca245ee8883d9df68"}},{"ruleId":"D2","level":"warning","message":{"text":"ZigPlugin::download (cognitive 19): ZigPlugin::download has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/zig.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"74977a442d937816f8abdb32523fce8e9dc9784e3f57cf464277e41c03e678c7"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskContextBuilder::resolve_task_env_with_config (cognitive 19): TaskContextBuilder::resolve_task_env_with_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_context_builder.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"7083bfb1e2edc9c22342900d794dca900443af1254a93fe5ee96e6560f982830"}},{"ruleId":"D2","level":"warning","message":{"text":"KeepOrderState::insert_injected_tasks (cognitive 19): KeepOrderState::insert_injected_tasks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_output_handler.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bd81ac0043d57697f32f38bbefc69f91b7ed13eaaf8335d95862fa1274d050"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolsetBuilder::load_runtime_args (cognitive 19): ToolsetBuilder::load_runtime_args has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/builder.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ca3d3cd83d38c6d64d35ec637143915fe2f1381bf0ec36598145ce65919006"}},{"ruleId":"D2","level":"warning","message":{"text":"Toolset::list_outdated_versions_selecting (cognitive 19): Toolset::list_outdated_versions_selecting has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/mod.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"771a7ec9184c58474b53c6032b1961423337d78c2836b5aa90bcce128e0b4e88"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::asset_matcher::detect_platform_from_url (cognitive 19): mise::backend::asset_matcher::detect_platform_from_url has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/asset_matcher.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad8a7a4bf8d62c86c4d2a37687dd9c1c041067ddd6064fd637dbad63df3f31d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::version_list::eval_version_dates (cognitive 19): mise::backend::version_list::eval_version_dates has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (7 pts), match/switch 3 (6 pts), if/else 3 (5 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":"src/backend/version_list.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f508ef83ab27e0c75431c982f9aaa7de8552ae692d136a7fe4f8eeb96e8afc"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::config::explain::walk (cognitive 19): mise::cli::config::explain::walk has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 2 (7 pts), match/switch 1 (3 pts) (nesting depth added 13). 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":"src/cli/config/explain.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc3ff6f6dcde7e4a4053abd88a9ef24cf200716bf53ccf170d76b2ebdc9b5892"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::installs::migrate::attempt (cognitive 19): mise::cli::installs::migrate::attempt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/installs/migrate.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ee2ecaad055a65785bbb6296debb0c00669d29161b65a9705d44b94c6c5dde"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::ls::resolve_version_status (cognitive 19): mise::cli::ls::resolve_version_status has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (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":"src/cli/ls.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cd883e8c9deb4d63fe7aafc7fa6b03e65f06fccb9f4613cd674b80034cc747"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::config_file::is_trusted_without_config_paths (cognitive 19): mise::config::config_file::is_trusted_without_config_paths has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mod.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e249ff8c5349eeaf167d2327efe79f74f8f2103f9ccb1ff75ad66401b5fbdb"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::env_directive::venv::create_python_venv (cognitive 19): mise::config::env_directive::venv::create_python_venv has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/venv.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5713967b7574998c165ce2a3b6fefc944ecef6ff86ee789b9dd6fb7f4093059b"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::daemons::hook_env::emit (cognitive 19): mise::daemons::hook_env::emit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daemons/hook_env.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c586e80b7178eb20e89657c82bdb01a06380e7b283b615a7c47123341803057c"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::hook_env::compute_deactivated_path (cognitive 19): mise::hook_env::compute_deactivated_path has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 8 (9 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hook_env.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff44606f0c4ffb44944f0780b7afb16e3ff359836974ab9ecad5c215431c622"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::scan_mise_header_entries (cognitive 19): mise::task::scan_mise_header_entries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 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":"src/task/mod.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a3799c73cf904f67948a8b2c98834d24d3f03c8789e43540086ce95257faa8"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::tool_stub::has_http_backend_config (cognitive 19): mise::tool_stub::has_http_backend_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_stub.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd030148fe521f3ef2c0345958e677751f45b4ff58aa12391b47c81ba058d68"}},{"ruleId":"D2","level":"warning","message":{"text":"registry.data.loadAquaVerification (cognitive 19): registry.data.loadAquaVerification has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 2 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":"docs/registry.data.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ceb1220310b9ba39693ecc53f8ac545926f8e28f9d90057d3fcaba15edd810"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_quoted (cognitive 18): Parser::parse_quoted has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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":"crates/mise-dotenv/src/parse.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21c79d1fa06b99f6ddc95c8b3375c52286b1a3655b4ea813fe6a3e4aede2b16"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_lsp::tasks::key_occurrences (cognitive 18): mise_lsp::tasks::key_occurrences has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d174c6545dd98dcf41a5368418213fd37b047812f524219f16b1bc3570192317"}},{"ruleId":"D2","level":"warning","message":{"text":"FirewallRequest::validate_safety_with_rules (cognitive 18): FirewallRequest::validate_safety_with_rules has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/firewall.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c894909b940af1534d5c05e80e497ae99a2d12b65ae728fc0ce45991124474"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryRepo::visit_paths_in (cognitive 18): HistoryRepo::visit_paths_in has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a559d01bb650321024c07091e3cac5fdf9829be488c3ef8b255b81fe8841218"}},{"ruleId":"D2","level":"warning","message":{"text":"Applying::protect_replaced_files (cognitive 18): Applying::protect_replaced_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), boolean chains 3 (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":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fa4170dc114bc01e0892c93a0c8d8d9e604127524b7f401c06841f7aba0553"}},{"ruleId":"D2","level":"warning","message":{"text":"Applying::record_failure (cognitive 18): Applying::record_failure has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6a517160ee04ab023d61465f3998d3b1151417b9f3547c407323d63e8184ad"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::resolve_managers (cognitive 18): mise_system::resolve_managers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, match/switch 1 (2 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":"crates/mise-system/src/lib.rs"},"region":{"startLine":2495}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e55a54b97209358a847f63b7826deca474594647e6acaf7275c3f7af63da8f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::edits::edit_entry_from_toml (cognitive 18): mise_system::edits::edit_entry_from_toml has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 4, loops 2 (4 pts), match/switch 2 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/edits.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b796b92d659d383ffd0176514bc7b159e3497dff36bca8564395b3bbe232c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::confirmation_lines (cognitive 18): mise_system::files::confirmation_lines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":4303}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a662d185331579ce556ef66dd8f37436cc635575a6ae6263b3a60941135f26"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::legacy_owned_links (cognitive 18): mise_system::files::legacy_owned_links has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":5272}}}],"partialFingerprints":{"codehealthFindingId/v1":"953c6019cfc32a92a456226301be8232ce9203e2a0486ad0012db8042cff1bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::recovery::restore (cognitive 18): mise_system::history::recovery::restore has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 3 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/recovery.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cd6179b255a5d8d4215eac16fe92ddc11666745b9f4d5d66c30dac20049954"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::replay::directory_contents (cognitive 18): mise_system::history::replay::directory_contents has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29abacf7ea2143ba4e1273bffd9cebde13730a2de508d71a63c407d9148d337"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::reconcile::merge (cognitive 18): mise_system::history::sync::reconcile::merge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 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":"crates/mise-system/src/history/sync/reconcile.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb3fe28feeb8aef9f134bcaeb3c658818b954a7f91220778124a1d7b822d8e6"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::remote::finish_session (cognitive 18): mise_system::remote::finish_session has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (3 pts) (nesting depth added 11). 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":"crates/mise-system/src/remote.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"12896576795f7b4c65c7d3205f485186a79b7fd1b892fbeec05edeb5e6024f56"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::user_services::status_one (cognitive 18): mise_system::user_services::status_one has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/user_services.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"880694cbc7d0f3522a25a5a29dcd558b45b058acf16896677bcbab8c96324a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"DepsGraph::detect_and_block_cycles (cognitive 18): DepsGraph::detect_and_block_cycles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/deps_graph.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a78a6a9689b42c390499b87ceef8a42704a205eb1e7f542228fac6dbc89989a"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::args::first_non_global_arg_idx_with (cognitive 18): mise_util::args::first_non_global_arg_idx_with has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/args.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b1faad9eb32fe90b559e797cbdca7f727a31fae220a58df75b91a65781c71"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::semver::chunkify_version (cognitive 18): mise_util::semver::chunkify_version has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 6). Of this number, 11 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/semver.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeb7de7ce9bc7842d855981e2b7db167f1d962b3b5f55e32ed217bf75a4c5e1"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeBinstallMetadata::from_manifest (cognitive 18): NativeBinstallMetadata::from_manifest has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed1225eaedc2863bf7e7112f2927fc874cc17cede109a8866625521114ac190"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedGitBackend::download_verify_and_install_additional_asset (cognitive 18): UnifiedGitBackend::download_verify_and_install_additional_asset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4db9d866175edf784ac947996be483a588881b1883d8fce4abc9b9790de277"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapStatus::collect_dotfiles (cognitive 18): BootstrapStatus::collect_dotfiles has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 1 (2 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":4655}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04fad478b71a3476dd96fbec0be6b68e7824e05e146d075dfbb178f529e29ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Doctor::analyze_system_deps (cognitive 18): Doctor::analyze_system_deps has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/mod.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cfcc51a00c881c7ba2d862aa619bee52c107cee2fd2f45e2bf846986b717a1"}},{"ruleId":"D2","level":"warning","message":{"text":"DotfilesSave::save_shared (cognitive 18): DotfilesSave::save_shared has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/save.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a08d932c5c677c5baebb1dd412be5370317e3385d9856755ffbaac361655f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Install::hint_missing_system_packages (cognitive 18): Install::hint_missing_system_packages has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/install.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fda02e313f16f69cebd48c2b43a2572ddad1ab4bd30dac314d146ba702fa8b1"}},{"ruleId":"D2","level":"warning","message":{"text":"Install::install_missing_runtimes (cognitive 18): Install::install_missing_runtimes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/install.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4bbaac7f3b877b4bbd0d75713382aedc336d8207ea6618a5529041c4ca3c95b"}},{"ruleId":"D2","level":"warning","message":{"text":"InstallsMigrate::run (cognitive 18): InstallsMigrate::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/installs/migrate.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"dece64e58a1f1cdc22bc9645e8b2d28dfed4eaedc92dc27d2d303dea93a2fb16"}},{"ruleId":"D2","level":"warning","message":{"text":"Lock::compute_version_changes (cognitive 18): Lock::compute_version_changes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"904695f4f8dbf0b88c24877f94dda8edecf927499867b96b107a3f273a0e3c43"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksLs::run (cognitive 18): TasksLs::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6 (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":"src/cli/tasks/ls.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1bf27f72df500d843d898e7d8c844c114f2afa2a4f67b40404f5071d1d9982"}},{"ruleId":"D2","level":"warning","message":{"text":"Unuse::prune_scope (cognitive 18): Unuse::prune_scope has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/unuse.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03d0f2b8663e585986676e63ad9a73cf2ff92a5af937b5c71c3192c7da22cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"Use::render_success_message (cognitive 18): Use::render_success_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 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":"src/cli/use.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"34905906a8ff5fbc8c00ce837c036cfb04585e5c01a5ff59105210c0b6a5f1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvResults::module (cognitive 18): EnvResults::module has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/module.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d050ce4e977380788e3effa83a3d60db75ed3f480aa565cdcf7373363eba94"}},{"ruleId":"D2","level":"warning","message":{"text":"SidecarWrites::prepare (cognitive 18): SidecarWrites::prepare has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile/graph.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5d78d2930a656fcfa2cdf39cb13205bd765ee6351c00611357d0b21f758721"}},{"ruleId":"D2","level":"warning","message":{"text":"Task::render_runtime_templates_with_usage (cognitive 18): Task::render_runtime_templates_with_usage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7 (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":"src/task/mod.rs"},"region":{"startLine":2938}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2da9f8aba80e09d4506d72ba75ecfa6ed2e1308c966084d20af1a11e28f572"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskScriptParser::setup_tera_for_spec_parsing (cognitive 18): TaskScriptParser::setup_tera_for_spec_parsing has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5, boolean chains 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":"src/task/task_script_parser.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e4967a78c741302297f7d8ec0193bded7dffd61d2bbdd1a13caea7f3620d30"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkspaceProjectGraph::discover_all_with_overrides_inner (cognitive 18): WorkspaceProjectGraph::discover_all_with_overrides_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b70a8ad8b119a0463f436a1a7ad416ec7f061d95581faefc0fac7125442c48b"}},{"ruleId":"D2","level":"warning","message":{"text":"OutdatedInfo::resolve (cognitive 18): OutdatedInfo::resolve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/outdated_info.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"511564d0ac072464ac8964db19bf9462824a5faf220c9704bb9abd06e48b0b46"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::config::keys::candidates (cognitive 18): mise::cli::config::keys::candidates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4 (5 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/config/keys.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16d368e28c5c145130546360ac417048848fd66133f37f2fc5a006c42228ad9"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::daemons::split_args (cognitive 18): mise::cli::daemons::split_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/daemons.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e8cb2e52e9025aa7e1db143ad4a16885439bbf9d81107eee018dcf9f216b05"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::dotfiles::watch::supervise (cognitive 18): mise::cli::dotfiles::watch::supervise has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (3 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":"src/cli/dotfiles/watch.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac130e4dfb17d1659a3b444939624d903feb0eb5c75ed2834ef83849bbfae51c"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::load_config_tasks (cognitive 18): mise::config::load_config_tasks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":6786}}}],"partialFingerprints":{"codehealthFindingId/v1":"b212e3507c2f1f356a2b5b264ca7e735a4b076e853e9dd215533fdc88b17f878"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::load_tasks_from_configs_and_folders (cognitive 18): mise::config::load_tasks_from_configs_and_folders has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (7 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":"src/config/mod.rs"},"region":{"startLine":7611}}}],"partialFingerprints":{"codehealthFindingId/v1":"c057d99c732d57d189c58c74c9b0e2133ba001def1cb489d33f4851484baca84"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::miserc::check_tag_tokens (cognitive 18): mise::config::miserc::check_tag_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/miserc.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea6cb556160c60d41fc638e36f458e77ebb2dc69473e99066a6518665508dec"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::discover_monorepo_legacy_lockfile_paths (cognitive 18): mise::lockfile::discover_monorepo_legacy_lockfile_paths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (7 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":"src/lockfile.rs"},"region":{"startLine":3026}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a633cebececa735bff41c3ec39fb01da6c58e3967c3f93a5a265636b62f69d3"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::packslip::completion_sources_among (cognitive 18): mise::packslip::completion_sources_among has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, loops 5 (6 pts), if/else 2 (5 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packslip.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"352b513d484efa556ff262c6345ce1354204ca709b028831792e24ec0e998d15"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::plugins::core::rust::nightly_channel::clone_toolchain (cognitive 18): mise::plugins::core::rust::nightly_channel::clone_toolchain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 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":"src/plugins/core/rust/nightly_channel.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2c10551c51af945fed4f9ebfdcef97626f8ed83b187f457172260f67a57b52"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_source_checker::expand_glob_braces::expand (cognitive 18): mise::task::task_source_checker::expand_glob_braces::expand has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (mise::task::task_source_checker::expand_glob_braces::find_group) 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":"src/task/task_source_checker.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8e94e92757422d72318c6e0f70368940e89f407aa4b89100df95e4e357c514"}},{"ruleId":"D2","level":"warning","message":{"text":"Pty.wait (cognitive 18): Pty.wait has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, ternaries 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/record.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8318e8ec823549207f422d2b3d1b63b596b4776af25b9702b335484e6dcbf911"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_cache_core::blob_pack::decode_blob_pack (cognitive 17): mise_cache_core::blob_pack::decode_blob_pack has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-cache-core/src/blob_pack.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"84710024d6688016674764eeb4f99dac0482459abcccec47d56dff09f25a23c3"}},{"ruleId":"D2","level":"warning","message":{"text":"DaemonSet::with_dependencies (cognitive 17): DaemonSet::with_dependencies has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"58222d11cb5dd5837cacfc7259c2869fa4b567b2cb17e8999bce06a1dea0c049"}},{"ruleId":"D2","level":"warning","message":{"text":"TomlDocument::to_toml (cognitive 17): TomlDocument::to_toml has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/document/serialize.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14af401092f10335578be629603804e5d27646c193af8b937fc9d03a9b65d99"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveConfig::handle_picker_section_select (cognitive 17): InteractiveConfig::handle_picker_section_select has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (17 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/handlers/picker.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e19765cc0b33708bc4ae24dd49f92907cd972f56e447b09031843cd69695438"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractiveConfig::handle_version_select_key (cognitive 17): InteractiveConfig::handle_version_select_key has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/handlers/selection.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"476ece8a6476813693f7eec3d515844cb2e6c8c92a2d4aed40dc1f81d18a74cf"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryRepo::diff (cognitive 17): HistoryRepo::diff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fd7bac4c5a058052a3e159224e2237e94d816aa43eba8142b943029c307b36"}},{"ruleId":"D2","level":"warning","message":{"text":"Pull::pause_for_conflicts (cognitive 17): Pull::pause_for_conflicts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"47526b9cb33c0264d39f9048977bdf30d0dd2d21222dd0e96eb22b863906d458"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::dotfile_groups::remove_recorded (cognitive 17): mise_system::dotfile_groups::remove_recorded has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/dotfile_groups.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccab29ac2ffa286e2549906ddfbb9ff03a99499edc512cc2b696c37c9701898"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::legacy_stale_links (cognitive 17): mise_system::files::legacy_stale_links has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":3772}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c2c989770a759ccde50b9930183872b2c64f29f6f600bc044bbb56b26a3b20"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::files::print_diffs (cognitive 17): mise_system::files::print_diffs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (7 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":"crates/mise-system/src/files.rs"},"region":{"startLine":5726}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8c50a16ca2c6c222dbdd0f228c658afeeb52a4e3e1926defee78aef5423474"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::files::audit_history_cached (cognitive 17): mise_system::history::sync::files::audit_history_cached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, 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":"crates/mise-system/src/history/sync/files.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"83764cbd1466fcdd403f0cea6619c70883f069d558097bc1b215a85f127da933"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::files::re_encrypt (cognitive 17): mise_system::history::sync::files::re_encrypt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (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":"crates/mise-system/src/history/sync/files.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28098acde75eb2fef181ff1c35a55efeee706bcda74a628ee1636f598da1a05"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::publish::build (cognitive 17): mise_system::history::sync::publish::build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/publish.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb1a3eca7c29ebb8f7b1c0c36141d260e290e6fd7f2a3bf4a0bd1f6c1543a91"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::apt::parse_policy_origins (cognitive 17): mise_system_packages::apt::parse_policy_origins has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/apt.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb1e57056af2d0d0cd0b3818fc498b4e6015a0c2f5444fe03a49e588faca422"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::open_trusted_directory (cognitive 17): mise_system_packages::brew::cask::open_trusted_directory has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, match/switch 2 (5 pts), if/else 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":2910}}}],"partialFingerprints":{"codehealthFindingId/v1":"1847b61d94d48ff87a0da0698b3dde9d15895b4a1afdcd08f7528024745d247e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::env_diff::parse_export_p (cognitive 17): mise_util::env_diff::parse_export_p has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/env_diff.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec895378a64722005bd73d7c8346f5025b31666b395003f8c6e355253b7eebc"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::github::paginate_mirrored_releases (cognitive 17): mise_util::github::paginate_mirrored_releases has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/github.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34a5652aa6160d07d1cf7951e392ecadae58c531f6166d960bf729de0196177"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::gitlab::find_expired_glab_tokens (cognitive 17): mise_util::gitlab::find_expired_glab_tokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/gitlab.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"53aef1268ff3a294fbec59841471e33f1ff966a56efc267d8794ab440c2cf776"}},{"ruleId":"D2","level":"warning","message":{"text":"BackendArg::backend (cognitive 17): BackendArg::backend has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 1 (3 pts), match/switch 1 (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":"src/args/backend_arg.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"c779080048b5885f5b3424ef46d561562810e7bc5ae4fc066bf84c9e85151374"}},{"ruleId":"D2","level":"warning","message":{"text":"GoBackend::fetch_proxy_versions (cognitive 17): GoBackend::fetch_proxy_versions has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 3 (5 pts), loops 3 (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":"src/backend/go.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd77f3e171596608bf9bdac362efccee60c902a057cbd051b35d02d1ce8363de"}},{"ruleId":"D2","level":"warning","message":{"text":"NPMBackend::install_version_ (cognitive 17): NPMBackend::install_version_ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, match/switch 2 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/npm.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb26d9ede03ccd424fb6ee6757afc2c20c28da28dd5fe41cd16309e049018477"}},{"ruleId":"D2","level":"warning","message":{"text":"PIPXBackend::version_from_distribution_filename (cognitive 17): PIPXBackend::version_from_distribution_filename has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/pipx.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4777a0d0e2699ddc30cbedc4d70b52f8be5601248a7efb6ce23dc5f6ba6e6c96"}},{"ruleId":"D2","level":"warning","message":{"text":"DepsInstall::run (cognitive 17): DepsInstall::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/deps/install.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"476c76ed52f9e4266a3df86c6fdcb00d6e8209b69bf3893e3a6231d4296ec077"}},{"ruleId":"D2","level":"warning","message":{"text":"Doctor::analyze_backend_mismatches (cognitive 17): Doctor::analyze_backend_mismatches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/mod.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"22502d49eb0548902b752402805351d50228e6b60d3c9c8768afe1ae6a6b75a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Link::run (cognitive 17): Link::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/link.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c894fefbe30bde7b9f1c9c5eaf83132c6e738bd55d28092c4eef0d1ce3386440"}},{"ruleId":"D2","level":"warning","message":{"text":"Lock::run_with_installed (cognitive 17): Lock::run_with_installed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, 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":"src/cli/lock.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f04cdbd372e170e251c01d59fd71c245cc5be01f148564709e21248d1aa00c"}},{"ruleId":"D2","level":"warning","message":{"text":"Ls::display_user (cognitive 17): Ls::display_user has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ls.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa45d6c21e5ddbb6eff788ebec6c9dd242ba596cfbd6901be8c9e6b6feec7950"}},{"ruleId":"D2","level":"warning","message":{"text":"Run::run (cognitive 17): Run::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/oci/run.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfc1864674e5ba25187b4320048b3439edfe1975993eda2b82710c1d44579ce"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksValidate::output_human (cognitive 17): TasksValidate::output_human has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/validate.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41f7da707b6c441a2447283084e9463a2f612df38aff4ad797e6a371e2da006"}},{"ruleId":"D2","level":"warning","message":{"text":"Unuse::get_config_file (cognitive 17): Unuse::get_config_file has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/unuse.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d0f22474e549f422a32d861c9c02331528de81e7c5736e0a4adada1302c31b"}},{"ruleId":"D2","level":"warning","message":{"text":"Vars::run (cognitive 17): Vars::run has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), loops 3 (7 pts), if/else 1 (2 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":"src/cli/vars/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e3c3dea00311e4e7e6dcf48ebd5221cb73f214edbd5ec986eed083cab7a2b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::monorepo_path_aliases (cognitive 17): Config::monorepo_path_aliases has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"94efd92c10f3d5ea0557ab56cf726563c647e0c61595618e5ad4df887898c1de"}},{"ruleId":"D2","level":"warning","message":{"text":"SidecarWrites::collect_garbage (cognitive 17): SidecarWrites::collect_garbage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile/graph.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3dc3c53f6e063d1a424dac30692943edf78af6155fd73410e5bab6f6b0fdc58"}},{"ruleId":"D2","level":"warning","message":{"text":"NodePlugin::suggest_available_flavors (cognitive 17): NodePlugin::suggest_available_flavors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/node.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac9dde5e3a5a61beb7a9eecd6f041d5e0d5d93e64d746f0563f511dec080a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"SecretsToml::from_value (cognitive 17): SecretsToml::from_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 1 (4 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":"src/secrets/config.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c80ba0b62501c9cff4cd754048d6603f37eb965f115f97934ee77a3b790cc94"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvView::walk (cognitive 17): EnvView::walk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/grant.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7cc8db4d6dbca2036918c6f963a7644255cadc3655edad9f92d6b650a8900a"}},{"ruleId":"D2","level":"warning","message":{"text":"PackagePluginManager::apply_prune_plan (cognitive 17): PackagePluginManager::apply_prune_plan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/system/package_plugin.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0beafb98c101d54d57ce4d6806274a776b8d9192f1e8c115301f4a6d76f11f01"}},{"ruleId":"D2","level":"warning","message":{"text":"GoWorkspaceProvider::discover_with_context (cognitive 17): GoWorkspaceProvider::discover_with_context has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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":"src/task/workspace/go.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"9955ec816695b0174013c27ca19ee21fc98def51438938b17c99c609bcb09890"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::usage_error (cognitive 17): mise::cli::usage_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2a20004ee24aae0ed5f7b5a68f4feabaa1a05eac63d0eabaca2305cb1f9547"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::bin_paths::list_bins (cognitive 17): mise::cli::bin_paths::list_bins has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bin_paths.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c03190131219e72d23f36d7404115f5559e1ea2c2628672fa01e463f9141008"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::dotfiles::add::rollback_add (cognitive 17): mise::cli::dotfiles::add::rollback_add has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/add.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6482fc1d26917803725e19b23195ef79169a1b438d8dc0eefdc14e33e93af0"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::install_layout::snapshots::current (cognitive 17): mise::install_layout::snapshots::current has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (5 pts), match/switch 1 (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":"src/install_layout/snapshots.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9a780ecee4592865f0ae765fd82a4272715b4a4ae5b6ab3c42c9ed15b80e11"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::toolset::install_state::migrate_legacy_incomplete_markers (cognitive 17): mise::toolset::install_state::migrate_legacy_incomplete_markers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/install_state.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b955fbe998ef5d385f59f34b7092738a6ec90bb9ba773c474c0a821835d5073f"}},{"ruleId":"D2","level":"warning","message":{"text":"bed.analyse (cognitive 17): bed.analyse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2 (3 pts), ternaries 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":"docs/.vitepress/showreel-bed/bed.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"8368da149ef8159bbb4bc17d322b5e661ed34c82914c29395fa536664a48fe5d"}},{"ruleId":"D2","level":"warning","message":{"text":"frames.build (cognitive 17): frames.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), boolean chains 2, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/frames.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e02fde8e9266d6f0b71a7c2cbc5ccbb82149adff395da7d351d8447ea2a755f"}},{"ruleId":"D2","level":"warning","message":{"text":"Value::from (cognitive 16): Value::from has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a593c1d6de5b556afe83628008d1fa9cff5dba8a18bfc2a972b9ec2b5bd201c1"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_daemons::expand_group (cognitive 16): mise_daemons::expand_group has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 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":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7479133dab20b61a4c18b3e33e6c4e77b93f455ba007ac1e4991f1a3b7fd0f7"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_lsp::tasks::config_dir_files (cognitive 16): mise_lsp::tasks::config_dir_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c73a54f7a31d0a7c2e1cd6d27dcb5c0c018f1a62d36d4d161f7b1d3be6a9e3"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_oci::layer::build_layer_from_entries (cognitive 16): mise_oci::layer::build_layer_from_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-oci/src/layer.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"5467d05d6f9920da4712a7c4d08d09afa7bfd28a2c33529528b43fc668cedf6e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_oci::packages::materialize_diff (cognitive 16): mise_oci::packages::materialize_diff has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-oci/src/packages.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80b19ae07e364213b202e6215adf895d40a2918559a023931f7ba79e4a36890"}},{"ruleId":"D2","level":"warning","message":{"text":"UserRequest::from_toml (cognitive 16): UserRequest::from_toml has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/accounts.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de47c7a854e43f3aa5fa473799d80054fc4a3e68b22605fd104c03dd6f9f81b"}},{"ruleId":"D2","level":"warning","message":{"text":"Manifest::preserve_other_files (cognitive 16): Manifest::preserve_other_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/manifest.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e7ff7f7957128e0d45f9aab9d123657e8bf70c965a84991b2631297dab1664"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::login_items_from_config (cognitive 16): mise_system::login_items_from_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/lib.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"d712d820c1c71ee462a8a6c01699f548f7961dde3e57bf17bffc615ae82def99"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::firewall::validate_backend_request (cognitive 16): mise_system::firewall::validate_backend_request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, 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":"crates/mise-system/src/firewall.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6b734783073a68e9fa848a77a7a89bc632adb1b3f6d53583804a99c10697c6"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::sync::secrets::audit_unpublished (cognitive 16): mise_system::history::sync::secrets::audit_unpublished has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), match/switch 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":"crates/mise-system/src/history/sync/secrets.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"76194df7960b33a3615c7bb2193e68c3fcbfbb21c2ba2e1707ed037a7a64096f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::history::watch::runtime::install (cognitive 16): mise_system::history::watch::runtime::install has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5070ccb0b880101cedc04f37e77d7e7a6e37f7beafbf49e99b76804eff737e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::managed_files::validate_requests (cognitive 16): mise_system::managed_files::validate_requests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (5 pts), loops 4 (5 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fda47fa63d95d4f1c1ab9ef90ecda6653bb566aaa5dc7219a0e69fbaad4baf"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::remote::provision_mise (cognitive 16): mise_system::remote::provision_mise has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/remote.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f2d592dc66fa6fa6508f8f974b92a57b36af95835c14dbd09f35c2f145c9ab"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system::user_services::apply (cognitive 16): mise_system::user_services::apply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/user_services.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a392b4467bf5ab6dc358d8e8f5dba09788c77e3f426dd19d3f481ff8a37e96f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_system_packages::brew::cask::fetch::fetch_cask (cognitive 16): mise_system_packages::brew::cask::fetch::fetch_cask has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 3 (4 pts), boolean chains 3 (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":"crates/mise-system-packages/src/brew/cask/fetch.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e49bf635d1cab78d39c20607409b578a7eb34c548b9f6af843f4e221684c17"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::download_file_inner (cognitive 16): Client::download_file_inner has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e1028a7fc47db9c516c77f14b6540a3d3920ad627eaa58944e1b2d11bb265e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::env_diff::normalize_escape_sequences (cognitive 16): mise_util::env_diff::normalize_escape_sequences has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 5 (6 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/env_diff.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2888f0fb0aa1cafb1a6cb443523ec82d2b32231d5946e23bbccc5dcc4da910e"}},{"ruleId":"D2","level":"warning","message":{"text":"mise_util::github::oauth::token_async (cognitive 16): mise_util::github::oauth::token_async has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/github/oauth.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d53c27068dcb1135526e397c4c352c8349078613f36d2341539a1b8378a1ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"AquaBackend::resolve_validated_package (cognitive 16): AquaBackend::resolve_validated_package has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db3c1274198f96c30586c9759fe03baf2d6f6529c8e0fa7514d229f4b20d681"}},{"ruleId":"D2","level":"warning","message":{"text":"UnifiedGitBackend::try_verify_slsa (cognitive 16): UnifiedGitBackend::try_verify_slsa has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":3136}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2d0693fd7a53a1f294fd3a08566b74d554c185199f926d5d759bcde1d3927c"}},{"ruleId":"D2","level":"warning","message":{"text":"Bootstrap::run_with_notices (cognitive 16): Bootstrap::run_with_notices has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (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":"src/cli/bootstrap.rs"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f741238f2fb299e9116fd99a1022bfe52c1a80fe117bd13b16e83f0471925b"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapStatus::collect_plugin_deps (cognitive 16): BootstrapStatus::collect_plugin_deps has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":4435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4335bd97579ccaddf167dceef6b61f35e8bd16740eac588f243ac0d21571c39e"}},{"ruleId":"D2","level":"warning","message":{"text":"BootstrapShellStatus::run (cognitive 16): BootstrapShellStatus::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":6079}}}],"partialFingerprints":{"codehealthFindingId/v1":"087a111dcbaafe460b9e29de53930dcb595d5c6cdc4ef39970fa083204bc5c0a"}},{"ruleId":"D2","level":"warning","message":{"text":"HookEnv::display_status (cognitive 16): HookEnv::display_status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/hook_env.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f27c1f934e2197f0ded91a4988becde2ca0c5d04c7037af029f1afa394e310e"}},{"ruleId":"D2","level":"warning","message":{"text":"Lock::list_sidecars (cognitive 16): Lock::list_sidecars has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"315d5f6ffd214f1f79fbbddb99b50c6b53e4830714e1fe0253b0cebf8574ad85"}},{"ruleId":"D2","level":"warning","message":{"text":"Lock::bind_requests (cognitive 16): Lock::bind_requests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 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":"src/cli/lock.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaa5b7af2cd7c076bfc488a8bdb2dfad41ad1e8e1f33b4ef703ae3cf4333b4e"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksValidate::find_additional_graph_issues (cognitive 16): TasksValidate::find_additional_graph_issues has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/validate.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fee7d202086e3d030edf8cb8b37b96902ec6610c1b82f3014352d387e0939a"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksValidate::validate_directory (cognitive 16): TasksValidate::validate_directory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/validate.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"534365a3466dd7c16a7d3527dd1b3b7dd74851d851dfbe3c701f412716980c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparationBatch::finish (cognitive 16): PreparationBatch::finish has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 3 (6 pts), loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile/generate.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a730c3af7ca1335f4888e8553b0c6da6afd590fff00e04da6e96be11479e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Lockfile::cleanup_unreferenced_conda_packages (cognitive 16): Lockfile::cleanup_unreferenced_conda_packages has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 1 (4 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9a2f21f4b8fbb618757f47f4c89306ac1005611a8eaa620ba99d73ea85aac9"}},{"ruleId":"D2","level":"warning","message":{"text":"MemoValues::apply (cognitive 16): MemoValues::apply has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 1 (4 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/broker.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"486ef8a748d32e585a45963fa9e0f0a7757b2c6b114f55b97ec8dd8bbcef15fe"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskExecutor::check_confirmation (cognitive 16): TaskExecutor::check_confirmation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), match/switch 2 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec52f022fac2fd2136563df9294f43f2fff1e5468f3251d202f229504e3e6495"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::backend::npm::apply_aube_event (cognitive 16): mise::backend::npm::apply_aube_event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/npm.rs"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e998ce54b3ca60ff3b4b2f500ac33f0725f19040c0d61c1eb919a04a09daaf3"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::get_global_flags (cognitive 16): mise::cli::get_global_flags has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 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":"src/cli/mod.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda5ec5885bb9bcf21c10e97deb287d0c38ea35c9554f678b2d47d234db429d3"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::exec::warn_if_command_falls_back (cognitive 16): mise::cli::exec::warn_if_command_falls_back has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/exec.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8830ef99764e2f5b6caf9f31d00483c50f73833e5bbc281fd3f1e60a01f2f69d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::generate::task_stubs::validate_generated_stub_tree (cognitive 16): mise::cli::generate::task_stubs::validate_generated_stub_tree has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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":"src/cli/generate/task_stubs.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5c3a74d3a3b37299c39f00fb82f7d04de8af0581f891af4591d60a8642f061"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::plugins::install::install_plugin (cognitive 16): mise::cli::plugins::install::install_plugin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugins/install.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6caadcd5857676f498684e3eeb5f3b0c888c11b29954355132205a4e5bde40"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::cli::system::install::mutate_repos (cognitive 16): mise::cli::system::install::mutate_repos has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/install.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7fa317777150603548da58e3924113c4f29e81738f62170dfde39202987dd7"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::config::config_file::mise_toml::insert_core_options (cognitive 16): mise::config::config_file::mise_toml::insert_core_options has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 6, boolean chains 2 (nesting depth added 4). 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":"src/config/config_file/mise_toml.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"65273cc1776908d57e9973b56b1491f2d8a2126354a70f50f9f75a9de8272eb9"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::daemons::glue::install_scope (cognitive 16): mise::daemons::glue::install_scope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (7 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":"src/daemons/glue.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0cbef336ce9b82903f93f76e533aaf99e08b41992f692f3086c2f52bebec3d"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::install_layout::resolver::unlocked_choice (cognitive 16): mise::install_layout::resolver::unlocked_choice has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/install_layout/resolver.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b039ce9644fc16fbc0b48b26bd252f95b4ebe9827e85ef6020065b556d90fea"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::lockfile::resolve_tool_lock_info (cognitive 16): mise::lockfile::resolve_tool_lock_info has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (8 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":"src/lockfile.rs"},"region":{"startLine":4580}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3a9a5234b3ca8f5f3754f7df2184f9c6ed08f124e5477eeb2731426054eda2"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::plugins::git_plugin_drift (cognitive 16): mise::plugins::git_plugin_drift has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/mod.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"019049c5bebf0853a1ecebba7bc131b8fc2de774c6255fa75903777eb4fb8d57"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::shims::ensure_lazy_shims (cognitive 16): mise::shims::ensure_lazy_shims has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"48492628e45265e3ea0efbd964b999cc85a7ea208aa3afecce2c3827a70d6969"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_cache::task_cache_entries (cognitive 16): mise::task::task_cache::task_cache_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bcc06c9e95e9fdd9014548ebcf1170f68c5669124417761418447984f82f78"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_cache::clear_task_cache (cognitive 16): mise::task::task_cache::clear_task_cache has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0e6cd5a648b7cdede1a5cb673f81807df86c3dbc20189a2181d009f917511f"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::task_cache_audit::contains_unquoted_token (cognitive 16): mise::task::task_cache_audit::contains_unquoted_token has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (3 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":"src/task/task_cache_audit.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"693199c8a8149c16e186c6747a04a5c1f9383770f33a2b7187778b4552b85814"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::task::workspace::node::pnpm_affected_projects (cognitive 16): mise::task::workspace::node::pnpm_affected_projects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, 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":"src/task/workspace/node.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"480b6018e9a2a24144eaa389a9c41b7aa7dba752a4e382b4e85351b9c76e7055"}},{"ruleId":"D2","level":"warning","message":{"text":"mise::toolset::collect_needed_versions (cognitive 16): mise::toolset::collect_needed_versions has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/mod.rs"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea4caf0c483314edc0eb252624957149b452215339664f9931e8cc700f85bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"config-reference.data.referenceMarkdown (cognitive 16): config-reference.data.referenceMarkdown has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, loops 3, ternaries 3. Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 7 function items inside it that branch (details, entry, about, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/config-reference.data.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fffd32c456acdc8ecc91c296cdee47c550dbe267b54e3885e98426a00798dc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/mod.rs: FileTooLong \u2014 5262 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 204 free functions. The bar is 500 significant lines; this is 4762 over it, 10.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":"src/config/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a8540391995b66c7ece2f76bbcc00026b0ed8b20a8b88418fa8f3f06bc600e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/bootstrap.rs: FileTooLong \u2014 4210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 3710 over it, 8.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"409035be4291f7cb3b25c276d1ccd3b03afb9168da1eaee216c6b935a42bb570"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/files.rs: FileTooLong \u2014 4165 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 183 free functions. The bar is 500 significant lines; this is 3665 over it, 8.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"301d9a91ae4c14f9a75b18fc50537257bf325ef0bfc7d0e3b3f20e295ab9de33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lockfile.rs: FileTooLong \u2014 4086 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 114 free functions. The bar is 500 significant lines; this is 3586 over it, 8.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8363c49adcd06d987ff23a54465078d060996f3b26eebcf62200178d6df205b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/aqua.rs: FileTooLong \u2014 3342 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 79% of them inside a single declaration: AquaBackend (3 blocks, 49-4115), declaring 53 free functions. The bar is 500 significant lines; this is 2842 over it, 6.68\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":"src/backend/aqua.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"451a7afb56720d2813d7624915d3ccb55a8d32256a9c275c24c543426cdbe339"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AquaBackend: ClassTooLong \u2014 2627 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), 86 methods, 3 blocks, lines 49-4115. The bar is 400 significant lines; this is 2227 over it, 6.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecc99febe14695744ca615f896b911ac0433a70f7a89805d5fb8cfd0191ba0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/mod.rs: FileTooLong \u2014 3155 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 63% of them inside a single declaration: Backend (3060-6582), declaring 79 free functions. The bar is 500 significant lines; this is 2655 over it, 6.31\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":"src/backend/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99b0c96e0cd78190aafd308593cebd25c716f70da550e0dc3ad4f76b4c0124f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cask/mod.rs: FileTooLong \u2014 2994 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 128 free functions. The bar is 500 significant lines; this is 2494 over it, 5.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b282b53e127c059ec8bb040a82e5cddb3bde7bbaa78d2865e63baee58a724e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/mod.rs: FileTooLong \u2014 2657 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 47 free functions. The bar is 500 significant lines; this is 2157 over it, 5.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7529dca6cfb087eeded3cdbc7eb47e186f5fce555c1f92095aee65ad8de0be9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/http.rs: FileTooLong \u2014 2545 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 71 free functions. The bar is 500 significant lines; this is 2045 over it, 5.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9342b8a0a47e0817b95a82952d7011afaed4e16472d775484238445a70781443"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Backend: ClassTooLong \u2014 1998 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), 143 methods. The bar is 400 significant lines; this is 1598 over it, 5.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e747b58de724fca4e4ec2a1c264b2469427050c907bd0acb89e03bd1e9b2619"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bootstrap.run_phases: MethodTooLong \u2014 run_phases runs 468 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 368 over it, 4.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"b785e4c7f9d330c9324019e6c629d4030249501e43def52a35a1d1b0afebd069"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::files::merge_file_entry: FunctionTooLong \u2014 mise_system::files::merge_file_entry runs 459 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 359 over it, 4.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":"crates/mise-system/src/files.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a170734908694e1d3fa8924629abebbfbc31f20e44b1d6981261338a6a203c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UnifiedGitBackend: ClassTooLong \u2014 1758 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), 41 methods, 3 blocks, lines 31-3286. The bar is 400 significant lines; this is 1358 over it, 4.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ba6cb677b017d1c5f6f7fef23c601152133dc3d1a501a0a07d1681410a0841"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Lock: ClassTooLong \u2014 1753 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), 52 methods, 2 blocks, lines 189-3020. The bar is 400 significant lines; this is 1353 over it, 4.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"226e53d604a01942ba8f39d98b8936c5695192360756c781eb3d275878947a4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/task_executor.rs: FileTooLong \u2014 2185 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 1685 over it, 4.37\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":"src/task/task_executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b249ddb0bb68740e1668a7f32501154c832eae6ee07d7da69e3412dc5871c00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/github.rs: FileTooLong \u2014 2154 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: UnifiedGitBackend (3 blocks, 31-3286). The bar is 500 significant lines; this is 1654 over it, 4.31\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":"src/backend/github.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab984b9c1fcb57689579e32baf27d9ce89112bfa4adf92ed548784c29c3dbe5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::watch::runtime::run: FunctionTooLong \u2014 mise_system::history::watch::runtime::run runs 430 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 330 over it, 4.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":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bce2d5c3662c4ba64e5f884fc822f9aa34ab9b58ea84dcf0b5d488a1d273ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/file.rs: FileTooLong \u2014 2101 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 163 free functions. The bar is 500 significant lines; this is 1601 over it, 4.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d05ad84d7bb46e5a0ff45dbfeaeb8aad046865d939781f16ed58af0a2bbd829"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/lock.rs: FileTooLong \u2014 2077 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 84% of them inside a single declaration: Lock (2 blocks, 189-3020). The bar is 500 significant lines; this is 1577 over it, 4.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":"src/cli/lock.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4175e70bdfa4d6109717fe78316dcd0e131256bc9ba002df127e04059bf9d3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/managed_files.rs: FileTooLong \u2014 2071 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 71 free functions. The bar is 500 significant lines; this is 1571 over it, 4.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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d59b1c2cf7eb7fd83425d294b2c7d7219e6202c7929bd29b7f3f4d4effa9f88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.build: MethodTooLong \u2014 build runs 413 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 313 over it, 4.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":"src/oci/builder.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"2601bd31312fc52580f324867068be8095f62bbe2f2866eb7af18faba92d30ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.attempt_locked: MethodTooLong \u2014 attempt_locked runs 404 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 304 over it, 4.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":"crates/mise-system/src/history/checkpoint.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f219ad28bc12285acae5245ce524d4d3ceb9fbf1ebb48362717075fbb95474"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/npm.rs: FileTooLong \u2014 1981 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 61% of them inside a single declaration: NPMBackend (3 blocks, 266-2701), declaring 36 free functions. The bar is 500 significant lines; this is 1481 over it, 3.96\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":"src/backend/npm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa9992c7d4fa9f96712d19aae2b4f26c1391c302c1736e553c433fb9c015a251"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Upgrade.upgrade: MethodTooLong \u2014 upgrade runs 392 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 292 over it, 3.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/upgrade.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eac88cb39109c4512dd0c1a851a00208ad4a81d9f07b8164bf00375bed96c9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DotfilesAdd.run_inner: MethodTooLong \u2014 run_inner runs 387 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 287 over it, 3.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/add.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda578c31fda30a02631ca8777cc3e822359f3adf79b08d9858819120c82c0d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/packslip.rs: FileTooLong \u2014 1923 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 46 free functions. The bar is 500 significant lines; this is 1423 over it, 3.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":"src/backend/packslip.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1956e567e86b2e14d7c7be8e66fddbf92a97e44c8402779332ef9839823576c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EnvList.deserialize: MethodTooLong \u2014 deserialize runs 378 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 278 over it, 3.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/env.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e62aa593c63ada060489db0c1d12ccacb4bed3db0eed7337b0c608358d9c85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EnvResults.resolve_with_toolset: MethodTooLong \u2014 resolve_with_toolset runs 371 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 271 over it, 3.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":"src/config/env_directive/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9625c3a73a259c43fe8507c8d21dfcd987504f622a65c574c016c329dd684aa4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config_file/mise_toml.rs: FileTooLong \u2014 1826 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 1326 over it, 3.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":"src/config/config_file/mise_toml.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ba3eb9c64748398d2011f1d422819f3fa8ba0e9dfe970747ea896f25dd338c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Daemons.run: MethodTooLong \u2014 run runs 341 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 241 over it, 3.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/daemons.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2249626b4544b0923ba07cf7dcaffa01766769447cd7311558d06bb3560df19b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1692 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 75 free functions. The bar is 500 significant lines; this is 1192 over it, 3.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5804e51e4285cc742ac31055f27e3d580a3107fb7afdffaabe80440a90396ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cmd.rs: FileTooLong \u2014 1681 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: CmdLineRunner (4 blocks, 128-2578), declaring 35 free functions. The bar is 500 significant lines; this is 1181 over it, 3.36\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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25c1aec29b9fb615bb045e65466995b2de56cb8da1a5ce9b998a8f8b8ecae5f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Formula: TooManyMethods \u2014 99 methods. The bar is 30 methods; this is 69 over it, 3.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":"crates/mise-system-packages/src/brew/shim.rb"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cb33b5257b39c8820ae5d3bdd44efae666e819e1032632719eb4394ac4511c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.render_item: MethodTooLong \u2014 render_item runs 328 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 228 over it, 3.28\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":"crates/mise-interactive-config/src/render/item.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8d4aa4f7a01e62cb2c570d108d4325149fc6b8e90f346b49a39cd085fdd264"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Client: ClassTooLong \u2014 1303 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), 55 methods, 2 blocks, lines 850-2697. The bar is 400 significant lines; this is 903 over it, 3.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac583ea45e000497013a8712ac9cae3e1c6ca91207d5deeb4ea3f39281ef682"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DotfilesTrack.run: MethodTooLong \u2014 run runs 324 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 224 over it, 3.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/track.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f0859f54f72aa7877d57a28f6a19ffdd6103fb8ebbc45f17d63c28c94f6333"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrewCaskManager.install_one_with_ancestors: MethodTooLong \u2014 install_one_with_ancestors runs 323 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 223 over it, 3.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ab10dd7b96a8b74d9f8ea09dffaa3706a45c7e7953c2d38b5b364faaea1b41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_brew_metadata::cask::flight::step::parse_flight_step: FunctionTooLong \u2014 mise_brew_metadata::cask::flight::step::parse_flight_step runs 321 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 221 over it, 3.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-brew-metadata/src/cask/flight/step.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3eca2ae505c2effc57aed3aa7589f6d5cbc5963e2b329361b8c98eef306f4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Upgrade.run: MethodTooLong \u2014 run runs 321 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 221 over it, 3.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/upgrade.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4079aa1fe61edfbe5f1d405cad8d314f2f79a71ce6765a7ab3a133779effcaa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HistoryRepo: ClassTooLong \u2014 1274 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), 62 methods, 2 blocks, lines 111-2206. The bar is 400 significant lines; this is 874 over it, 3.19\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":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec2fa2d9f06ca7a8bd6f71e4a4916b65cbc0081a797a6d5a97cd11e81ee5412"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NPMBackend: ClassTooLong \u2014 1208 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), 53 methods, 3 blocks, lines 266-2701. The bar is 400 significant lines; this is 808 over it, 3.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/npm.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3324fe271191e2029753d49a103bb8c891cf1bae433e2d84c9cdd8b3b0fe2934"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tera.rs: FileTooLong \u2014 1491 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 75 free functions. The bar is 500 significant lines; this is 991 over it, 2.98\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":"crates/mise-util/src/tera.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acb5bf6b9666e5842e102f65fdab341ef95f72a954f678ecbd993ee684c2132"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/firewall.rs: FileTooLong \u2014 1445 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 74 free functions. The bar is 500 significant lines; this is 945 over it, 2.89\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":"crates/mise-system/src/firewall.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79171174a73f5b9c01fa6aa89d9f92c4031ca599d63eea26aaec8da5735399d6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AquaBackend: TooManyMethods \u2014 86 methods. The bar is 30 methods; this is 56 over it, 2.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacf0a98675a53767bf177c08167cf4c1fc000329d40aae3ee56ec8bed8b8b30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: history/shadow.rs: FileTooLong \u2014 1433 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 89% of them inside a single declaration: HistoryRepo (2 blocks, 111-2206). The bar is 500 significant lines; this is 933 over it, 2.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":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"229c421d7611c1050a6041848f30db72118977e3b851f3b73913e8112bd38d38"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: history/replay.rs: FileTooLong \u2014 1389 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 40 free functions. The bar is 500 significant lines; this is 889 over it, 2.78\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":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b9917b940ddfe0663b8addda3574c7c828135cd8fa407aa545efca3b1593bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shims.rs: FileTooLong \u2014 1387 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 71 free functions. The bar is 500 significant lines; this is 887 over it, 2.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"599eecf08af488285d80d7fd12ff8da8851d2693e3245ec4049cd8985745e1e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/github.rs: FileTooLong \u2014 1362 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 102 free functions. The bar is 500 significant lines; this is 862 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":"crates/mise-util/src/github.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df3b018445954840c0d2757ccbe561855c4a6f0aa3790c91042046c1bad51b2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CmdLineRunner: ClassTooLong \u2014 1080 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), 62 methods, 4 blocks, lines 128-2578. The bar is 400 significant lines; this is 680 over it, 2.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/cmd.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5c1246cae36def953b59844148821c5b46860fd236362f0695ee2d49b31fb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lock.get_tools_to_lock: MethodTooLong \u2014 get_tools_to_lock runs 268 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 168 over it, 2.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"065282f6d14f964e4d6273a311ca007b6958f993867629e3b1a42fc09263330c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: history/tracked.rs: FileTooLong \u2014 1335 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 51 free functions. The bar is 500 significant lines; this is 835 over it, 2.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9743087fb45999212c0b1362e18ccdb59ae087ca6703c96d31d9e1f542b1b852"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/registry.rs: FileTooLong \u2014 1324 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 824 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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca162173124f563d1ba8e230ce589139bde4c196cfbb3aa540c783fcabee8303"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cask/state.rs: FileTooLong \u2014 1309 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 87 free functions. The bar is 500 significant lines; this is 809 over it, 2.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd19e22f849075afbe2842636f64b924a96a2bc733111881b97ee176d1ec7a1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: 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":"src/config/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8be0051d8a3d1cb0d7e19fa54c2dc5212289eb356a9a018c4aae17a22fd57d9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Task: TooManyMethods \u2014 78 methods, declared across 2 files: task/mod.rs (75), task/task_template.rs (3). The bar is 30 methods; this is 48 over it, 2.60\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":"src/task/mod.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e492d5b7fbebb88226ff8390fe67de7c09314eb66597fd5ac88c75190cdca0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Toolset: TooManyMethods \u2014 78 methods, declared across 4 files: toolset/mod.rs (33), toolset/toolset_env.rs (21), toolset/toolset_install.rs (19), toolset/toolset_paths.rs (5). The bar is 30 methods; this is 48 over it, 2.60\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":"src/toolset/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c4d36fcd2d1a8d2170dff047b5c11aac742ed94303aefdf828661ef5906984"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PackslipBackend: ClassTooLong \u2014 1039 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, 4 blocks, lines 66-2953. The bar is 400 significant lines; this is 639 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":"src/backend/packslip.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c360bdcb1953844d7efdb80a3494cfe06d5d2be867d82214afac11a5d7ac5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: watch/runtime.rs: FileTooLong \u2014 1286 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 786 over it, 2.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f76e64720be999c58639669e775e8136ccdc7355f8bca86d7b970c535fbd05e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/packslip.rs: FileTooLong \u2014 1283 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 58 free functions. The bar is 500 significant lines; this is 783 over it, 2.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packslip.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4330ee73d544c6d402c0abbfab9560327b5d52a653848a4506f29e67a0d234c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/rust.rs: FileTooLong \u2014 1280 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 52 free functions. The bar is 500 significant lines; this is 780 over it, 2.56\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":"src/plugins/core/rust.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b60f2603810dbfd135ec63389109a767559f181f69b37a52f1c24e23056e24"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Backend.install_version: MethodTooLong \u2014 install_version runs 254 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 154 over it, 2.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"f580ee14f0a2ce5bb81fbc41460d0cfacf3a91e9c462600e12d4a88d47595838"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/task_cache.rs: FileTooLong \u2014 1267 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 33 free functions. The bar is 500 significant lines; this is 767 over it, 2.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"168446b84e230f472aadeb08aed3b29c625b54d41e9d75695d37988b902755d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: doctor/mod.rs: FileTooLong \u2014 1264 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 74% of them inside a single declaration: Doctor (2 blocks, 47-1562). The bar is 500 significant lines; this is 764 over it, 2.53\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":"src/cli/doctor/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21128baab929030b235d092be9e0d5513a1b6a186a883a3a61bdac5ed0b56630"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Upgrade: ClassTooLong \u2014 1003 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), 17 methods, 2 blocks, lines 65-1572. The bar is 400 significant lines; this is 603 over it, 2.51\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/upgrade.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7e9f80b8631ee12f80aaadbec9767b82ef31e143d0d11b0137e4b8a725be65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/settings.rs: FileTooLong \u2014 1244 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 44 free functions. The bar is 500 significant lines; this is 744 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a278458dddb3574277f91a696c1deac6cb19b8700b36dc83a42e72c95f1b757"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system_packages::brew::cask::flight::execute_flight_step: FunctionTooLong \u2014 mise_system_packages::brew::cask::flight::execute_flight_step runs 248 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 148 over it, 2.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":"crates/mise-system-packages/src/brew/cask/flight.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e7aa8028e5cca1582a53fb46fc4b6e921c452ccd15076c3ac25e53ba058a5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::unapply::plan: FunctionTooLong \u2014 mise_system::unapply::plan runs 245 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 145 over it, 2.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":"crates/mise-system/src/unapply.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"506f0225e7bd37d795bb8db9706c5f5fa67e1bad22c59ec952ec400258384c61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/pipx.rs: FileTooLong \u2014 1221 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 61% of them inside a single declaration: PIPXBackend (3 blocks, 91-1516). The bar is 500 significant lines; this is 721 over it, 2.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/pipx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"256473ff7f7171c6f1f89ad4ad8d632564225eed7129d6c4a3827317bad87d3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: install_layout/resolver.rs: FileTooLong \u2014 1213 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 89 free functions. The bar is 500 significant lines; this is 713 over it, 2.43\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":"src/install_layout/resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df379c32a1984226c10c0e85a2eaa4ab8b3d3d5096b205af653e0b0f2efdc36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/edits.rs: FileTooLong \u2014 1211 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 39 free functions. The bar is 500 significant lines; this is 711 over it, 2.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/edits.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c824dcffb7c83edf6476af11fefe806dcb6257a4146444b05d5290fb26f1ade7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: oci/builder.rs: FileTooLong \u2014 1210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 710 over it, 2.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oci/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec34a8989444828ab4d72c6abcf123ac15e28eaea1e1c2b3c1c02fdd6afd0c8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Task: TooManyFields \u2014 72 stored fields beside 78 methods. The bar is 30 stored fields; this is 42 over it, 2.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c723cfb44ac47a53be6023eadf660975e59115d6ee10a577bedd32aa583100f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/upgrade.rs: FileTooLong \u2014 1183 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 85% of them inside a single declaration: Upgrade (2 blocks, 65-1572). The bar is 500 significant lines; this is 683 over it, 2.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":"src/cli/upgrade.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e5aaa7165479a0d30c54f376b39193226498114bb8f0991b78ae4206864789"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Doctor: ClassTooLong \u2014 941 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), 31 methods, 2 blocks, lines 47-1562. The bar is 400 significant lines; this is 541 over it, 2.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":"src/cli/doctor/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"654c6fab2d8f59eb44cb5aa6e7a9985c6a647235bdefa9edd08d8a9df748e74d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::lockfile::update_lockfiles: FunctionTooLong \u2014 mise::lockfile::update_lockfiles runs 231 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 131 over it, 2.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":"src/lockfile.rs"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"138351966bbf898b0f63ea0ec65a543520dc31ce6241cc8a9fc37c81e48736f1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InteractiveConfig.handle_enter: MethodTooLong \u2014 handle_enter runs 229 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 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/actions/enter.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db5039e2b64101d83dd486725f2ea8207aee33b55b8755b3e02565d881cd65a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::resources::plan: FunctionTooLong \u2014 mise_system::resources::plan runs 229 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 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/resources.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d334d3e698682a05d9c5122c0958cd89fe8922626a28b9d47eb7b62b48e0c419"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PackslipBackend.install_payload: MethodTooLong \u2014 install_payload runs 229 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 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/packslip.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"28aac371d3428949b0ea3bce6a5544597a12b3654173798714d14a05ecbf9bd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/run.rs: FileTooLong \u2014 1130 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 73% of them inside a single declaration: Run (2 blocks, 101-1801). The bar is 500 significant lines; this is 630 over it, 2.26\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":"src/cli/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"235220bc8461cc678cf46a99f98ca517853dc9559774ffb67247cd034baa2c7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/static_helpers.rs: FileTooLong \u2014 1126 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 70 free functions. The bar is 500 significant lines; this is 626 over it, 2.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/static_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1a0680586763d7b93b7366bc88ea3f4311757fa71cf2d23a72e557a5200380"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sync/apply.rs: FileTooLong \u2014 1120 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 620 over it, 2.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f973d826da36712ef9adcf8034a7fc29b1e506708b55fe02660639c8ecab135"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Run.run: MethodTooLong \u2014 run runs 224 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 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/run.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"265080e01435e382a44b8e0a629d73a01f9cdcc6be6c6b20e553434328a94526"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DotfilesStatus.run: MethodTooLong \u2014 run runs 222 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 122 over it, 2.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":"src/cli/dotfiles/status.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8359adb4e8b0cd2492f52d6fec0d819f5511c05d7181a6862a3857cc970cf949"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::lockfile::generate::generate: FunctionTooLong \u2014 mise::lockfile::generate::generate runs 220 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 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile/generate.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3135be67f06897de2ba0cdec3c19f0ee4692f80f0fa3397c54c721fa6095d12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/http.rs: FileTooLong \u2014 1084 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 73% of them inside a single declaration: HttpBackend (3 blocks, 152-1737). The bar is 500 significant lines; this is 584 over it, 2.17\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":"src/backend/http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c56744650fbc22cbdf5a86459b839a49261c58c4553491fca7347cd0cf73c89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolset/tool_version.rs: FileTooLong \u2014 1082 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 79% of them inside a single declaration: ToolVersion (7 blocks, 43-1429). The bar is 500 significant lines; this is 582 over it, 2.16\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":"src/toolset/tool_version.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ea101ee64cb331c017b0a049de5ffc6ae2b7f00c34953d642b0797dd387932"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/python.rs: FileTooLong \u2014 1080 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 66% of them inside a single declaration: PythonPlugin (3 blocks, 59-1271). The bar is 500 significant lines; this is 580 over it, 2.16\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":"src/plugins/core/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5145f07d18abfe9d74dec99c19b60279b452179e0a047d7a26069d1bf389dc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolset/mod.rs: FileTooLong \u2014 1075 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 575 over it, 2.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9446c37aa327404c494fa6bc2d1199d8739ed9ff09ee5102738a3352093beadd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_daemons::load: FunctionTooLong \u2014 mise_daemons::load runs 215 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 115 over it, 2.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":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3269df8aa6491aa0bb0fe5cd669cab342c3a4e86f41f16ee9507d9c783fd4d34"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::backend::cargo::native_binstall::install: FunctionTooLong \u2014 mise::backend::cargo::native_binstall::install runs 214 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 114 over it, 2.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":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee4d0a769392009a6a8e45de2973085c8a89bf174d3619f43124f53dbb108c4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToolVersion: ClassTooLong \u2014 853 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), 46 methods, 7 blocks, lines 43-1429. The bar is 400 significant lines; this is 453 over it, 2.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_version.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b849e4f441604ab6ec1045d407c4516cf4fbb5482dfdc589fe45e55ffa4443b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: history/checkpoint.rs: FileTooLong \u2014 1054 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: Store (2 blocks, 104-1039). The bar is 500 significant lines; this is 554 over it, 2.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":"crates/mise-system/src/history/checkpoint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbdc18c63d51ddcdacf344c50cfac5b03f4274a0c1bbccbc0243caf9cbe0af7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: mise_config::schema::refs: TooManyFunctions \u2014 63 free functions. The bar is 30 free functions; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/schema.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84b8c1747e31876cc3a7bc80de0d138b9d2f85ce723bcc18daa7ab8fb7fa95f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolVersion.resolve_version: MethodTooLong \u2014 resolve_version runs 207 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 107 over it, 2.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":"src/toolset/tool_version.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"c072fa78f664a50021a5724e7e7914711b91c226e41f8e6c96360e7c0d3c26ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HistoryRepo: TooManyMethods \u2014 62 methods. The bar is 30 methods; this is 32 over it, 2.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":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c239dee872388471230ca2f6153e017adaeef58de365cd75712f65b766d37c98"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CmdLineRunner: TooManyMethods \u2014 62 methods, declared across 2 files: src/cmd.rs (60), cmd/bounded.rs (2). The bar is 30 methods; this is 32 over it, 2.07\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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb915432ad6654d8657098f9152c74e5496d2c84a8c38d1554f6048112aab92f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Run: ClassTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 2 blocks, lines 101-1801. The bar is 400 significant lines; this is 421 over it, 2.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/run.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c0983dee6ac15a2dccf23652b86686079ce85029a56baa421a299defc013b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \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). The bar is 500 significant lines; this is 521 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5225990873a9d023772978103740bc929c52bafe42716b8ca49ca20a2c11f76"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AquaBackend.resolve_lock_info: MethodTooLong \u2014 resolve_lock_info runs 203 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 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4ceb6e53c4bf5f53e02d8c5d49986ed7a30f4f24a9f2320759e82b03a901c8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Bootstrap: ClassTooLong \u2014 804 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), 14 methods, 3 blocks, lines 104-2846. The bar is 400 significant lines; this is 404 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":"src/cli/bootstrap.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bd7aca302a910e6ac36c49e9780d1dcd50c733a8d0eca8971ebf53a3160fb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/mod.rs: FileTooLong \u2014 998 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 498 over it, 2.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":"src/cli/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05982b2041f1d31233d2d17cc768a3ab7c9c62f35b4279cdc14a2050b645d7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolset/install_state.rs: FileTooLong \u2014 996 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 79 free functions. The bar is 500 significant lines; this is 496 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/install_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ad34ea27f79d549766a7074e8ce5da76fc6f6967340a11bad5bcfce912ca24"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HttpBackend: ClassTooLong \u2014 796 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), 33 methods, 3 blocks, lines 152-1737. The bar is 400 significant lines; this is 396 over it, 1.99\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/http.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb68571b591dae6ff4bfcbbfd55d65e453a7235703eebaf8d721f938a6ea8e98"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/node.rs: FileTooLong \u2014 988 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 79% of them inside a single declaration: NodePlugin (4 blocks, 33-1099). The bar is 500 significant lines; this is 488 over it, 1.98\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":"src/plugins/core/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"554b06b95f79775172aa790b54bcd2f56cd597442f1cfa8257b1e7fb4a2af042"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Client.download_file_attempt: MethodTooLong \u2014 download_file_attempt runs 195 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 95 over it, 1.95\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":"crates/mise-util/src/http.rs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb750ea7dc623f9ec50277a9a74b6769ac7c810a2f8062946a593490e99dd1f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NodePlugin: ClassTooLong \u2014 778 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, 4 blocks, lines 33-1099. The bar is 400 significant lines; this is 378 over it, 1.95\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/node.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e850572a0568b95a5f2ae472ce74385e69e24f8b268a002247f4e3b7f6e6e42"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BootstrapStatus: ClassTooLong \u2014 768 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 575-5183. The bar is 400 significant lines; this is 368 over it, 1.92\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1ea9d7c2527e91014b9bcf12e30ab560b806d6317fba8e1fe2b6673590497b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config_file/mod.rs: FileTooLong \u2014 958 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 63 free functions. The bar is 500 significant lines; this is 458 over it, 1.92\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":"src/config/config_file/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d275bd92a0cd477c8c3033b6e60e04dff762edff5d98de4cff856e962c2cadc3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Lockfile: ClassTooLong \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), 39 methods, 5 blocks, lines 349-5285. The bar is 400 significant lines; this is 360 over it, 1.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14bf2a6e93edb2112ab88cddc057a06beefad424838904cd5f7aae6b3a4a6f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::replay::apply_steps: FunctionTooLong \u2014 mise_system::history::replay::apply_steps 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":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a1519b6f3f229b0d3d6ae60d7f73f2782bb394799d90fbdf65fe954496aef7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DotfilesUntrack.run: MethodTooLong \u2014 run 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":"src/cli/dotfiles/untrack.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0cd13f459db67f38d488dc4ee123f9ea0376e0c7de7bc204f9d8785d1abfd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_brew_relocation::elf::patch: FunctionTooLong \u2014 mise_brew_relocation::elf::patch runs 188 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 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-brew-relocation/src/elf.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"927d5004fe8083dd01b5ac8e1b5cc20e4c6262244704c369b238693a2c086cba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrewManager.install_via_pour: MethodTooLong \u2014 install_via_pour runs 188 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 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"41777a5fe789fbab2bdfa6164f95c4ea3794fc9cf1cf2e53b6af1d4cc4edfc2f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PIPXBackend: ClassTooLong \u2014 748 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), 46 methods, 3 blocks, lines 91-1516. The bar is 400 significant lines; this is 348 over it, 1.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/pipx.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"0408e7032d9a59e83f145309af7b5d7ba35091e6f219c7edce2e411e052e7cbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/git.rs: FileTooLong \u2014 931 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 34 free functions. The bar is 500 significant lines; this is 431 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/git.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed46350ea37ddf6ff7180c313d3eafe08b8ac933ca7f1953bcd0bcb019ef3764"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskScriptParser.setup_tera_for_spec_parsing: MethodTooLong \u2014 setup_tera_for_spec_parsing runs 186 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 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_script_parser.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cd2242154e7559811b208f200653635572591b1fd2a3a9bae4ba7ffe626fdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/spm.rs: FileTooLong \u2014 917 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 417 over it, 1.83\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":"src/backend/spm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d356de53d4eecc47e0a1f3f4c35c94c275200dd02061edbd91cfa5a2a717d02a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Client: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"463c6a4dce9401adbd315f516f399bb85553e0dae60ab9cb9d557a2a72b05927"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/presets.rs: FileTooLong \u2014 914 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 38 free functions. The bar is 500 significant lines; this is 414 over it, 1.83\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":"crates/mise-daemons/src/presets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dd4f567087ff6a97661718eb3589c643992096c3ebcef67850ac77f996fc25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/remote.rs: FileTooLong \u2014 910 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 72 free functions. The bar is 500 significant lines; this is 410 over it, 1.82\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":"crates/mise-system/src/remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45615bd7b73e09dbc1814fa8af1548160318e848faf635c816f9ceca122ede2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/registry.rs: FileTooLong \u2014 907 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 31 free functions. The bar is 500 significant lines; this is 407 over it, 1.81\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe7f23a77d0ecbb83acc41b9dac343afce140d0a24cc7da29a8bada5f72d92d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.build_image_config: MethodTooLong \u2014 build_image_config 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":"src/oci/builder.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"9712fe9b106d6b191df2faf0dd87e20e57160eda9d47b02a52c083652af4ef1e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Vfox: TooManyMethods \u2014 54 methods, declared across 4 files: src/vfox.rs (19), vfox/install.rs (13), vfox/backend.rs (11), vfox/hooks.rs (11). The bar is 30 methods; this is 24 over it, 1.80\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":"crates/vfox/src/vfox.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2f201c6d76197ae9d5f009939ab81fb081e40635770a158ac5aab6456ea6d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Run: TooManyFields \u2014 54 stored fields beside 23 methods. The bar is 30 stored fields; this is 24 over it, 1.80\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/run.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c256e34bda1f312fc04532b069d80ae9b79cc4aec8840a3682ce6e119d14df6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cask/flight.rs: FileTooLong \u2014 900 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 400 over it, 1.80\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":"crates/mise-system-packages/src/brew/cask/flight.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d852fe3675f686864bfb8662f2affee8a7b2501f536d0137b9a699e8ec5039b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::files::validate_incoming_files: FunctionTooLong \u2014 mise_system::files::validate_incoming_files runs 180 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 80 over it, 1.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1a8c279de9088cf083ef1efb853e4eaa991f1cc5584113794f3fd1284386bb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PythonPlugin: ClassTooLong \u2014 717 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, 3 blocks, lines 59-1271. The bar is 400 significant lines; this is 317 over it, 1.79\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/python.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"233e42355f98bd83b5f6fb8e904a54d8c39cd68e92a250c6a612b9e8bb1de350"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Client.send_once_inner: MethodTooLong \u2014 send_once_inner runs 179 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 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b93f48ae46d305bf004c9193c4fbf6e2cad384e5ff42aa738362746d16e68d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HistoryRepo.read_meta_in: MethodTooLong \u2014 read_meta_in runs 178 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 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"532f6cb3ea5ba5c1f0dddad43381b18405d60cf54d5767a07ba23c66591d3048"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Toolset.install_all_versions_with_progress: MethodTooLong \u2014 install_all_versions_with_progress runs 178 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 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/toolset_install.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b0d500bf5032a62cae507c963f8bda8c5d6e273639fdcc6717022da9665033"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NPMBackend: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/npm.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade8991e18889b0e5732097f7e509712c0ae0fe4c69ecc46d312eeb5cd72a355"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DepsEngine: ClassTooLong \u2014 705 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), 18 methods, 2 blocks, lines 203-1313. The bar is 400 significant lines; this is 305 over it, 1.76\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c271ab1bee4d7a21ae0d632073a3d31841fa3ea124c3a3f32c59f838235a3fda"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Run.spawn_sched_job: MethodTooLong \u2014 spawn_sched_job runs 176 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 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/run.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a88773a663191353acf8af2c6140444ca27daac12bc9933100231cb4eb2d234"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/task_source_checker.rs: FileTooLong \u2014 875 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 46 free functions. The bar is 500 significant lines; this is 375 over it, 1.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":"src/task/task_source_checker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0362c931b5d58c2b03db99c22bfd114ad3f88b87929b2abac628677a9a8e07"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Exec.run_with_context: MethodTooLong \u2014 run_with_context runs 175 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 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/exec.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5deb01580963ce45dd52125393ce3a322bc4de2b94710c95488a5e5af8447633"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compose.rs: FileTooLong \u2014 870 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 31 free functions. The bar is 500 significant lines; this is 370 over it, 1.74\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":"crates/mise-system/src/compose.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff1b0d1a3b6de912c11d7e0b5552c5ebc6562f91a2302538e4f19ba9691e999"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CaskContext: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask_shim.rb"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"81be69fc49ea5cfd9a1d71cfac326138f517e9aad9898692cb96ba7b15eaba84"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lock: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a00db9a5e75a613b62e8a2579171cc77e6dbbb7f6653a90f7c2984455f5ced"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaskScriptParser: ClassTooLong \u2014 692 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 50-1088. The bar is 400 significant lines; this is 292 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_script_parser.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0ff168c0a277f33c954720cb46164594b3b2da91e1e041c14704e651526aa4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AquaBackend.verify_provenance: MethodTooLong \u2014 verify_provenance runs 173 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 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":3303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3812f68602e2c6ef6e9311d26f951e5392b63bdbd3ecd2cad4c7da33be73bc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MiseServer.read_resource: MethodTooLong \u2014 read_resource runs 173 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 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mcp.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fd3e3cb2c42c99d9b08cc6abbc3fc95baa1e72e423721254f7f89585cc1775"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CondaBackend: ClassTooLong \u2014 691 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), 34 methods, 3 blocks, lines 46-1249. The bar is 400 significant lines; this is 291 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/conda.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbfac0aea0aee31618cab44120be40757f41659c456c4df81f36268749d9507"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: secrets/grant.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). The bar is 500 significant lines; this is 356 over it, 1.71\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":"src/secrets/grant.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2666284fd3580d4db9b4af9c677c2659185e512fb36878a60a2d01a7073cbae3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens: FunctionTooLong \u2014 mise_system_packages::brew::cask::state::cask_prune_plan_from_tokens 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":"crates/mise-system-packages/src/brew/cask/state.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb1fb857cde93bc18de01a61db30ea74bdcb02cd8ad1ae187701c3bcd685013"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CmdLineRunner.execute_async_with_cancel_check: MethodTooLong \u2014 execute_async_with_cancel_check runs 170 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 70 over it, 1.70\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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9ebf4485ec14a10957bc4a2cfe612746ba3eb5f64c02e8d9f5ecef7e1a16d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: history/store.rs: FileTooLong \u2014 846 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 47 free functions. The bar is 500 significant lines; this is 346 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0105c910dc02b3901e1bb7781af8b22d780a3933867dc6876b622cf490d77b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sync/run.rs: FileTooLong \u2014 845 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 345 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0141731c483b6c06ea85b58b076668dd551ea6bf9fe88dc16d982da6c242dc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Store: ClassTooLong \u2014 670 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 104-1039. The bar is 400 significant lines; this is 270 over it, 1.68\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/checkpoint.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b802ee92eef947d4d8d0daa47fafd3c8ec0fc58d757d68346139ff82725cc81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: deps/engine.rs: FileTooLong \u2014 836 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 84% of them inside a single declaration: DepsEngine (2 blocks, 203-1313). The bar is 500 significant lines; this is 336 over it, 1.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":"src/deps/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9819f48a1c5439eddd6753114f473fd30149f1429414289db832830e8c7f89fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::sync::run::sync_locked: FunctionTooLong \u2014 mise_system::history::sync::run::sync_locked runs 167 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 67 over it, 1.67\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":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"46455d80eb9cdd6e2e88e02520ca4984e3a443417873018a8f348e33594c661e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/conda.rs: FileTooLong \u2014 834 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: CondaBackend (3 blocks, 46-1249). The bar is 500 significant lines; this is 334 over it, 1.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":"src/backend/conda.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e828f9615a2b981ab1f0356dd7cb5ad672d86e617ffd4fdd650e0fa41a355b4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolset/toolset_install.rs: FileTooLong \u2014 824 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 91% of them inside a single declaration: Toolset (33-1174). The bar is 500 significant lines; this is 324 over it, 1.65\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":"src/toolset/toolset_install.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6f8e75b9da54fac22ff287ce04f18b83fd08200eead3a3c12d7ff9d0181011"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::remote_repository::install_at: FunctionTooLong \u2014 mise_system::remote_repository::install_at 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":"crates/mise-system/src/remote_repository.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"464f53b644a3e1e9566b8f6e49e0ef6859b22eb4e9ec025da3d321b94c846f91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::lockfile::auto_lock_new_versions: FunctionTooLong \u2014 mise::lockfile::auto_lock_new_versions 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":"src/lockfile.rs"},"region":{"startLine":4212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8b6481c43786eef33b5ccfc27cdb71a888619d4c147658319f03d0e0f5e4d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: secrets/broker.rs: FileTooLong \u2014 812 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 312 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/broker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26465d8707d803ee2ffb8d09f901393ff6b3db97dbfbd634da96fd20fbe19433"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_daemons::build: FunctionTooLong \u2014 mise_daemons::build 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":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a53f67882ad13cf909456871a0ca0e5523561154d616fb1be5df7fea214af2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/github_relay.rs: FileTooLong \u2014 803 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 303 over it, 1.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/github_relay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"decf7515b992794a14ef4bd2bd507e441bd2d1fd775df1918f031ab8a0b22724"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VfoxBackend: ClassTooLong \u2014 641 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, 3 blocks, lines 43-1102. The bar is 400 significant lines; this is 241 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/vfox.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b6f8c281bc003a06b70c8e95fb900711f78a2eb7f0a681219ebfcb23aab3ff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Plugin: TooManyMethods \u2014 48 methods, declared across 18 files: src/plugin.rs (24), hooks/package.rs (4), hooks/pre_install.rs (4), hooks/available.rs (2), \u002B14 more file(s). The bar is 30 methods; this is 18 over it, 1.60\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":"crates/vfox/src/plugin.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"77496b4250484802e96e07230778beb40fc52fa304c0ddca9b4f246fb0daa1bb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RubyPlugin: TooManyMethods \u2014 48 methods, declared across 2 files: core/ruby.rs (32), core/ruby_lock.rs (16). The bar is 30 methods; this is 18 over it, 1.60\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":"src/plugins/core/ruby.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"09105c734c20f5db73c85500586f82b4e027b12e6af69ead98b96fcd0fe32f2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::replay::plan: FunctionTooLong \u2014 mise_system::history::replay::plan 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":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c12e0cb6ec51afb2a7b025b6062bdc8586d3e976bdfed1e9fe7935a0be0367e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/watch.rs: FileTooLong \u2014 792 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 292 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/watch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48434107422b142371bfceed5e42e9e67137aea434d88c3d90565d26213fd6f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dotfiles/track.rs: FileTooLong \u2014 786 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 286 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/track.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fbd2c25146ef5f6ee4f10594865b600d338d83782ff0e1e2ed1ebed9ba7715"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tasks.rs: FileTooLong \u2014 785 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 285 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4670754010a5626fbb7552504664beb8831d05da712e67447c3c9e911df4e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/workspace.rs: FileTooLong \u2014 785 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 285 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdb6b22f1c1624a7b1c431293bd177beb1b9a517a3966e519c47d118f41a4c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Watch.run: MethodTooLong \u2014 run runs 157 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 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/watch.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8b9f58acdf89adac3b66d439df04f98d3bd6269ce99dabd6ad0b754e9b08cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cargo/native_binstall.rs: FileTooLong \u2014 784 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 284 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f928315d8db6a61d283f0d4cc34eaea925a19050d3bea5fa8553d9fafb134068"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::driver::run_manager: FunctionTooLong \u2014 mise_system::driver::run_manager 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":"crates/mise-system/src/driver.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"04379b2a6818d8ffa51e36786c84877bd91007b70ac5a79e1a2d6201b949160a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Builder: ClassTooLong \u2014 616 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), 5 methods, 2 blocks, lines 135-1061. The bar is 400 significant lines; this is 216 over it, 1.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":"src/oci/builder.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8981e12446a1727e803dad563132d901a6ebdec734cb7796a143e721c789112e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BackendArg: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args/backend_arg.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"178ecfb05989b2dcbe561ab3f9bb30842d3e44c92e5fbb346757f9ade18284a5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PIPXBackend: TooManyMethods \u2014 46 methods, declared across 2 files: backend/pipx.rs (26), pipx/lock.rs (20). The bar is 30 methods; this is 16 over it, 1.53\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":"src/backend/pipx.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"4764948c5adda0b6726d6ca04950109e962578714c1afb54082393d173dc423d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ToolVersion: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_version.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb95af89a80afcef316caf933d39fedecfa0b644548f5f630dadafe60b1fdbac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Install.install_missing_runtimes: MethodTooLong \u2014 install_missing_runtimes runs 153 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 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/install.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"af878359169e06cea203a8a62da37e1c506b742ad0d8f138fe68b6ad33175b70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lockfile/generate.rs: FileTooLong \u2014 762 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 262 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":"src/lockfile/generate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce5e959ebbeed57ebba8717f4bf454ae6d1fedefb81f92b2c5ba35688d510ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DepsEngine.run: MethodTooLong \u2014 run runs 152 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce494c0eee73c5a3af89d36755c130ce9bfc2ad42a4f4729ad453b83e78efa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::packslip::fetch_files: FunctionTooLong \u2014 mise::packslip::fetch_files runs 152 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 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/packslip.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f9e1ea01f126928bbb2527130809f45b6b0e7aa67ae05108a4e36ca075a4f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/vfox.rs: FileTooLong \u2014 758 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 85% of them inside a single declaration: VfoxBackend (3 blocks, 43-1102). The bar is 500 significant lines; this is 258 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":"src/backend/vfox.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5bcfd13900fd7ea0ef8215ed3ec3a07b7683b729c934b48968617f03611b6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::lockfile::get_locked_version: FunctionTooLong \u2014 mise::lockfile::get_locked_version runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":5414}}}],"partialFingerprints":{"codehealthFindingId/v1":"186811d59ef2852ac4bf080e6cdbfea9239d16a152e77541ac7bcb8bdc4bfabd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: history/scope.rs: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 254 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/scope.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d97d5c12c772540b2184eb01d57ce4654887aa1626446c2d63f3b010191bb67"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: brew/shim.rb: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 252 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/shim.rb"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598e3619567dd44e750bfc446e5b9c66c28ecf13ad19b9346fcb6fcb6336eb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/task_script_parser.rs: FileTooLong \u2014 751 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 92% of them inside a single declaration: TaskScriptParser (2 blocks, 50-1088). The bar is 500 significant lines; this is 251 over it, 1.50\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":"src/task/task_script_parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c3a13106e7e08385f09fd6e5fcbb5280eadbf8f312c44c00d5ad7ad4678415"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dotfile_groups.rs: FileTooLong \u2014 750 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 31 free functions. The bar is 500 significant lines; this is 250 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/dotfile_groups.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab306157d779a9fa3d18413a9955a3b4df32d326a6005385cfbcb397c8d564f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/daemons.rs: FileTooLong \u2014 750 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 250 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/daemons.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f573f2ff9bc45bf087f5c4aa8f884b35120cd93921ab0e7908f5fdad686b5dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: showreel-bed/bed.py: FileTooLong \u2014 747 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 247 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-bed/bed.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c2d8a62b61c0200e130da1ab27b35019cb27f2250d5e092d41950ed95ec19f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/env.rs: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 66 free functions. The bar is 500 significant lines; this is 246 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/env.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25405abd1253de375aeab0a7c2e0edf1001e11336a53f7bda1a66a85e55c4e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/accounts.rs: FileTooLong \u2014 739 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 239 over it, 1.48\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":"crates/mise-system/src/accounts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c95834a52cfc2c406b51a690734091f5cfca310826bc4bc1777a49519acf90"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TasksValidate: ClassTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 2 blocks, lines 51-1012. The bar is 400 significant lines; this is 188 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/validate.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e685d65733314008d7de931c1750b9172e80e62a3cb5eba3094f8d92a73b5466"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/systemd.rs: FileTooLong \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), declaring 40 free functions. The bar is 500 significant lines; this is 235 over it, 1.47\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":"crates/mise-system/src/systemd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e016e3ff98ea565e7060aec408ea542a59ef560612b56e9a7ffc3a6b096582d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/exec.rs: FileTooLong \u2014 734 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 234 over it, 1.47\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":"src/cli/exec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27469bc325097fc273124bcb3878d14c406b6b1fa0dea16c6b3600aa8379a02"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ToolRequest: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_request.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"436626cb2c660a4dd0cbc4467f18e26bc86d17658001590643fb05f2f25e760d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: WatchexecArgs: TooManyFields \u2014 44 stored fields beside 1 method. The bar is 30 stored fields; this is 14 over it, 1.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/watch.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"76645018c4c8ddff45d9890637c5a736dd7b9586631d495cf86269609e1858f5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TaskDecl: TooManyFields \u2014 44 stored fields. The bar is 30 stored fields; this is 14 over it, 1.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/task/decl.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"608bbcd7de4125afe75a4efc851dbd1535625b95bcc6290902888143c7e840a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: env_directive/mod.rs: FileTooLong \u2014 731 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 73% of them inside a single declaration: EnvResults (3 blocks, 40-1137). The bar is 500 significant lines; this is 231 over it, 1.46\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":"src/config/env_directive/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b091c8242b8569ed5e1962f6dd684cb222e14e130d8c9dcaea012030ec5868"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layer.rs: FileTooLong \u2014 727 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 33 free functions. The bar is 500 significant lines; this is 227 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-oci/src/layer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33653d1b829462e064b1e23a9f08c82b5268dcf15a2fdf576933a9cc0a33b3ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::sync::onboard::run: FunctionTooLong \u2014 mise_system::history::sync::onboard::run 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":"crates/mise-system/src/history/sync/onboard.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"80725da39738c2276d5856840f16107f24f74479610a3214d8fbc374e765042e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HookEnv.run: MethodTooLong \u2014 run 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":"src/cli/hook_env.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a428f481a1b7e24f5c75e30b8dd425709afde28ce7cf7cfd18847677c6542b31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::system_install::apply_for_owner: FunctionTooLong \u2014 mise::system_install::apply_for_owner 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":"src/system_install.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebf4ae9aedd92ccd25ec3a9fe0f869719ee1a38c5ef1b907167bd0f3f2013c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UvWorkspaceProvider.discover_with_context: MethodTooLong \u2014 discover_with_context 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":"src/task/workspace/uv.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"450d5ddfa53224040a962704453987860624d0b0ff1cd113320e0c2d3a20b87f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: github/oauth.rs: FileTooLong \u2014 723 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 223 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/github/oauth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f3997308b8dc6e0834cbf242c334349619515cf9d65ee97c6b983db62b27b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolset/tool_request.rs: FileTooLong \u2014 719 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 73% of them inside a single declaration: ToolRequest (3 blocks, 44-1204). The bar is 500 significant lines; this is 219 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_request.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9145a497e69b9c7bb1f229e604ec08f24edc22cd5c20ec521bd4ae7e763ef950"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/asset_matcher.rs: FileTooLong \u2014 718 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 218 over it, 1.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":"src/backend/asset_matcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1d6c0952415533cd7c38d7053501c184776146ed0cad3e8e2e4c0fe2019f5e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MiseToml: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mise_toml.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcfa9592eb37b705b0fa8cd0333221ffd332edcc6e13b6f8fcc2fb68fecfc61"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskExecutor: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d002a9b7d9f463ee66802a6e60332198bfda56e66a98387cdadabdc36aad9c41"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SystemdRequest: TooManyFields \u2014 43 stored fields beside 2 methods. The bar is 30 stored fields; this is 13 over it, 1.43\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/systemd.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a04f315135ff903afc6458755d2c25e19a226cd93b4edacff5462e8f05e3cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AquaBackend.verify_provenance_at_lock_time: MethodTooLong \u2014 verify_provenance_at_lock_time 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":"src/backend/aqua.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"3237fe4fd3e3cab998e0f9a1af722b06b4037d42af7b016ebe2ecd74790cda3d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Toolset: ClassTooLong \u2014 568 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, 4 blocks, lines 94-948. The bar is 400 significant lines; this is 168 over it, 1.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6149c4048883844dba6609c32a9a6229f3128bb097176245c971e5a25fc31d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InteractiveConfig.apply_new_key: MethodTooLong \u2014 apply_new_key runs 142 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 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/actions/edit.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f9b0a6db2390d74c9afabfc6957dbcce1fbeb6aee233a05bcad21925fe45f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HistoryRepo.capture_tracked_files: MethodTooLong \u2014 capture_tracked_files runs 142 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 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb0e686b3faf05d180554bd6f79da9e67a22cee28067d58a4998a06a20abce2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::cli::exec::exec_program: FunctionTooLong \u2014 mise::cli::exec::exec_program runs 142 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 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/exec.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef7acdd9fb197bfb94f3b4e415a43a4f2ff207884dd50e799aefccde7910a34"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RubyPlugin: ClassTooLong \u2014 564 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), 48 methods, 3 blocks, lines 77-932. The bar is 400 significant lines; this is 164 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":"src/plugins/core/ruby.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6549b333ed87fd5c790758df92e0a434f0cc97a670c0f8f17f98d92cd08a1df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnifiedGitBackend.verify_provenance_at_lock_time: MethodTooLong \u2014 verify_provenance_at_lock_time runs 141 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 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":1557}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4853350b273e0959f45e577e96477602c2c492b7c3fbc91c51d7150aa2dc0c0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MiseToml: TooManyFields \u2014 42 stored fields beside 43 methods. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mise_toml.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1dd658b588e369da951604e55dec2d05e0b2bf42494e1b58fb383b12c1f915"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lockfile.prepare_write: MethodTooLong \u2014 prepare_write runs 140 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 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23b1665fbed1276ca99c68a992e67ff6d4fd33678247e3924b03316b0a7c91d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskContextBuilder.resolve_task_env_with_config: MethodTooLong \u2014 resolve_task_env_with_config runs 140 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 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_context_builder.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"3139516c0c0bbd174db3538bebbcf60331bc93ea5622d2e1b9548efb679791a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AquaBackend.install_version_: MethodTooLong \u2014 install_version_ runs 139 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 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bd32499ef7584c7a83ec8f424fa774befe44b5cc9a52d8a9e1c19f18f23cbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Doctor.doctor_json: MethodTooLong \u2014 doctor_json runs 139 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 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba449e8eaf0ccaf74f5b2776850feb8b6fd0b4ccc9399a21011ddc26ac5ae83"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Install.install_runtimes: MethodTooLong \u2014 install_runtimes runs 138 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 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/install.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8673b2e53e3f047186f35dd1b82ae67ae7501f4a84341947bb08a853069a36b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskArtifactCacheBuilder.finish: MethodTooLong \u2014 finish runs 138 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 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ecc15dddae9ee257053a0c1733d0cc182e663ac84844a7b077002a53ff0b84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/erlang.rs: FileTooLong \u2014 688 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 79% of them inside a single declaration: ErlangPlugin (3 blocks, 36-804). The bar is 500 significant lines; this is 188 over it, 1.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/erlang.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd4dc9d2d1a4fe8e815ae42a99d341d075417404228070445197a95ee4ef7c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: task/task_cache_store.rs: FileTooLong \u2014 686 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 186 over it, 1.37\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":"src/task/task_cache_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca08a19694d0dca18b6d3ddbb6958994a6fd3992a9d3e68ea445bfe861dd244"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system_packages::brew::resolve::resolve_closure_pairs: FunctionTooLong \u2014 mise_system_packages::brew::resolve::resolve_closure_pairs runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/resolve.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"15763529c4d581abfd534de0ad71921a242231cbc2737cb6b93c17b27f38183d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DepsEngine.run_with_deps: MethodTooLong \u2014 run_with_deps runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/engine.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ef20c7a42307b7994ee3b7578dad623aff21a687753f75365c6962b8685240"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: UnifiedGitBackend: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc05edc1e52a264ee2f40692b8c6b56718cac60d95635ec441fd5582e2e0972f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: github/sigstore.rs: FileTooLong \u2014 682 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 38 free functions. The bar is 500 significant lines; this is 182 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/github/sigstore.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec3af5c3adec4b86be8b2a9531c5d06b29b760782c825b4a12afe1d108be735"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tasks/validate.rs: FileTooLong \u2014 680 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: TasksValidate (2 blocks, 51-1012). The bar is 500 significant lines; this is 180 over it, 1.36\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":"src/cli/tasks/validate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e43f7d8e652a076c780fce4d234a4edd98ae8131ae60283ebe69a883be2e453"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ErlangPlugin: 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), 27 methods, 3 blocks, lines 36-804. 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":"src/plugins/core/erlang.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"004807f8027f982457aaecb4b699bf3bc63aeda822e877001e201d6663d98345"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::purge::purge: FunctionTooLong \u2014 mise_system::history::purge::purge runs 135 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 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/purge.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"734b51f6715030599cecc595dd5101557fb28c73f6da4a6ed4b7126bc2126655"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::tracked::walk_entry: FunctionTooLong \u2014 mise_system::history::tracked::walk_entry runs 135 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 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8d6f70a36d3507af8aabb5e984469c32ac5f0ead7c72eddde4ce8b9a9748b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NPMBackend.install_version_: MethodTooLong \u2014 install_version_ runs 135 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 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/npm.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f456b3892ca84cbd4c3e6b2f61a7e462a118bbc67d2feac412d4f89b12fe93f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Use.run: MethodTooLong \u2014 run runs 135 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 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/use.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92e0d58a65a4ab0c3ab529c23f965c24c7f524509b319fec892c0f6e62261bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: args/backend_arg.rs: FileTooLong \u2014 671 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 77% of them inside a single declaration: BackendArg (11 blocks, 100-1132). The bar is 500 significant lines; this is 171 over it, 1.34\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":"src/args/backend_arg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51d76b79270f4d146e6f7aebaddfc3d7254b0f7d42b5e2be0a5430053979843"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dotfiles/add.rs: FileTooLong \u2014 671 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 65% of them inside a single declaration: DotfilesAdd (2 blocks, 55-682). The bar is 500 significant lines; this is 171 over it, 1.34\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":"src/cli/dotfiles/add.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fc94bbc4cb2d737c29744695c62d02efb8012028a82b2c13f163b06a40f9a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_daemons::presets::expand: FunctionTooLong \u2014 mise_daemons::presets::expand 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":"crates/mise-daemons/src/presets.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"9621223be9896f75d62593a706c2458791961cd2909f6c5fc7ba824a58ce2855"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_oci::registry::push_image: FunctionTooLong \u2014 mise_oci::registry::push_image 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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"515592b812d81a69af497cd4f520c328888cd7e92f62203ad18e4b095acddad3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::sync::run::apply_resolutions: FunctionTooLong \u2014 mise_system::history::sync::run::apply_resolutions 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":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcf0668070b1d8be044e10ee2531dd8afda5a75ca371c27d0056ea9bd546d9f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CmdLineRunner.execute_hashes_async_with_drain_timeout: MethodTooLong \u2014 execute_hashes_async_with_drain_timeout 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa8ac26cb894cfa40cad95fee3ab5be3ef99cfa6aff5bfc7ab78c8135021819"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Cli.run_inner: MethodTooLong \u2014 run_inner 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":"src/cli/mod.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"20702a0b46561ff4dfb1ed4696a7a736b3936bee79d69254c15ff53d46ad778d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EnvResults: ClassTooLong \u2014 535 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), 17 methods, 3 blocks, lines 40-1137. The bar is 400 significant lines; this is 135 over it, 1.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f1ee47ebdefd90c6a91db46e0f530197e6565a20b93676f4c3210c54c34e4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/java.rs: FileTooLong \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), about 69% of them inside a single declaration: JavaPlugin (3 blocks, 44-732). The bar is 500 significant lines; this is 168 over it, 1.34\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":"src/plugins/core/java.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f354fe47d12a3df72555b0d7df79308283d01239584292ce5116972c09b28ce9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AquaPackage: TooManyMethods \u2014 40 methods, declared across 3 files: types/package_assets.rs (24), types/package.rs (11), types/package_filter.rs (5). The bar is 30 methods; this is 10 over it, 1.33\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":"crates/aqua-registry/src/types.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a3813b75a68f71a8309c21098a241c54a30e4e2bd86c1efe744f07ef9ea87b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InteractiveConfig: TooManyMethods \u2014 40 methods, declared across 8 files: editor/mod.rs (14), editor/handlers.rs (7), handlers/picker.rs (6), editor/actions.rs (5), \u002B4 more file(s). The bar is 30 methods; this is 10 over it, 1.33\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":"crates/mise-interactive-config/src/editor/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72d2ca224ea7c218ca26e8c9addd3af4f72f1bc902b1cee1ae384e22b677e61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/self_update.rs: FileTooLong \u2014 666 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 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/self_update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35a2133f696dcfcbd78942d1d9c1211f944c1b47d4b1a7ab017508dd8a0693e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Deps.new_with_cycle_limit: MethodTooLong \u2014 new_with_cycle_limit runs 133 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 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/deps.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df9225eab494fffdfe2a04de0fdf14051e8f8c97d6f10e8f8517160895d1aa5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToolRequest: ClassTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 3 blocks, lines 44-1204. The bar is 400 significant lines; this is 128 over it, 1.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_request.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"10898287abde594fdbe3ab20913b25e663630e65f34e88b8d04e2e6a6b9a5cc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::files::execute_apply: FunctionTooLong \u2014 mise_system::files::execute_apply 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":"crates/mise-system/src/files.rs"},"region":{"startLine":4396}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc61435455039e15f5b995ddda766bbdcf314326dc0e5ad7eebf336200d5076"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Lockfile: 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":"src/lockfile.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2fdd9855bff226be5036f506c4517a3df618d8a96f39d06bfc51e30eaa891e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/versions_host.rs: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 41 free functions. The bar is 500 significant lines; this is 150 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/versions_host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d865bd4123ef2073b9085cb4ac2dcba5bf03bce9e964c5059b851f49861ef2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SystemdTomlConfig: TooManyFields \u2014 39 stored fields. The bar is 30 stored fields; this is 9 over it, 1.30\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/systemd.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"9859d286d050a114e2e863cdfb23377504406d10b90d2f1fb83e0f4fc413e648"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BackendArg: ClassTooLong \u2014 519 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), 46 methods, 11 blocks, lines 100-1132. The bar is 400 significant lines; this is 119 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":"src/args/backend_arg.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd4257a8f5da8d37a81712ac59414766bd3a653aa683bc56b53ea2014bfa220"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RustPlugin: ClassTooLong \u2014 518 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 27-1064. The bar is 400 significant lines; this is 118 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":"src/plugins/core/rust.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b823b9cb37c5eaab43e2d9b0d97a799d4f4120f4e8e5b55cd523ce6897b0335"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime.rs: FileTooLong \u2014 646 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 146 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c881860967660afbafe27963b3660919b4a9bf839df512ef792e70f4d74ee995"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::files::apply_one: FunctionTooLong \u2014 mise_system::files::apply_one runs 129 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 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":5931}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a474486f134976448a104afaebe3cf22aace57978d9b84226a891f06d30067"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::sync::reconcile::reconcile: FunctionTooLong \u2014 mise_system::history::sync::reconcile::reconcile runs 129 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 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/reconcile.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2809795f342eec0a418c943f18bb31295bcce67a32444599827222fd9e7290"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComposeRequest: ClassTooLong \u2014 515 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), 31 methods, 2 blocks, lines 20-907. The bar is 400 significant lines; this is 115 over it, 1.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":"crates/mise-system/src/compose.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd74dffa581086881636a598fdac1bdd0fe8ae8671243797b8b2085c6b494ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::packages_from_specs_with_config_files: FunctionTooLong \u2014 mise_system::packages_from_specs_with_config_files runs 128 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 28 over it, 1.28\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":"crates/mise-system/src/lib.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c127668c3bc8837e131440f609a1bf8d8f6497f0051ac5010c6af870c8c67f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PIPXBackend.install_version_: MethodTooLong \u2014 install_version_ runs 128 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 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/pipx.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b2cff7d2a62e27d11eabc6ffa05d9196d139e6729426ee848053753d108150"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PlatformInfo.try_from: MethodTooLong \u2014 try_from runs 128 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 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dc79d8a64c5f6327f973517080a35e28e10c382e8e5fc70cf4257fd442da95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Toolset.install_with_deps: MethodTooLong \u2014 install_with_deps runs 128 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 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/toolset_install.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"835246caeb5287e3407420c1447ff5a8b197662f5736498f814fe7791ab39fcc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipx/lock.rs: FileTooLong \u2014 638 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 78% of them inside a single declaration: PIPXBackend (50-724). The bar is 500 significant lines; this is 138 over it, 1.28\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":"src/backend/pipx/lock.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e92a8ef0349a9a5b2e2d5a1735b683e4438a9018d289bf9127893a6d30ff8a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CmdLineRunner.execute: MethodTooLong \u2014 execute 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"221d63de12962b586a706cd17cffe94739e4c4b4ecc07000d950afa1c491d5db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::packslip::stub: FunctionTooLong \u2014 mise::packslip::stub 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":"src/packslip.rs"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b413a93d948cc48bd915cf8f72683af05a7bef42bcf750ab691af0f869ee62c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pull.record_resolutions: MethodTooLong \u2014 record_resolutions runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"767f517c4776f4cee0aafd0c2d59d6ba512a14771914936910d1052d6f47e5de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BackendsSwitch.switch: MethodTooLong \u2014 switch runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/backends/switch.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe276c3abc90de8b163ee6822c6fbc569fbd6219e9f8bde7672182859e221e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: toolset/tool_version_options.rs: FileTooLong \u2014 629 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 129 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_version_options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0c39a60e350359948ae27253884b043485571d5d19788c49ed74cc5414ca5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::package_requests_from_config_files: FunctionTooLong \u2014 mise_system::package_requests_from_config_files 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":"crates/mise-system/src/lib.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63d8538bd06df6ced3014d306d6d2b8fd10475e42213a73d274d36eebfb3c6d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Install: ClassTooLong \u2014 498 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), 13 methods, 2 blocks, lines 61-806. The bar is 400 significant lines; this is 98 over it, 1.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/install.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1184b058d9317280e527c16d8b6a87c2e761974e9cdc040232ed904499820770"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pusher.upload_blob_once: MethodTooLong \u2014 upload_blob_once runs 124 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 24 over it, 1.24\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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9714978ff70286c3ca08aa6b167009d4be5e3a82179a273502b1c28c070760"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/ruby.rs: FileTooLong \u2014 618 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 91% of them inside a single declaration: RubyPlugin (3 blocks, 77-932). The bar is 500 significant lines; this is 118 over it, 1.24\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":"src/plugins/core/ruby.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3617ec77c9430edefe34159b6da2f53d3bfb5741aecd7fcb344e4a9722107408"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MiseTomlDecl: TooManyFields \u2014 37 stored fields. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/mise_toml.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6293066c6cec7cb90015b6e47a6d4d50e512ce934ed536a45724186c6b018a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigSet.run: MethodTooLong \u2014 run 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":"src/cli/config/set.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2a0a1fedde457ee0c521984591699f5d1f8abac6bec00782b8ebb2df9005a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parse.rs: FileTooLong \u2014 612 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: Parser (2 blocks, 195-850). The bar is 500 significant lines; this is 112 over it, 1.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-dotenv/src/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c1950d30ef4e284cf5dfc32876269ef634e0d455b51d1fb610e8895d9be807"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BrewCaskManager: ClassTooLong \u2014 488 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), 6 methods, 4 blocks, lines 70-1311. The bar is 400 significant lines; this is 88 over it, 1.22\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":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b8be5ea579aa7d3747cd753b01544b95b680f655fc752da9bbd7817f5279ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::dotfile_groups::group_entry: FunctionTooLong \u2014 mise_system::dotfile_groups::group_entry 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":"crates/mise-system/src/dotfile_groups.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba9fa9f4a8959280ea06a51e697308e2e3aab5662ab622027e849bedf5fc11f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/packages.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), declaring 37 free functions. 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":"crates/mise-oci/src/packages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b42de7e1d8d3bc9d670a8836e02556447bdc4ef42a094233201d2d106e19fd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generate/tool_stub.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), about 79% of them inside a single declaration: ToolStub (2 blocks, 63-941). The bar is 500 significant lines; this is 106 over it, 1.21\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":"src/cli/generate/tool_stub.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe529b085be40472c640e14efa97462efa98d4115c1adf0ccbc16174d422155c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::sync::apply::apply_locked_with_scope: FunctionTooLong \u2014 mise_system::history::sync::apply::apply_locked_with_scope runs 121 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 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39e31c590dadf0dbc1d55dee581c767501f7217e0f2d288bf03b674b88977f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SystemdRequest.from_toml: MethodTooLong \u2014 from_toml runs 121 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 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/systemd.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6caa4df15e4fce2f5c913262281c7b9c0774b08c47f8ed06e3c9c4eaded883d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Client.download_file_inner: MethodTooLong \u2014 download_file_inner runs 121 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 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"7619e61590df736c3fb85a4408320c7bbd473eab89217deea456f82ce82e22d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::tool_purgatory::auto_prune: FunctionTooLong \u2014 mise::tool_purgatory::auto_prune runs 121 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 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_purgatory.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59ae7ffd42855afb90c899e5339d560fd54e04e6e135b15c0f34294079679c1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AquaPackage: TooManyFields \u2014 36 stored fields beside 40 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/aqua-registry/src/types.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e463ac1f4c038d968317c74b296dc3424381ed62f3ddabf802e443b9b4e921d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ssh.run_inner: MethodTooLong \u2014 run_inner 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":"src/cli/ssh.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"272d680aa3d455d3bb124c0b6f161e945e546fef1268079b2dd9947343e9223e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TaskTemplate: TooManyFields \u2014 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/task/decl.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a532129a03fa8436bdcab2d147d89a15df875d759d6892af7c2d5aaa05f1ae8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToolStub: ClassTooLong \u2014 478 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), 15 methods, 2 blocks, lines 63-941. The bar is 400 significant lines; this is 78 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/generate/tool_stub.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8087d6d13b51b778ab9c45ad95336c6e86a56a5262bc4ef646e8af0c78c2bbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/env.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 65% of them inside a single declaration: EnvList (3 blocks, 37-857). 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":"crates/mise-config/src/env.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0a1c05db71a58643295b8bbaee890202dbe1caa43d8d739ecc4e11f908e1d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::files::expand_request: FunctionTooLong \u2014 mise_system::files::expand_request runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd8c605d8661242c169c781a1096f226a635b2271ec2372c19030294cb4002a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::replay::rollback: FunctionTooLong \u2014 mise_system::history::replay::rollback runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e607142a71cc12a2b67d90bde9d6f760d52f1b41bd626709dea09dd488bbddb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::sync::origin::set_inner: FunctionTooLong \u2014 mise_system::history::sync::origin::set_inner runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/origin.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f331bfc0e7386bad9d01ecf3cfa91aba525e6de4af3ae99736366334a8950e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hook_env.rs: FileTooLong \u2014 594 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 34 free functions. The bar is 500 significant lines; this is 94 over it, 1.19\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":"src/hook_env.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9200913e0b010664e3bb74d8fd10ab38b3301490b2013c5f361477f1ef4852dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: backend/go.rs: FileTooLong \u2014 592 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 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/go.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04d3ed66697b19cfca9a1fd73b93fe513bdb7fc88a111f780022fc4094456a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/ls.rs: FileTooLong \u2014 592 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 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0083316dd3638685cbdc447bf77c7050ddb23c85b9294f9d0961eaec81b6c696"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::history::sync::run::prepare: FunctionTooLong \u2014 mise_system::history::sync::run::prepare runs 118 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 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd8a19fe9af7586c27c6806beae8ece344690627a9c19e1f1683d665a7d8566"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Doctor.check_dotfiles: MethodTooLong \u2014 check_dotfiles runs 118 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 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/mod.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca11e276eeec8b92d1d8d3f2e09e7e637a88b3db91271596030d86806fd3848"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Tool.output_user: MethodTooLong \u2014 output_user runs 118 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 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tool.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc5c4e2be81d127c8868621fd5fef7aea0cb5b060a1b7ecf8b4cce27c5d710b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PythonPlugin.install_precompiled: MethodTooLong \u2014 install_precompiled runs 118 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 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/python.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bace8a157fe192ae415b2f9e9559d8bdbe89c3c9e05ed9b3912c1d827640ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HistoryShow.run: MethodTooLong \u2014 run 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":"src/cli/dotfiles/history/show.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8bd664a902f5fc054e4230444d470d4e18eef02e434aaec44e6e5c621e8428"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NodeWorkspaceProvider.discover_with_context: MethodTooLong \u2014 discover_with_context 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":"src/task/workspace/node.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfa01c0efac97a32f7bf71b5258aae59cd7ea122b71df768fee378f86893e0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BootstrapRemote: TooManyFields \u2014 35 stored fields beside 1 method. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd16c2307d7833a924863021bf7b556977302b45c4f5c93df26693e98acfed5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: showreel-capture/record.py: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/showreel-capture/record.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"903776ae479c6711c5f3ef484b2de70ab1a47b30b9854be15269c0fca7d5182d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/server.rs: FileTooLong \u2014 581 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 73% of them inside a single declaration: Server (2 blocks, 70-713). The bar is 500 significant lines; this is 81 over it, 1.16\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":"crates/mise-lsp/src/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a6749c5b0b27e8605aa1297c8671f9d0d7da48ff4c80a7761164e377946cff"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JavaPlugin: ClassTooLong \u2014 464 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, 3 blocks, lines 44-732. The bar is 400 significant lines; this is 64 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/java.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"254a1a835fe1ab6e0b01db3fb0c32b5fdcb9861c3d65ed3cff06c170519ab9e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SystemStatus.run: MethodTooLong \u2014 run runs 116 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/status.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c443db5b90d00bd1f5af6c92a61cfef4b14e549c920e9129a3926a694c7d9cfa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lockfile.set_platform_info: MethodTooLong \u2014 set_platform_info runs 116 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dbe4c67161595a5fa808c1f99465997e509bf5176c907ef2087807dfd0ede1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CargoWorkspaceProvider.discover_with_context: MethodTooLong \u2014 discover_with_context runs 116 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 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/cargo.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a1647cdcbbb92c5b3dd5a8aabfdac3321b337167565d932d55f4fc8e845e1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hooks.rs: FileTooLong \u2014 574 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 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa3ee203957c82039b409e94e917224549333b43dd2d574f9595f2a900ef334"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::edits::apply: FunctionTooLong \u2014 mise_system::edits::apply 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":"crates/mise-system/src/edits.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"d109ed3035b7bf0c107c534cc6c33957ff7535ce8b52b41f6ec2fe81595dce5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::cli::generate::install_script::windows_script: FunctionTooLong \u2014 mise::cli::generate::install_script::windows_script 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":"src/cli/generate/install_script.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a91edfe6b52fd3811ceae1f638a1d68c1a6150a410fe1b3a73c9f2a761737db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: brew/pour.rs: FileTooLong \u2014 569 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 31 free functions. The bar is 500 significant lines; this is 69 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":"crates/mise-system-packages/src/brew/pour.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31380b16a7cd77e89615b9aa50d8a7556be40fdff238d763403fc1503ccf4e45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/install.rs: FileTooLong \u2014 569 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: Install (2 blocks, 61-806). The bar is 500 significant lines; this is 69 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/install.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"162408446971f65c7171df7748e8151a78a964ac5781dec444edcfedb7a686e5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CondaBackend: 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":"src/backend/conda.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0accd0ba59e95e90762acf1b2317b83240a775f995263ffa498f4efbedce6d0f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AquaBackend.run_cosign_check: MethodTooLong \u2014 run_cosign_check 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":"src/backend/aqua.rs"},"region":{"startLine":2321}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cf6642fb02d00e4bcdbd5d7297aab8822f48a6eac0d97f29a23816e0f099dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskScriptParser.register_task_source_files_function: MethodTooLong \u2014 register_task_source_files_function 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":"src/task/task_script_parser.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54659d62b831a8751898a250f99f7db77b6df5aa3111620d083fcdb878af539"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DotfilesTrack: ClassTooLong \u2014 451 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 66-782. The bar is 400 significant lines; this is 51 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":"src/cli/dotfiles/track.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e421dbacc3f2b53ec1465a480f7a0ae20e2197de6245e3928cda80993b3b05"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Project.check: MethodTooLong \u2014 check runs 112 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 12 over it, 1.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":"src/cli/doctor/project.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8fadcc3e00c002178bae245919dd2e53d88de8fd768a921cd1b4053ef14ecb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lockfile.read: MethodTooLong \u2014 read runs 112 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 12 over it, 1.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":"src/lockfile.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca03a98f75c8974b1654f4c0af936e5ca2aeaf8d74cbd5ab5594f0d710f9954"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/text_install_progress.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). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-ui/src/text_install_progress.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12281d02da41856698af08c814248d620b990de47b36d1442ae400e59355b213"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InteractiveConfig.undo: MethodTooLong \u2014 undo runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/actions/undo.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5220c229d5c1ea53731296704668841887d0cf77cd13f81501f1698639c496"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_util::github_relay::unix::session: FunctionTooLong \u2014 mise_util::github_relay::unix::session runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/github_relay.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"074ff6a512dd5785af754af2edba542dc627c17dd4ac733b7a63946cc2e7ffb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HookEnv.build_path_operations: MethodTooLong \u2014 build_path_operations runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/hook_env.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cf89de6685225751dc6717f3567723a828395f9426c3e02cfed7ee780cf6bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HttpBackend: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/http.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f8cd551747d7019ead180be40ce5868195ffd060198c8683bb7ef4cb58ab17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Catalog: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/install_layout/catalog.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3849579737da8769f9af3f9a6d4f291f1bfeb7363fb0473d63e3baf7b5b43293"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::remote::run_staged: FunctionTooLong \u2014 mise_system::remote::run_staged runs 110 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 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/remote.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72135592cb84c2ee3cf773178ca02136ec5b41166002b6e97ee6333a34d2b74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TasksAdd.run: MethodTooLong \u2014 run runs 110 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 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/add.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"f726d45944302dcaa3e40ed08e13b33456f84b9c794a5238c0d5f2e4b54c2cdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/repos.rs: FileTooLong \u2014 549 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 46 free functions. The bar is 500 significant lines; this is 49 over it, 1.10\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":"crates/mise-system/src/repos.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66400f08ac51670cbfe23d117ed94bf555e7c806c5e58e7e19e418f70dde3994"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/user_services.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). The bar is 500 significant lines; this is 48 over it, 1.10\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":"crates/mise-system/src/user_services.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a5fb1d2c62b6c8f1b8bae988f87177bf6add49e051766e578bc24f00d1abb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::merge_dock_defaults: FunctionTooLong \u2014 mise_system::merge_dock_defaults 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":"crates/mise-system/src/lib.rs"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4fdc2ab296af9e3b62c5112c0e83b74ec00b1a8cca4315ba670e440e271c20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BootstrapRemote.run: MethodTooLong \u2014 run 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":"src/cli/bootstrap.rs"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9087e0e54e56554d7275e575dceda08c1b91189f804841053f882dd93c21054"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Manifest: ClassTooLong \u2014 435 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), 22 methods, 3 blocks, lines 42-700. The bar is 400 significant lines; this is 35 over it, 1.09\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":"crates/mise-system/src/history/manifest.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b9268b9de9152126299afe2b39e7664b6adecf5d639584329f2a439193c325"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 434 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), 22 methods, 2 blocks, lines 195-850. The bar is 400 significant lines; this is 34 over it, 1.09\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":"crates/mise-dotenv/src/parse.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"33890d82c5c3627dfabb89529c4f5050d4bb437278cac032f525e3adf121da1b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaskContextBuilder: ClassTooLong \u2014 434 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), 13 methods, 4 blocks, lines 50-699. The bar is 400 significant lines; this is 34 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_context_builder.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc236582dcc26ad6e566eb29ab73dffffd87b0520ccf9d626b9826de4d7467d1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DotfilesAdd: ClassTooLong \u2014 433 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 55-682. The bar is 400 significant lines; this is 33 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/add.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf646e291410e8fb7974993793b615c27ed9b65c1522d74bf1f59cb23d3cfd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::managed_files::apply_with_accounts: FunctionTooLong \u2014 mise_system::managed_files::apply_with_accounts 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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec0e5d4ef65c13801ede5bc2d7709ebd9a0dc247053482d5993b183968f4b4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::cli::exec::exec_program: FunctionTooLong \u2014 mise::cli::exec::exec_program 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":"src/cli/exec.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b9d162b00cb239fdcb2179872efb6f6dc1c40c7516ca654140f8ee62bd715b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WatchexecArgs.watchexec_args: MethodTooLong \u2014 watchexec_args 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":"src/cli/watch.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7d26d82303d7f012618e3743f2d042d31a889b7a2986951966f10ac49384e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::files::plan_apply_with_active: FunctionTooLong \u2014 mise_system::files::plan_apply_with_active 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":"crates/mise-system/src/files.rs"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3cc36ad4416e6cd4edb8cdc5c4f7acc5f2e8a8936abdd2aa8548e9a37a14e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolStub.generate_stub: MethodTooLong \u2014 generate_stub 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":"src/cli/generate/tool_stub.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7b34f3c67de63354d75021ef294497c8f5059209feae9de8c6629e9e938ae3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::daemons::tasks::start: FunctionTooLong \u2014 mise::daemons::tasks::start 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":"src/daemons/tasks.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"db18dfff6265561966e3d7f35dc13bc6ea40277a72a46f81d2845d717e73046c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::task::task_cache_store::archive_to_cas: FunctionTooLong \u2014 mise::task::task_cache_store::archive_to_cas 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":"src/task/task_cache_store.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4495f1776f4d338b1f3f733ba025c3a810048bdf7abf7c923279ed5960d416"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/apt_sources.rs: FileTooLong \u2014 534 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 34 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/apt_sources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e13c4c78060608ec15b0130a313b791492964fe132249e2d98f549a2268374"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodePlugin: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/node.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b00c03cdbfb48ab8efd84337ebbf6c2e41fd8dd6952970ac9ed42c8623a485f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system_packages::apt_sources::apply: FunctionTooLong \u2014 mise_system_packages::apt_sources::apply 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":"crates/mise-system-packages/src/apt_sources.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6341b422cb2bcd4a40b171226950965204e5d0555a7ae8d86c72d7d966bdfab"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Manifest.merge: MethodTooLong \u2014 merge 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":"crates/mise-system/src/history/manifest.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e21a8ca92349f51f894ce4f052162fe29f3ecaecc310ca51a140d7b6b2c5fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::sops::decrypt: FunctionTooLong \u2014 mise::sops::decrypt 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":"src/sops.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"57279cf11b6d84b0535930a48d81adc7a0163eac52d75b15f80244f90bb9c311"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::task::task_list::get_task_lists: FunctionTooLong \u2014 mise::task::task_list::get_task_lists 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":"src/task/task_list.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"5370f0959be9b919003bbaea90f419fe9c03380db7b26b0dee5ae32266efc906"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Server: ClassTooLong \u2014 423 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), 22 methods, 2 blocks, lines 70-713. The bar is 400 significant lines; this is 23 over it, 1.06\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":"crates/mise-lsp/src/server.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0c6ca7ffe1e47459cd8f452c5fe47e57b47b7ea63b2ec409c39333afb022eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::dotfile_groups::expand_group: FunctionTooLong \u2014 mise_system::dotfile_groups::expand_group 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":"crates/mise-system/src/dotfile_groups.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32eb4be7d79fd36f3e7ad68a499302c31c99348838e827c3d425e476ae7e669"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UbiBackend._list_remote_versions: MethodTooLong \u2014 _list_remote_versions 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":"src/backend/ubi.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"782ed1d79de3c42ec6bb4d5ae472a962498a3a3b24bd8c8a03cea4b9b4f361f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::lockfile::merge_tool_entries: FunctionTooLong \u2014 mise::lockfile::merge_tool_entries 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":"src/lockfile.rs"},"region":{"startLine":4838}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3adec3b0d5c9f46e42275fe2b137abbd0301ca29c52b7fa9037920db6420a7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/swift.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/swift.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ce5b81084f9c7e9afda95101319c627aae4f73774ac120df8b5f9875aebbc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/services.rs: FileTooLong \u2014 521 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 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/services.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc1929352dfbcad8c30926b539a54b145b56f61b79d22a65fc59cb39ebb14b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::backend::static_helpers::install_artifact: FunctionTooLong \u2014 mise::backend::static_helpers::install_artifact runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/static_helpers.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0848c7686e448dc4ed3c85df415336e71f7d9e12e5933cae0d9fd01af0322b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise::cli::installs::migrate::recover_interrupted: FunctionTooLong \u2014 mise::cli::installs::migrate::recover_interrupted runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/installs/migrate.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"13798f97f7119536bb19ad5ae5b828c483b6d69910a43537b699a0f63fd3b8b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Uninstall.run: MethodTooLong \u2014 run runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"84de51304f627fcb335c4ebb12ca728a5c2af07c6931c682554c3bcc1f792560"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/mod.rs: FileTooLong \u2014 518 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 18 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae485247ea71997a69ae85a3587fd3ae8cafedfb6ab96594cceeb790834515f9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ComposeRequest: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/compose.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aee755f644474f0522dcb2aca40c8198f06f7fff8593a15c653b6d329798285"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Git: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/git.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cf40771505d82cf3f2e135b02b9efb89be491e29cbdc0a8c476d724335ecf3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Doctor: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7872ff67e0678cf5ad38a3dda34f293a7d6412fe2832bc24f00a9b2e7e599a36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: installs/migrate.rs: FileTooLong \u2014 516 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 16 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/installs/migrate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"014bf977b5eb74bcdd63a03f3dc0a41211fc87733bb59177210eb81d60ef2d64"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mise_system::files::plan_unapply_one: FunctionTooLong \u2014 mise_system::files::plan_unapply_one 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":"crates/mise-system/src/files.rs"},"region":{"startLine":5035}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e90340fd1bfd4d4d9a5777ab696e98bab26266b69119fa6731ca7c0f1fa86d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HttpBackend.install_version_: MethodTooLong \u2014 install_version_ 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":"src/backend/http.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c16c5ae1f2ed90e29e955a83a458e13df3600e255f9db3ce2c1baa6d3365a3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PackagePluginManager: ClassTooLong \u2014 409 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, 3 blocks, lines 90-666. The bar is 400 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/system/package_plugin.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25fa6ddf404f13eb493f1c6de9364db9faad2a4d0c7b5c16d67003b7a4e4700"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Git: ClassTooLong \u2014 408 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), 31 methods, 3 blocks, lines 20-1539. The bar is 400 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/git.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a686b9f169b5208e7f71f6da526d8e2184b9a11b58af6f2a711dca9d866fc1e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UnifiedGitBackend.try_verify_slsa: MethodTooLong \u2014 try_verify_slsa runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":3136}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f88b9bcf0420ff764685192ba12a554fbf511c8ddcd27c5245073d0e0b2d23b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workspace/node.rs: FileTooLong \u2014 509 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 9 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"549653886aab27d212cebbe4da3185f692820625778b324f79143402c8bb66ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Backend.list_remote_versions_with_info_and_options: MethodTooLong \u2014 list_remote_versions_with_info_and_options runs 101 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 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6617726bb9ae114edf9400866895e257b48c3414b5c5236d0e6fa6249a5b91e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 13 shared lines): src/backend/github.rs:2318-2404 | src/backend/github.rs:2415-2499 | src/backend/github.rs:2510-2597 \u2014 These 3 members are variants of one another: a block of 13 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 3 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 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec3b67224f8b4ef1c92d70a8514786623cc70b7a84ad2f563aaec95b3f89ec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (75 shared lines): crates/mise-util/src/cmd.rs:1267-1453 | crates/mise-util/src/cmd.rs:1464-1692 \u2014 These two members are variants of one another: 75 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2a3a6de71eacbcdea400841fab1ef2b13dc417a3c0fc51bde44c4a09731004"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (51 shared lines): crates/mise-util/src/file.rs:2990-3046 | crates/vfox/src/vfox/install.rs:466-519 \u2014 These two members are variants of one another: 51 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/file.rs"},"region":{"startLine":2990}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a12d8279bf4c53cbaf2af7a0b0c08e02f45aad472f823e1f28e4f1596a400ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (32 shared lines): src/plugins/core/ruby.rs:285-319 | src/plugins/core/ruby_windows.rs:54-88 \u2014 These two members are variants of one another: 32 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":"src/plugins/core/ruby.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb851b8a705f0ee7d17e737bfa04501c284ad873c6c4f83b2349a2cb635f8c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/lockfile.rs:2297-2324 | src/lockfile.rs:2333-2360 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"930dde218306d6a817ed8cb6f4acc761a8996bcfe13064bd05034576428f9a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/vfox/src/lua_mod/http.rs:305-328 | crates/vfox/src/lua_mod/http.rs:330-363 | crates/vfox/src/lua_mod/http.rs:365-380 | crates/vfox/src/lua_mod/http.rs:390-431 | crates/vfox/src/lua_mod/http.rs:433-462 | crates/vfox/src/lua_mod/http.rs:464-519 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfox/src/lua_mod/http.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfc2125113f4e013c4e1dd18a5bdda60e53e584c6084842b36cd836d1cfa93d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/cli/bootstrap.rs:4312-4324 | src/cli/bootstrap.rs:4332-4355 | src/cli/bootstrap.rs:4362-4374 | src/cli/bootstrap.rs:4403-4415 | src/cli/bootstrap.rs:4421-4433 \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":"src/cli/bootstrap.rs"},"region":{"startLine":4312}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8620c8376d4680a6947f9e94b6acfa89334a51e739c444f5b1d9385c9738df"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/config/mod.rs:1615-1829 | src/config/mod.rs:4533-4558 | src/task/mod.rs:2396-2482 | src/task/task_context_builder.rs:564-612 | src/toolset/toolset_env.rs:676-714 \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":"src/config/mod.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01a7460e5ed3497e0e035e9b34a288c9e6c23fcbb7f5c17027039d1bceb41cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/mise-system/src/accounts.rs:713-811 | crates/mise-system/src/firewall.rs:543-615 | crates/mise-system/src/managed_files.rs:936-1063 | crates/mise-system/src/services.rs:404-493 \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":"crates/mise-system/src/accounts.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20fb8b971f0bda8afeace40fa1738e0ca38054fe60cf3a9621442fd76018fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/mise-util/src/github.rs:564-604 | crates/mise-util/src/github.rs:611-649 | crates/mise-util/src/github.rs:1214-1242 | crates/mise-util/src/gitlab.rs:114-146 \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":"crates/mise-util/src/github.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1949a33d121f4f5595bec8685a63444d48fb327e9fb042bf4f7693a1f67aff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/mise-util/src/github.rs:967-987 | crates/mise-util/src/github.rs:1132-1181 | crates/mise-util/src/gitlab.rs:232-261 | crates/mise-util/src/gitlab.rs:290-315 \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":"crates/mise-util/src/github.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c1bd08c76dc5adf99c0c8eee48da00160cd4892e58e3b41591f5b45168a65c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/cli/bootstrap.rs:3574-3601 | src/cli/bootstrap.rs:3818-3855 | src/cli/bootstrap.rs:3883-3911 | src/cli/bootstrap.rs:3936-3963 \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":"src/cli/bootstrap.rs"},"region":{"startLine":3574}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c5ee6015642689f01d82ac647672b6b3b942579238b28aad849ee38fb13f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/cli/bootstrap.rs:3574-3601 | src/cli/bootstrap.rs:3666-3719 | src/cli/bootstrap.rs:3818-3855 | src/cli/bootstrap.rs:3936-3963 \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":"src/cli/bootstrap.rs"},"region":{"startLine":3574}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7c15015e5a4109ba698c9aa5c926e3c224fff434bf97fffa0a75ac2a64b632"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): src/toolset/env_cache.rs:239-276 | src/toolset/env_cache.rs:389-426 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/env_cache.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0acac8438780fb50fd2a17f189d83570f19bdb86d68518a736719501ed5fc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): src/cli/deps/add.rs:37-72 | src/cli/deps/remove.rs:32-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/deps/add.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda41f1efd7123d5aa7e8e9afe798a98d04404f2081c3d9be3bffa0388268c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201331 lines \u00D7 2): src/plugins/core/zig.rs:451-477 | src/plugins/core/zig.rs:503-533 \u2014 both copies are in the same file, so extract the block 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":"src/plugins/core/zig.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2da47953c12f520e63c880b90a91437350f2b95a545249ec2544030dc70dd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/backend/cargo/native_binstall.rs:190-219 | src/backend/cargo/native_binstall.rs:263-292 \u2014 both copies are in the same file, so extract the block 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":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c895944affdf578b3932cade89f3528b83b99e855822af4a5beb58c79b618db2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/mise-shim/src/windows_process.rs:133-161 | crates/mise-util/src/windows_process.rs:68-96 \u2014 before extracting anything, compare \u0060crates/mise-shim/src/windows_process.rs\u0060 and \u0060crates/mise-util/src/windows_process.rs\u0060 as WHOLE FILES: this scan already matched 7 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":"crates/mise-shim/src/windows_process.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c9b6a951733f51621d79616f972ca5cee4928be67db08c428d46c5970352e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): crates/mise-util/src/cmd.rs:1385-1410 | crates/mise-util/src/cmd.rs:1583-1608 | crates/mise-util/src/cmd.rs:1643-1668 \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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"863e02d1180e2f77a0ac21f5577d36821c92e7ca950efe176fec935b63bca8d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/toolset/toolset_install.rs:774-799 | src/toolset/toolset_install.rs:848-872 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/toolset_install.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f97e06ddabba5553a67c787b676eb67daedf8c8894f90eb801d23af4cc0725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201325 lines \u00D7 2): crates/mise-util/src/tera.rs:1913-1931 | crates/mise-util/src/tera.rs:2040-2064 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/tera.rs"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aef3424a81336c3dd9204f1fd8adcbc8516a8597c4abbb763f7ce42a000ad39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): src/task/task_executor.rs:1734-1756 | src/task/task_executor.rs:2381-2405 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_executor.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe1ba9a4581850f23828dab2a173f4d752f396547210f2de586ae97c67ae392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/plugins/asdf_plugin.rs:319-340 | src/plugins/vfox_plugin.rs:421-442 \u2014 before extracting anything, compare \u0060src/plugins/asdf_plugin.rs\u0060 and \u0060src/plugins/vfox_plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/plugins/asdf_plugin.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"f132942ee25d67524f748fe278e28d6d2acf7e1a3c651f413f05366cce0808da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/task/task_script_parser.rs:768-788 | src/task/task_script_parser.rs:843-862 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_script_parser.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07a769eac7cd075fae13c94947ba44c7ce985af1774bb528f57b66b811e6fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/toolset/env_cache.rs:210-230 | src/toolset/env_cache.rs:361-381 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/env_cache.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"68767e725c3461acd04fdee6bc64c6901fe8ade161f527608ad9df4a7714bdad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/mise-shim/src/windows_process.rs:197-216 | crates/mise-util/src/windows_process.rs:132-151 \u2014 before extracting anything, compare \u0060crates/mise-shim/src/windows_process.rs\u0060 and \u0060crates/mise-util/src/windows_process.rs\u0060 as WHOLE FILES: this scan already matched 7 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":"crates/mise-shim/src/windows_process.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"4287a3216b4866bfc55109a65345c406975b6ad53b744703367d03aad0a27e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/mise-system/src/history/watch/runtime.rs:472-491 | crates/mise-system/src/history/watch/runtime.rs:599-618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7ddfa36e93ea3615dcec2d2218a90078fc2f1839712e774a234d8074f104db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/mise-util/src/cmd.rs:1434-1453 | crates/mise-util/src/cmd.rs:1674-1692 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"14106a29fa834e20f785857654566c880d22f83921d677b52b516ac543e539ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/mise-util/src/file.rs:3007-3026 | crates/vfox/src/vfox/install.rs:480-499 \u2014 before extracting anything, compare \u0060crates/mise-util/src/file.rs\u0060 and \u0060crates/vfox/src/vfox/install.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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":"crates/mise-util/src/file.rs"},"region":{"startLine":3007}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c70264ddb72ef67cce54aaf8df9245c0e0bcca3ebfc201b13b4de77809cabe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/config/mod.rs:6184-6202 | src/config/mod.rs:6219-6238 \u2014 both copies are in the same file, so extract the block 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":"src/config/mod.rs"},"region":{"startLine":6184}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66974eb300a3d493babf56c160ec9b1e8f002c6c25d21a2fb5c2e9f7aa95c3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/plugins/asdf_plugin.rs:192-211 | src/plugins/vfox_plugin.rs:223-241 \u2014 before extracting anything, compare \u0060src/plugins/asdf_plugin.rs\u0060 and \u0060src/plugins/vfox_plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/plugins/asdf_plugin.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"57624fef75b896d83d021f27322bb239de2f12960be3683394340b91d2b668b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/plugins/asdf_plugin.rs:286-304 | src/plugins/vfox_plugin.rs:351-370 \u2014 before extracting anything, compare \u0060src/plugins/asdf_plugin.rs\u0060 and \u0060src/plugins/vfox_plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/plugins/asdf_plugin.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5ab96b8536c126fc3e7f3fc9884f847000af14364c6c6e04de423cae7bb121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/task/task_executor.rs:2081-2100 | src/task/task_executor.rs:2163-2182 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_executor.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa76667ecc02c6450917564034cba6d8ae8e728b3b49403d4a0fceacbbafb6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/task/task_scheduler.rs:264-283 | src/task/task_scheduler.rs:342-360 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_scheduler.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b619fd01b5ccbb20d1d4ee163597cffec3aac24bf2ce3f85c791982c037fee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): crates/mise-util/src/cmd.rs:1321-1339 | crates/mise-util/src/cmd.rs:1535-1550 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c17a8df2357e434d68d72b35cd5daec802cc8e14897b643424f51bf07202e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/mise-util/src/file.rs:3028-3046 | crates/vfox/src/vfox/install.rs:501-519 \u2014 before extracting anything, compare \u0060crates/mise-util/src/file.rs\u0060 and \u0060crates/vfox/src/vfox/install.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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":"crates/mise-util/src/file.rs"},"region":{"startLine":3028}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c31252be8ddb6cc20b2c97fd732d15823f5059f246103428d4f135c1b5c46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201319 lines \u00D7 2): src/backend/npm.rs:2152-2165 | src/backend/npm.rs:2211-2229 \u2014 both copies are in the same file, so extract the block 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":"src/backend/npm.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c5571552577abe891eeeba2b473f140d93d38a21d0c06da9515e9b60aa613a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/mise-brew-metadata/src/cask/flight/path.rs:289-306 | crates/mise-brew-metadata/src/cask/flight/path.rs:331-348 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-brew-metadata/src/cask/flight/path.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"635162f7a75f792575ea6286f36a99addf7153858e53001603421582c68314d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): src/backend/aqua.rs:2356-2373 | src/backend/aqua.rs:2405-2418 \u2014 both copies are in the same file, so extract the block 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":"src/backend/aqua.rs"},"region":{"startLine":2356}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c6fa337941f4121abc8b995059fdd5f4b84a57cc737fedb4c7477f37f816cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/cli/doctor/mod.rs:713-730 | src/cli/doctor/mod.rs:1211-1227 \u2014 both copies are in the same file, so extract the block 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":"src/cli/doctor/mod.rs"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace9ad3aa9cd6c91515ed93bdd68149fb637be6c155d47887a363c0afe8fdeb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/cli/hook_env.rs:461-478 | src/cli/hook_env.rs:493-510 \u2014 both copies are in the same file, so extract the block 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":"src/cli/hook_env.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"4702b0cc18378d3a21731709a376cd71e949d4dab35e441e8e14703196a47017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): src/cli/bootstrap.rs:3585-3601 | src/cli/bootstrap.rs:3839-3855 | src/cli/bootstrap.rs:3895-3911 | src/cli/bootstrap.rs:3947-3963 \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":"src/cli/bootstrap.rs"},"region":{"startLine":3585}}}],"partialFingerprints":{"codehealthFindingId/v1":"851d6dd6746118d32d2325d2af486d5067264a81dc41a806c2bc3fad7965060c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/mise-shim/src/windows_process.rs:377-393 | crates/mise-util/src/windows_process.rs:214-230 \u2014 before extracting anything, compare \u0060crates/mise-shim/src/windows_process.rs\u0060 and \u0060crates/mise-util/src/windows_process.rs\u0060 as WHOLE FILES: this scan already matched 7 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":"crates/mise-shim/src/windows_process.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"87849afb27ef0a8675fda717aecc8c039f81e5743c3673fad45aec17b83102de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/mise-sigstore/src/bundle.rs:71-87 | crates/mise-sigstore/src/github.rs:147-163 \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":"crates/mise-sigstore/src/bundle.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5990575e8906262efd944385748a8b293754502e8c51d46e137326b0977ef183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/mise-system/src/lib.rs:813-829 | crates/mise-system/src/lib.rs:2148-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":"crates/mise-system/src/lib.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0e5d3bd321215665b8eab6655be2d29868346be86425a8ad85846a61293b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): src/cli/dotfiles/track.rs:220-236 | src/cli/dotfiles/untrack.rs:143-156 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/track.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f09f0ea59aa4ddb453acd1f9460bdaa16808a6aae2f287a7702e8bdfd6ea3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/toolset/install_state.rs:1665-1681 | src/toolset/install_state.rs:1684-1700 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/install_state.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fa9f8156ffbdce15d543d8d16b0f0714e2554164952e58e63b7b5811d56ae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/mise-system-packages/src/brew/mod.rs:451-466 | crates/mise-system-packages/src/brew/mod.rs:473-488 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system-packages/src/brew/mod.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cbdf8140481543c2a3b4ddff62cb28a8c211b05598c6ec0c8cb186255a9402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/mise-system/src/files.rs:3774-3789 | crates/mise-system/src/files.rs:5274-5287 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/files.rs"},"region":{"startLine":3774}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1b12e6114071cc398140b459d5211cccf64c595d2f9cfcb1cfff3d7ac5de2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/backend/github.rs:2336-2351 | src/backend/github.rs:2535-2550 \u2014 both copies are in the same file, so extract the block 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":"src/backend/github.rs"},"region":{"startLine":2336}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fc975b16918b6d71d76bec018303291391879db26c8de11690fb455305f1ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cli/system/import.rs:229-244 | src/cli/system/use.rs:213-228 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/import.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f38487ec9419e78308002266816f810fdf4e5d770899d0caa2cb0d66e40c98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cli/tool.rs:188-203 | src/cli/tool.rs:247-262 \u2014 both copies are in the same file, so extract the block 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":"src/cli/tool.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"503f65a2b262e60029f27cf69e7bc3a16714191bd8b9e90624f1e806b68b7bc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/cli/upgrade.rs:469-484 | src/cli/upgrade.rs:945-960 \u2014 both copies are in the same file, so extract the block 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":"src/cli/upgrade.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1a5e7a289e76c0ba71a52d4a11ec9504f83b36b63812c94ac9bd9c1f0cdb67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/config/env_directive/mod.rs:575-590 | src/config/env_directive/mod.rs:606-621 \u2014 both copies are in the same file, so extract the block 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":"src/config/env_directive/mod.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbc5f1f0669cc26115d45e5c91488413d6789290d7345e06616c61e0b794909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/plugins/asdf_plugin.rs:398-413 | src/plugins/vfox_plugin.rs:500-515 \u2014 before extracting anything, compare \u0060src/plugins/asdf_plugin.rs\u0060 and \u0060src/plugins/vfox_plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/plugins/asdf_plugin.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c7e1fef7f6c3e1232ebb7ceae2cb54ae00d64c2a79155e33bbde3aa2d1fe3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): src/plugins/core/bun.rs:77-92 | src/plugins/core/deno.rs:65-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/bun.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"31692fb22046aad27a8c0dbc1a90723a029dc19b64b7cf9b0cc35749fa3dac7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/plugins/core/ruby.rs:835-850 | src/plugins/core/ruby_windows.rs:218-233 \u2014 before extracting anything, compare \u0060src/plugins/core/ruby.rs\u0060 and \u0060src/plugins/core/ruby_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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":"src/plugins/core/ruby.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5c1353899f1a9f4a692b3a792d2b828b4b5222a1c277bccb7e6a2da130805d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/task/task_executor.rs:1218-1233 | src/task/task_executor.rs:1246-1261 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_executor.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd02bd135a9278b2d07f376ba8598649fd35a2149d94f2c5914c3e26cd8772c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/toolset/env_cache.rs:284-299 | src/toolset/env_cache.rs:434-449 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/env_cache.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2db785689337cb651f0348acd8b27d1eb7ecc1979c4f8727d416f2c10b41c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 3): crates/mise-system/src/history/watch/runtime.rs:396-410 | crates/mise-system/src/history/watch/runtime.rs:467-477 | crates/mise-system/src/history/watch/runtime.rs:594-604 \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":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"847532d6948e0a577f725297bd853c70edb4d3ff24b5d1a7bf739804f47ed8ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/mise-system-packages/src/apt.rs:91-105 | crates/mise-system-packages/src/apt.rs:118-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/apt.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08b685de1b2cb9058f24a1302fddfa25c436eaf57f129dabb0f1a07be4041d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/mise-system/src/lib.rs:737-751 | crates/mise-system/src/lib.rs:2117-2131 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/lib.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb712982f018b736def33cec1ecabf2e718867ab4820e02fb09624a7542f6c31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/backend/aqua.rs:2212-2225 | src/backend/github.rs:3113-3127 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3065422bb38238eb5d09b82dc1c5c59972cf23f5a2ac21835beaad1611cd2bd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/backend/gem.rs:527-541 | src/backend/gem.rs:570-584 \u2014 both copies are in the same file, so extract the block 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":"src/backend/gem.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01bb7c726259924c5631cf29d034edb389dfe082bd13ccd57299c5883971bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/backend/github.rs:2446-2460 | src/backend/github.rs:2544-2558 \u2014 both copies are in the same file, so extract the block 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":"src/backend/github.rs"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ec0a40e7c25f862ff64aa8859cc10a21db8f2d54e1cb785e454ecbb8cf7056"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/backend/github.rs:2479-2493 | src/backend/github.rs:2577-2591 \u2014 both copies are in the same file, so extract the block 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":"src/backend/github.rs"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"c042888d4cf8527f2b9bb56a172c6035926a3f8bbe268d62016eea3c292c7dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/backend/jq.rs:53-66 | src/backend/jq.rs:173-187 \u2014 both copies are in the same file, so extract the block 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":"src/backend/jq.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7135feb78e1f54e1705f3ab7d5700955387d627d512803ccc2ed410015fa15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/cli/generate/task_stubs.rs:638-652 | src/cli/generate/tool_stub.rs:257-271 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/generate/task_stubs.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"9055376e417d5543391e45c0b67bbcd57cb965abb5387583342324823f16ae17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/config/config_file/mise_toml.rs:998-1012 | src/config/config_file/mise_toml.rs:1067-1080 \u2014 both copies are in the same file, so extract the block 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":"src/config/config_file/mise_toml.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e4093bacdefeea810946e1a66ba5c7a3694f15086552cc417dea8c7cd92914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/hooks.rs:668-682 | src/hooks.rs:792-804 \u2014 both copies are in the same file, so extract the block 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":"src/hooks.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df44de02386dc41422e80ac6d27bb90fd412e972083e2de7562c16afa321f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/toolset/toolset_env.rs:240-254 | src/toolset/toolset_env.rs:308-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/toolset_env.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ad32e3ae5a52ac8e98ef37fb65c4a890d543afa974c9f27c1e88056b7f3c9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/mise-system-packages/src/apk.rs:81-94 | crates/mise-system-packages/src/dnf.rs:311-323 \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":"crates/mise-system-packages/src/apk.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"950989a0f2b08b27c14f29c849b2cf70a0c8050a604ca36a53d49c43d44f6b53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/mise-util/src/git.rs:190-203 | crates/mise-util/src/git.rs:337-350 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/git.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"98cebfd444339a3d6870cf3aa289ac988d168210f2766ddd5af237c57690c913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/mise-util/src/github.rs:574-587 | crates/mise-util/src/github.rs:618-630 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/github.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1444b801646415c1c806f3f434336551d1ca802daf194609aee8501d5fb6fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/vfox/src/hooks/backend_install.rs:36-49 | crates/vfox/src/hooks/backend_uninstall.rs:30-43 \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":"crates/vfox/src/hooks/backend_install.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d086440d6c969114d57461ebaa083a95da85bf7df28a28ea2af8c3a445cdfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/vfox/src/lua_mod/http.rs:406-419 | crates/vfox/src/lua_mod/http.rs:448-460 \u2014 both copies are in the same file, so extract the block 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":"crates/vfox/src/lua_mod/http.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b765ad0acec35272d417d1bdc6196235b15cb4b5d2baa6190329899315cf286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/backend/aqua.rs:3711-3724 | src/backend/aqua.rs:3738-3751 \u2014 both copies are in the same file, so extract the block 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":"src/backend/aqua.rs"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"079904c95fee54da20324e9b0fe1e375b87d6e8022ed0459eb1d40850b082c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/backend/github.rs:2374-2387 | src/backend/github.rs:2570-2583 \u2014 both copies are in the same file, so extract the block 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":"src/backend/github.rs"},"region":{"startLine":2374}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4e17e9972e1d515079da2d1a2d5479c1104b93292d3b49d0f8f4a6749f358a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/backend/static_helpers.rs:1787-1800 | src/backend/static_helpers.rs:1808-1821 \u2014 both copies are in the same file, so extract the block 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":"src/backend/static_helpers.rs"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"f599f0333e0019f6a49330bad32a94a25d6f4187a9f2fa076b36499c47ed09b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/token/forgejo.rs:40-53 | src/cli/token/gitlab.rs:40-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/token/forgejo.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb935cbab6d36f600d444d5c6662966eaeca45668ae1a1931fdaff1be517124d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/cli/watch.rs:427-440 | src/toolset/tool_version.rs:1659-1672 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/watch.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"947ec632725cea6d072ef469bcbccaea156372838e78ae5ff5d1fcaa64a86d0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): src/plugins/core/node.rs:815-828 | src/plugins/core/node.rs:916-925 \u2014 both copies are in the same file, so extract the block 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":"src/plugins/core/node.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed4b88d04cd4f37360550df258a9bfdc4af39fc04c3b4f4b701c9a61f5bcee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/plugins/core/ruby.rs:286-299 | src/plugins/core/ruby_windows.rs:55-68 \u2014 before extracting anything, compare \u0060src/plugins/core/ruby.rs\u0060 and \u0060src/plugins/core/ruby_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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":"src/plugins/core/ruby.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"940e70f06e1f8fd00f7c7fe8ed43c7152795c657be4a381d883cf67c490f7305"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/toolset/toolset_install.rs:155-168 | src/toolset/toolset_install.rs:246-259 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/toolset_install.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d932df0d53d299c55aebb4aabd9f63efe54333791d13cd214d656e33a5430a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/backend/github.rs:2367-2379 | src/backend/github.rs:2465-2477 | src/backend/github.rs:2563-2575 \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":"src/backend/github.rs"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f60eb5acd8013d3cbba4267f7d8a830b2a9cbbf74ff219e57f6620c26dd2b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mise-system-packages/src/mas.rs:264-276 | crates/mise-system-packages/src/mas.rs:287-299 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system-packages/src/mas.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d992a65cd5c4e3657823e64a4afd3797df1f3a88f6ab5b8ef35fd802ca0e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mise-system/src/managed_files.rs:946-958 | crates/mise-system/src/managed_files.rs:996-1008 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51164c1ca426a00543aad623616f907c43bfeb337ba6b6b464969eb42697c9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mise-util/src/cmd.rs:1720-1732 | crates/mise-util/src/cmd.rs:1957-1969 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ee299b61de874f9282a74c56fd29fbac087afc18d4aa67b948de49b6b69c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/backend/github.rs:1529-1540 | src/backend/github.rs:1664-1676 \u2014 both copies are in the same file, so extract the block 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":"src/backend/github.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e7c87aefca9bcbdcb00c8b888b54433c2c15e88cb8fcee638caf9d6147d30d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/cli/lock.rs:2841-2853 | src/cli/lock.rs:2905-2917 \u2014 both copies are in the same file, so extract the block 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":"src/cli/lock.rs"},"region":{"startLine":2841}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fa41f71ed466966180e768f1a500052cc6c1b4ae47e684207a16344305b2f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/secrets/broker.rs:321-333 | src/secrets/broker.rs:355-367 \u2014 both copies are in the same file, so extract the block 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":"src/secrets/broker.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6428d3057fbcfc6955146a326200d5bec420c8d14070cf5c2501513ab763ab4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/toolset/toolset_install.rs:462-473 | src/toolset/toolset_install.rs:478-490 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/toolset_install.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe1276644b128afc13b0bbeaa1ceca12cdb3dd71ef42c37416c65982245ea06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-dotenv/src/lib.rs:176-187 | crates/mise-dotenv/src/lib.rs:204-215 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-dotenv/src/lib.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cabded4afb858d0263f105bde4c49c74e6333e62b8abeb3887d06d571d9fc62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-system-packages/src/brew/cask/mod.rs:4139-4150 | crates/mise-system-packages/src/brew/cask/state.rs:450-461 \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":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":4139}}}],"partialFingerprints":{"codehealthFindingId/v1":"be586f9d3aa41f9fb6db68189a8fdd9b27af31ac15daf0aec4e4acf62bd7fdb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-system-packages/src/brew/pour.rs:679-690 | crates/mise-system/src/files.rs:2248-2259 \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":"crates/mise-system-packages/src/brew/pour.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"7486923407a2f662fdf595e5279ffd67189d94713794d0a1afe7e7d9c17020e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-system/src/defaults/dock.rs:21-32 | crates/mise-system/src/login_items.rs:72-83 \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":"crates/mise-system/src/defaults/dock.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9494e5502bcfc161311427143a70de2f8173ee2151cdeb37af5653b0de293d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/mise-system/src/history/notify/macos.rs:86-97 | src/enclave/macos.rs:65-75 \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":"crates/mise-system/src/history/notify/macos.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"03415c9d1a6da6101ebfebfdcddee709a812593d0accad16d320a0822652e3c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-system/src/managed_files.rs:1298-1309 | crates/mise-system/src/managed_files.rs:1477-1488 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"004b7b0e9717c686ca9b85ebda2837f09e36cf4cb2215b82a94aaa1694362fa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-util/src/cmd.rs:2038-2049 | crates/mise-util/src/cmd.rs:2075-2086 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"203e070547fe00730333bd5d02cff9eda0142beec1c6d2e1801969a5f5d5d08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-util/src/cmd.rs:2132-2143 | crates/mise-util/src/cmd.rs:2169-2180 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"83042e7579ad32eb6c67a1b97911b9ab46c6605cd2b3023146c5121354375dc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-util/src/file.rs:2991-3002 | crates/vfox/src/vfox/install.rs:467-478 \u2014 before extracting anything, compare \u0060crates/mise-util/src/file.rs\u0060 and \u0060crates/vfox/src/vfox/install.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 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":"crates/mise-util/src/file.rs"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ce4ade3d76a85a22fa61a1638dd8cf931925c358176a966a8f2dd8dcb159f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-util/src/forgejo.rs:216-227 | crates/mise-util/src/gitlab.rs:367-378 \u2014 before extracting anything, compare \u0060crates/mise-util/src/forgejo.rs\u0060 and \u0060crates/mise-util/src/gitlab.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 66 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":"crates/mise-util/src/forgejo.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c211a7623f1a7aac7186444e98ddc1653e5918fbb03894d3212ecd675b711847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-util/src/hash.rs:64-75 | crates/mise-util/src/hash.rs:91-102 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/hash.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c270c2b6127d77d6916f1268b7f4c216fb2ddb3ddcffe9948992b71db770bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/backend/aqua.rs:885-896 | src/backend/aqua.rs:1226-1238 \u2014 both copies are in the same file, so extract the block 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":"src/backend/aqua.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dedcc2d0260544ea3845fadec9dca703c9582d39d5e9feefdfd95b30edfe3dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/backend/aqua.rs:3249-3260 | src/backend/github.rs:1897-1906 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfd06facef34b4a3376a8cce8e895a0a18402d40049e398c440cbf7cd73e1aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/backend/cargo/native_binstall.rs:121-132 | src/backend/cargo/native_binstall.rs:213-224 \u2014 both copies are in the same file, so extract the block 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":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"003912da23b7665f68fe2abce8dd5abd00bfd3bc5e8794ed370a8a09971790b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/backend/http.rs:1602-1613 | src/backend/s3.rs:665-674 \u2014 before extracting anything, compare \u0060src/backend/http.rs\u0060 and \u0060src/backend/s3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 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":"src/backend/http.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b0f58282cd028139e576efe527db6450d2fd8fc47b6f91a95bdef6064bf50a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/backend/http.rs:1717-1728 | src/backend/s3.rs:716-727 \u2014 before extracting anything, compare \u0060src/backend/http.rs\u0060 and \u0060src/backend/s3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 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":"src/backend/http.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdd1e81386ffb62dd2f6f183179ff16800da0fed0790a45abcbb435bc635176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/backend/static_helpers.rs:515-526 | src/backend/static_helpers.rs:616-627 \u2014 both copies are in the same file, so extract the block 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":"src/backend/static_helpers.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f513bf31bd77d5cacea6dba8d6c21d1518e2e57062a8a247f2e8f9df874712"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/backend/ubi.rs:244-255 | src/backend/ubi.rs:281-292 \u2014 both copies are in the same file, so extract the block 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":"src/backend/ubi.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a7558ce7fc7c7f7e6ebc869c1884b7019382d8f8e3534d486572cc6932664a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/backend/vfox.rs:630-641 | src/backend/vfox.rs:660-671 \u2014 both copies are in the same file, so extract the block 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":"src/backend/vfox.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"e309773a0a2d577730eb933ea5ac95d41dd76b22133c82061361d8d7d25dae76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cli/bootstrap.rs:2865-2876 | src/cli/bootstrap.rs:2895-2907 \u2014 both copies are in the same file, so extract the block 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":"src/cli/bootstrap.rs"},"region":{"startLine":2865}}}],"partialFingerprints":{"codehealthFindingId/v1":"887bc4c85913eaf657f969701ef9c3cb0b4d8d4398fab72088f286d656e2703d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cli/bootstrap.rs:3978-3989 | src/cli/ssh.rs:175-186 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27297aadbe59dbe6339583d7be524dc8801340cb9e97423eb644410e7200d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/cli/bootstrap.rs:4789-4800 | src/cli/bootstrap.rs:6092-6102 \u2014 both copies are in the same file, so extract the block 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":"src/cli/bootstrap.rs"},"region":{"startLine":4789}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d8594640b30527377024e4378c2be465b7a3dc5e225d03d24f810f103f8bde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/cli/exec.rs:838-849 | src/cli/exec.rs:1033-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":"src/cli/exec.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdad83e4526089fb971a579f5d2fde1b060a1acff22fee625fabfc06b2c3595"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daemons/glue.rs:264-275 | src/daemons/glue.rs:297-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daemons/glue.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc08d6249adc8b7e724c08c8471521a89fc3c2e2357eeee691919db0984759a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/deps/engine.rs:934-945 | src/deps/engine.rs:951-961 \u2014 both copies are in the same file, so extract the block 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":"src/deps/engine.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"5450c3d750096faf1af39b4a0fe49252cc5434cd619aa01f3544c53288e529bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/sops.rs:93-104 | src/sops.rs:153-164 \u2014 both copies are in the same file, so extract the block 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":"src/sops.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8200a981e1659953a1b10d5e2c482439c40d644ca77b54d64a7170fc695cacbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/task/task_source_checker.rs:754-765 | src/task/task_source_checker.rs:878-889 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_source_checker.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bd749c724824985db11063c39fa658f1994e1eb4caffe2936304b9932bf817"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/toolset/toolset_env.rs:200-210 | src/toolset/toolset_env.rs:598-609 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/toolset_env.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cf6257215ba99e9c0c76bc4eaff3fcb43bab4cdb272a4a333280414338478b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/mise-system/src/history/watch/runtime.rs:454-464 | crates/mise-system/src/history/watch/runtime.rs:481-491 | crates/mise-system/src/history/watch/runtime.rs:608-618 | crates/mise-system/src/history/watch/runtime.rs:716-726 \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":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af533c1c3ca1a8035baaf7e8e2886c460baddaceee42c8d0741f5230e4da3aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/mise-util/src/forgejo.rs:58-68 | crates/mise-util/src/github.rs:204-214 | crates/mise-util/src/gitlab.rs:191-201 \u2014 before extracting anything, compare \u0060crates/mise-util/src/forgejo.rs\u0060 and \u0060crates/mise-util/src/github.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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":"crates/mise-util/src/forgejo.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff15ba34eed5fe9f9145eb52dc209c76c8ce5167c49a3714dc3c29be40eb382c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/backend/cargo/native_binstall.rs:120-130 | src/backend/cargo/native_binstall.rs:212-222 | src/backend/cargo/native_binstall.rs:285-295 \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":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a45d3e6fa98028730e204994a7f8f4b1c2224c14172951af89bedec58d7af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/sops.rs:94-104 | src/sops.rs:121-131 | src/sops.rs:154-164 \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":"src/sops.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"af12d0f7aafc90ef9312932b306bc2fea3d90f7fd4f2c71e406d767196621da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mise-config/src/packages.rs:158-168 | crates/mise-config/src/packages.rs:182-192 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-config/src/packages.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fb1c66d7a6382c4317803e479562f018acb36e3090e331dac8eead01fe9132"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/mise-shim/src/windows_process.rs:353-362 | crates/mise-util/src/windows_process.rs:188-198 \u2014 before extracting anything, compare \u0060crates/mise-shim/src/windows_process.rs\u0060 and \u0060crates/mise-util/src/windows_process.rs\u0060 as WHOLE FILES: this scan already matched 7 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":"crates/mise-shim/src/windows_process.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c56079d0dc76e919f3d33a7f3465a1b36d0381cc3801c76d7c7006e0e8488b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mise-sigstore/src/bundle.rs:36-46 | crates/mise-sigstore/src/github.rs:120-130 \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":"crates/mise-sigstore/src/bundle.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2515f604aabd4fa6b026d3d8c8b9dd3d9f878dbf7bf5bb2870158e8f4ad1dab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mise-system-packages/src/apt.rs:604-614 | crates/mise-system-packages/src/apt.rs:633-643 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system-packages/src/apt.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78b15e149c3e5addbda6843e6b8fcd23d5f6764b8d0817eb96bd6a316668161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/mise-system-packages/src/pacman.rs:312-322 | crates/mise-system-packages/src/pacman.rs:358-367 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system-packages/src/pacman.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5585e621a51db7125892e28b8a628bc4515fb3f9dac2c24133d51a44f3596e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mise-system/src/files.rs:4438-4448 | crates/mise-system/src/files.rs:4554-4564 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/files.rs"},"region":{"startLine":4438}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b423fc4823db4bcc2aae1a051bd6e9785b939232c0af2c8e72a9489189b2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mise-system/src/firewall.rs:1249-1259 | crates/mise-system/src/firewall.rs:1431-1441 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/firewall.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"515719ca4a849afb648f9998a752d0d91b4c1c700692a712ba2fb868c141b9dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mise-system/src/history/journal.rs:218-228 | crates/mise-system/src/history/journal.rs:387-397 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/history/journal.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6336d59e4a4bc5de6ac73925a7043816da5b93a127ac7c2f11cd5ccce4924f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mise-util/src/forgejo.rs:45-55 | crates/mise-util/src/gitlab.rs:178-188 \u2014 before extracting anything, compare \u0060crates/mise-util/src/forgejo.rs\u0060 and \u0060crates/mise-util/src/gitlab.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 66 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":"crates/mise-util/src/forgejo.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5b1929132859a3c4d4ec7d47da8cd93a749cc77a5178c2c801e2cd652f2c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mise-util/src/github.rs:163-173 | crates/mise-util/src/gitlab.rs:165-175 \u2014 before extracting anything, compare \u0060crates/mise-util/src/github.rs\u0060 and \u0060crates/mise-util/src/gitlab.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"crates/mise-util/src/github.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3636762e1757bcc96e798a4256ed207fe0c809c7034c9a0d203aca4ff66876c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/vfox/src/lua_mod/archiver.rs:86-95 | crates/vfox/src/lua_mod/archiver.rs:97-107 \u2014 both copies are in the same file, so extract the block 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":"crates/vfox/src/lua_mod/archiver.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2daad4fdd4c0949b79915a249152618f39a8b058c29a9c809ba8ef7c482b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/backend/external_plugin_cache.rs:42-52 | src/backend/external_plugin_cache.rs:82-92 \u2014 both copies are in the same file, so extract the block 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":"src/backend/external_plugin_cache.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"626489f9c18a03dd6e807def609e382f2decf75b5a07e60cc4ab92ba61ae53f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/backend/github.rs:1868-1878 | src/backend/github.rs:2003-2012 \u2014 both copies are in the same file, so extract the block 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":"src/backend/github.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d65aed28545e56e53f28450de9fc9a8a9c77c4140ff562c3be12e7c5b97769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/backend/go.rs:773-783 | src/backend/go.rs:807-817 \u2014 both copies are in the same file, so extract the block 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":"src/backend/go.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0412415d9dab555bd07a7cfa171f4413a166fef383e399231d401e18d836dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/backend/http.rs:1105-1115 | src/backend/s3.rs:426-436 \u2014 before extracting anything, compare \u0060src/backend/http.rs\u0060 and \u0060src/backend/s3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 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":"src/backend/http.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3965c3a319d6865ab94f88caf5e476a5f15a7cb7156fc5bea53efa243596fa00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/bootstrap.rs:3678-3688 | src/cli/bootstrap.rs:4333-4343 \u2014 both copies are in the same file, so extract the block 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":"src/cli/bootstrap.rs"},"region":{"startLine":3678}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaccd218661ed1cc4ee3bc6135734ac2ae40624e8db3c5779fee23fd6f596a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/bootstrap.rs:4448-4458 | src/cli/doctor/mod.rs:509-519 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":4448}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b9bddac8556bd3ea243c578ac68d21791971322ddcd3c846d15e1261299458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/sync/node.rs:132-142 | src/cli/sync/python.rs:81-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/sync/node.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3e1b7f430ff3373b81114188a10f571c77e5f52009ea04059bb2ac2c81f125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/config/env_directive/mod.rs:538-548 | src/config/env_directive/mod.rs:592-602 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b87ccdb04e1d88b08acbd2958a092339507c9186b45d0973b98ddc0349c9736"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/direnv.rs:69-79 | src/direnv.rs:92-102 \u2014 both copies are in the same file, so extract the block 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":"src/direnv.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0e0f28546d95e5d3bbee7fad7bb7849cad8e1cb6b14b4e5c00033f5e3320b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/plugins/core/erlang.rs:458-468 | src/plugins/core/erlang.rs:521-531 \u2014 both copies are in the same file, so extract the block 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":"src/plugins/core/erlang.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"763ee78ea49d1622888152a82725dae5e602233bed53ac71e020fe2081bf3816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): src/plugins/core/python.rs:448-455 | src/plugins/core/python.rs:578-588 \u2014 both copies are in the same file, so extract the block 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":"src/plugins/core/python.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebab85755406d64d4751f377356da7813324793df1bddc0266b863eafb4791d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/plugins/core/ruby.rs:301-311 | src/plugins/core/ruby_windows.rs:70-80 \u2014 before extracting anything, compare \u0060src/plugins/core/ruby.rs\u0060 and \u0060src/plugins/core/ruby_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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":"src/plugins/core/ruby.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"054b68b7be708307038137f327431cde80c0e3479c63d1a3d2c67eb434089455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): src/task/workspace.rs:1193-1203 | src/task/workspace.rs:1230-1236 \u2014 both copies are in the same file, so extract the block 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":"src/task/workspace.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"65870efe6d35fcbaf5565dbff22d7af01be276f0f2b04f1bba20dfdfcad9def7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/watch_files.rs:240-250 | src/watch_files.rs:315-325 \u2014 both copies are in the same file, so extract the block 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":"src/watch_files.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ee7279e3c544831ebbbeacc22365e3fcc5e251ad233ddcf1d23bd9954a56c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): src/cli/mcp.rs:518-527 | src/cli/mcp.rs:584-593 | src/cli/mcp.rs:612-621 | src/cli/mcp.rs:638-647 \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":"src/cli/mcp.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"690a9a926feec0ade2d2030928dcecdad7e750fd897c11ab15882678eba6e1b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/aqua-registry/src/types/merge.rs:60-69 | crates/aqua-registry/src/types/merge.rs:82-91 \u2014 both copies are in the same file, so extract the block 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":"crates/aqua-registry/src/types/merge.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f752f8d8ecba02c0df363095c5a98643a584c8ebdc88f0a06f4da398d119c249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-cache-core/src/protocol.rs:140-149 | crates/mise-cache-core/src/protocol.rs:156-165 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-cache-core/src/protocol.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd908d6278afd27578b45594ce5fcb4551cd1eaa275396bdf0718795f224eef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-shim/src/windows_process.rs:290-299 | crates/mise-util/src/windows_process.rs:176-185 \u2014 before extracting anything, compare \u0060crates/mise-shim/src/windows_process.rs\u0060 and \u0060crates/mise-util/src/windows_process.rs\u0060 as WHOLE FILES: this scan already matched 7 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":"crates/mise-shim/src/windows_process.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"32349f2e2a3a2f941eee9005a404727397f533258dc7cd7621a1c20136041e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-shim/src/windows_process.rs:365-374 | crates/mise-util/src/windows_process.rs:201-210 \u2014 before extracting anything, compare \u0060crates/mise-shim/src/windows_process.rs\u0060 and \u0060crates/mise-util/src/windows_process.rs\u0060 as WHOLE FILES: this scan already matched 7 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":"crates/mise-shim/src/windows_process.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63ee1ef83e65c3c4346db225845f44d01e05d564f21c15f8cb4aed7d346294f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-sigstore/src/certificate.rs:91-100 | crates/mise-sigstore/src/cosign_identity.rs:271-280 \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":"crates/mise-sigstore/src/certificate.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0fb2e2d4b28aec2ea0074a69beb2dd7d584056f839c3e638006593af8f596e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-system-packages/src/dnf.rs:255-264 | crates/mise-system-packages/src/pacman.rs:44-53 \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":"crates/mise-system-packages/src/dnf.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6313257cfc5468ecddce0b7911b9ee25b2e8e14360a9d170027d8f04d5b1385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-system/src/firewall.rs:654-663 | crates/mise-system/src/firewall.rs:666-675 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/firewall.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"f606fd2a13d0495cfe63f7bf9733550cdc4eee60903da2b9f09cb5a1783a9025"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-system/src/history/sync/network.rs:275-284 | crates/mise-system/src/history/sync/network.rs:301-310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/sync/network.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfbd4ef97fc4081fba8671c95af2023638abd23e5a04f4a886726c312741bf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-system/src/history/sync/reconcile.rs:309-318 | crates/mise-system/src/history/sync/reconcile.rs:329-338 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/history/sync/reconcile.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dd310d99a620e36f9f9944548a8707d1fba8cbac294f13a334cf7b1003f44f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-system/src/managed_files.rs:2244-2253 | crates/mise-system/src/managed_files.rs:2928-2937 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a9b42a2059dbba73eecb8b39f6e97d8c2614e2d185e15246daef3737d62ab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-system/src/remote_repository.rs:175-184 | crates/mise-system/src/remote_repository.rs:240-249 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/remote_repository.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"65be22dcdefff9df14c19624e9bfe0f1339990deb3e12618f81919bf1df96adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-util/src/forgejo.rs:293-302 | crates/mise-util/src/gitlab.rs:445-454 \u2014 before extracting anything, compare \u0060crates/mise-util/src/forgejo.rs\u0060 and \u0060crates/mise-util/src/gitlab.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 66 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":"crates/mise-util/src/forgejo.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"592d9df69a6aeef1e7917e3dc3b48097c51cef36b7efbe3465f5ffc119f83183"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-util/src/tera.rs:1860-1869 | crates/mise-util/src/tera.rs:1971-1980 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/tera.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"573ef8c4467d3584a04250517cbe50d02ea62141f7089704c79ec31ac8d8dc13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201310 lines \u00D7 3): src/args/backend_arg.rs:308-317 | src/registry.rs:798-807 | src/shims.rs:1171-1173 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args/backend_arg.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"154c4165b31dd82f2f998f4f0e89d20e622a9a207e962adf3012eaed1532ce60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/backend/gem.rs:517-524 | src/backend/gem.rs:558-567 \u2014 both copies are in the same file, so extract the block 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":"src/backend/gem.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a0f7d4da360112bdf499c46f3cae6663acb40ddbf42375acc9adaad28f1e86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): src/backend/static_helpers.rs:1358-1367 | src/backend/static_helpers.rs:1607-1613 \u2014 both copies are in the same file, so extract the block 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":"src/backend/static_helpers.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"565084b72ff0de9fe67465e27298658a8c801b5f161fb253dfa3d0a44fb87193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/bootstrap.rs:4530-4539 | src/cli/system/status.rs:82-91 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":4530}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2146f5b2aec73791aefb0cc888e8ac5331ee9efb2cb0775b08e00d342363c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/cli/bootstrap.rs:4641-4650 | src/cli/bootstrap.rs:5605-5613 \u2014 both copies are in the same file, so extract the block 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":"src/cli/bootstrap.rs"},"region":{"startLine":4641}}}],"partialFingerprints":{"codehealthFindingId/v1":"4073a793cad377e751a3069bc13395a19501a997c0e9074714877f364b541090"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/dotfiles/track.rs:931-941 | src/cli/dotfiles/track.rs:1005-1014 \u2014 both copies are in the same file, so extract the block 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":"src/cli/dotfiles/track.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e0227a11151645e1b2e2f1553308ace373c9ecad44d212f4c758176ad83b5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/shim.rs:405-414 | src/cli/shim.rs:457-466 \u2014 both copies are in the same file, so extract the block 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":"src/cli/shim.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a7d89bb6d1f40fc6dd6278218e9997c0d971673c1481656651794909c7d863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/config/config_file/mise_toml.rs:967-976 | src/config/config_file/mise_toml.rs:1206-1215 \u2014 both copies are in the same file, so extract the block 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":"src/config/config_file/mise_toml.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fe4fb6b506e4949254b0bbb03d0b00851812aab153342d4831a3146aaa8e50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/hook_env.rs:310-319 | src/hook_env.rs:322-331 | src/hook_env.rs:333-343 \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":"src/hook_env.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3847c2c8e5062629ba68b29ff7fdea58c859698f6f6e815edc791b2abd17e021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/hooks.rs:660-669 | src/hooks.rs:780-789 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fdaf41cbd3bc785408ac2227107b507cff5d6e976bf331ad6254e6bec3e866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/lockfile.rs:2298-2307 | src/lockfile.rs:2334-2343 \u2014 both copies are in the same file, so extract the block 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":"src/lockfile.rs"},"region":{"startLine":2298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24f030550dcf4dce18bf5d025c37ab8ed4b650609a0f56bd0a51617315d8b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/lockfile.rs:2309-2318 | src/lockfile.rs:2345-2354 \u2014 both copies are in the same file, so extract the block 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":"src/lockfile.rs"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c2e812c0dca0c2015edfe076f801033c61590830407639301bbdb161904a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/oci/builder.rs:574-583 | src/oci/builder.rs:711-720 \u2014 both copies are in the same file, so extract the block 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":"src/oci/builder.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f3f156109228d462026e6a537a7b6a4636c8061acf04bcdef2fbad84e47aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/plugins/core/erlang.rs:775-784 | src/plugins/core/erlang.rs:790-797 \u2014 both copies are in the same file, so extract the block 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":"src/plugins/core/erlang.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42add7a2c44e1394df00168c5f25c9d8ac0917715affcf18cfc5cd5bd014903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/shims.rs:1853-1862 | src/shims.rs:1870-1879 \u2014 both copies are in the same file, so extract the block 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":"src/shims.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3659ff89a612be077c896d0646c75c03c42b8b51771b3fc48322561301583f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/task/mod.rs:257-266 | src/task/mod.rs:283-292 \u2014 both copies are in the same file, so extract the block 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":"src/task/mod.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecf236ca7ddd6166b4a77825393232ef4114238dc2f5aec6fe56b5fab79fe72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): src/cli/bootstrap.rs:4314-4322 | src/cli/bootstrap.rs:4344-4352 | src/cli/bootstrap.rs:4364-4372 | src/cli/bootstrap.rs:4405-4413 | src/cli/bootstrap.rs:4423-4431 \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":"src/cli/bootstrap.rs"},"region":{"startLine":4314}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b73b71bac8eda6b387a3ec674f6cc69121690469fb5904a1a8a89daabacb92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/cli/generate/tool_stub.rs:339-347 | src/cli/generate/tool_stub.rs:403-411 | src/cli/generate/tool_stub.rs:881-889 | src/cli/generate/tool_stub.rs:903-911 \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":"src/cli/generate/tool_stub.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd31464086f2b24ab5f642ef77322430efe06eff9147753da2000492b26051b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/toolset/tool_request.rs:228-236 | src/toolset/tool_request.rs:263-271 | src/toolset/tool_request.rs:273-281 \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":"src/toolset/tool_request.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b03c581abb8666dcd08c0348a78bb880c5c658525d8bf8906507b5be92b5c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 3): crates/mise-brew-metadata/src/lib.rs:275-283 | crates/mise-system-packages/src/brew/mod.rs:544-552 | crates/mise-system-packages/src/options.rs:186-189 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-brew-metadata/src/lib.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"5665cec70cb26abf53df9b5ec8677bcd88e8a3906f7f5f853048af3e58892320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-daemons/src/lib.rs:1614-1622 | crates/mise-daemons/src/lib.rs:1672-1680 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-daemons/src/lib.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e352a477f04ad810a261632fd7af440009c4778f122fdbb3a209734246c6af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-oci/src/registry.rs:750-764 | crates/mise-oci/src/registry.rs:1078-1086 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efa7bb56244ff9c29b39de1e21dd80539e2c54ed7319348a7151ee3a2d47c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-system-packages/src/apt_sources.rs:556-564 | crates/mise-system-packages/src/dnf_repos.rs:250-258 \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":"crates/mise-system-packages/src/apt_sources.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"392ccf8c31a7f5d7c45af87ac7d432d95dae96636d31f058a8edb0312fee207d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-system-packages/src/brew/cask/mod.rs:4020-4028 | crates/mise-system-packages/src/brew/cask/paths.rs:352-360 \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":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":4020}}}],"partialFingerprints":{"codehealthFindingId/v1":"6418b2fa5ac8ff33d65fbfd31d3de8db25d385cf638264af46388f5bba0cb809"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-system/src/repos.rs:773-781 | crates/mise-system/src/repos.rs:794-802 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/repos.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"462fc4b1f5230eb5ca67c5049f7cc00e9241b430f2d9d9cc9ec24199311b9c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-system/src/secrets.rs:105-113 | crates/mise-system/src/services_common.rs:148-156 \u2014 before extracting anything, compare \u0060crates/mise-system/src/secrets.rs\u0060 and \u0060crates/mise-system/src/services_common.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/secrets.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b92d04a3ba9629e0fc5a707e8639e4d762375fe6f7bec71c0245857832d2e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-util/src/cmd.rs:1349-1358 | crates/mise-util/src/cmd.rs:1553-1561 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5eba22125f69d827f842491123328d849ee7b97c1cdb15e5ec5c7a945e9aa6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-util/src/cmd.rs:1743-1751 | crates/mise-util/src/cmd.rs:1767-1775 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acb7402953f1dabcb9139b9228b51e10725aac40d5ef59d68c8a432a0024861"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-util/src/cmd.rs:2151-2159 | crates/mise-util/src/cmd.rs:2189-2197 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06f817994f6b2ce71346ec4efb037bc1d57cb93ec102dc7869586b76f318b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-util/src/file.rs:223-231 | crates/mise-util/src/file.rs:275-283 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/file.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d064846e5f6d90f1a194d61748506703e6a3fb723bd7a77c78a7e26d7cdd8c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-util/src/github/sigstore.rs:645-653 | crates/mise-util/src/github/sigstore.rs:767-775 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/github/sigstore.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"45909c69b02c4b72e012221b9e11598541fc81b1572475f0ab641c1c50df0ff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-util/src/http.rs:1836-1844 | crates/mise-util/src/http.rs:1945-1953 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/http.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fab32e376e5fbb5a673ca0cf01572fcff85c31deed6371fca6479387431b2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vfox/src/lua_mod/http.rs:394-402 | crates/vfox/src/lua_mod/http.rs:436-444 \u2014 both copies are in the same file, so extract the block 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":"crates/vfox/src/lua_mod/http.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45dc1b5ab80816825c94a2067cdfa37dcd620cf6c9ffbc84ff9d40bd222321c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/backend/conda.rs:1015-1022 | src/backend/conda.rs:1182-1190 \u2014 both copies are in the same file, so extract the block 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":"src/backend/conda.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0068226ac79c11716688922d699b548d4484498ac30c3c93df87324db0edc26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/backend/github.rs:2322-2330 | src/backend/github.rs:2513-2520 \u2014 both copies are in the same file, so extract the block 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":"src/backend/github.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a97189b3d43a1c995b6e366f5b37535e4ca37456e6c9ef4c260546cbf2fc225"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/backend/go.rs:447-455 | src/backend/go.rs:470-478 \u2014 both copies are in the same file, so extract the block 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":"src/backend/go.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2adcdebbd3b48b983f9aff7c96b573ff74edd74425bfe0b333e97c4328bebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/backend/jq.rs:70-78 | src/backend/jq.rs:196-204 \u2014 both copies are in the same file, so extract the block 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":"src/backend/jq.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34a45bc6eefe58ff0b5370611411e5695efe7e653ce43fc1e3de3ac728a1ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/cli/bootstrap.rs:4853-4861 | src/cli/bootstrap.rs:6004-6011 \u2014 both copies are in the same file, so extract the block 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":"src/cli/bootstrap.rs"},"region":{"startLine":4853}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1df9c2604b2ba99c37f7fa093a4b440b1dc17d3d517813535522fca7cc6731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/doctor/mod.rs:697-705 | src/cli/doctor/mod.rs:1198-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":"src/cli/doctor/mod.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd12dc9428c16bb82ab15308555d909f54bf2cd1bbf7f36b3d2ab99e7a43ee38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/lock.rs:986-994 | src/cli/lock.rs:1110-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":"src/cli/lock.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffba35d692804375f7c4fc47948a4a55be01e6175c000452801b18fbb74adff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/lock.rs:2014-2022 | src/cli/lock.rs:2328-2336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2664a2aa536b2a1b11f9156a5c49fb4bb4343ce083f46639df86efea00e4e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/settings/ls.rs:267-275 | src/cli/settings/ls.rs:281-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":"src/cli/settings/ls.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"709706177bd4687a18f6196ebcf1fd34046a09fca3c2da56051156c46ecd7d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/install_before.rs:208-216 | src/install_before.rs:218-226 \u2014 both copies are in the same file, so extract the block 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":"src/install_before.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d59fd55f38e2c38f0a31b89eb87d21e7a2238184189f9011c0ee89bee6c9b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/lockfile.rs:740-748 | src/lockfile.rs:983-991 \u2014 both copies are in the same file, so extract the block 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":"src/lockfile.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dad26d7b6a0eadd319fc030c51e85785ccecc3f1637e3939921ee975652d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/oci/builder.rs:606-614 | src/oci/builder.rs:672-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/oci/builder.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ee0faec09098d46e977977e298e64db65797c54d93c51216b81b6c9a474d10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/oci/builder.rs:606-614 | src/oci/builder.rs:686-694 \u2014 both copies are in the same file, so extract the block 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":"src/oci/builder.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"933a9f2f27c18b4170056729edbf72ea4bbb7f50693c1fc4bb0152bc1e39888c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/oci/builder.rs:672-680 | src/oci/builder.rs:700-708 \u2014 both copies are in the same file, so extract the block 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":"src/oci/builder.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"09611478f551418004aae6b327e6d19e97714e4c5c2f031d28bb2aac4883655c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/plugins/core/erlang.rs:386-394 | src/plugins/core/erlang.rs:478-486 \u2014 both copies are in the same file, so extract the block 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":"src/plugins/core/erlang.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"1958da3c6b0c6331123c544cddb39a82189d0516603bc000439d1b8ddef7d114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/plugins/core/rust.rs:521-529 | src/plugins/core/rust.rs:561-568 \u2014 both copies are in the same file, so extract the block 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":"src/plugins/core/rust.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"f580ee247958ddd9cb0163ea9b3f3e61dcda64b6351553cb5379850be87ff618"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/task/mod.rs:2460-2468 | src/task/mod.rs:3107-3115 \u2014 both copies are in the same file, so extract the block 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":"src/task/mod.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"5058f7bc584fbfdc03433bc591787f3e94156c1533f24f9a99ccf43392e7cc7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/task/task_executor.rs:2626-2632 | src/task/task_executor.rs:2944-2952 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_executor.rs"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd2cbdc6335bc5b19b2c17f01c895f12ecf2f221a3d2188694b3dd120782d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/task/task_script_parser.rs:496-504 | src/task/task_script_parser.rs:675-684 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_script_parser.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc1e39fabc61d97a94ae4862783edcd0b5fadc300edf20995e3137354ef0bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/task/workspace/gradle.rs:388-396 | src/task/workspace/gradle.rs:538-546 \u2014 both copies are in the same file, so extract the block 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":"src/task/workspace/gradle.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"3680de6a79c80823f39e090e2ff954b7221f9d69af8ad52e1f6e8b01b32535b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/toolset/tool_request.rs:346-354 | src/toolset/tool_request.rs:465-473 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/tool_request.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed23ea57774fb8d4e29713ebae8989aacacdc621345799670ceb77dcd9b1742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/ui/tree.rs:95-103 | src/ui/tree.rs:138-146 \u2014 both copies are in the same file, so extract the block 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":"src/ui/tree.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7396acc009273771d94206a6ef9e91224b06f2fb26fbdef83caad80f5113109d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/mise-util/src/forgejo.rs:202-209 | crates/mise-util/src/github.rs:1576-1583 | crates/mise-util/src/gitlab.rs:353-360 \u2014 before extracting anything, compare \u0060crates/mise-util/src/forgejo.rs\u0060 and \u0060crates/mise-util/src/github.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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":"crates/mise-util/src/forgejo.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"616ee054af731b55dc0969f6d00b6f0d3ad65543ee4bf80a5cc14f0bf85f5de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/task/task_executor.rs:1745-1752 | src/task/task_executor.rs:1979-1986 | src/task/task_executor.rs:2392-2399 \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":"src/task/task_executor.rs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b760cdca786b254dd56e0816aafa375d1eb42a05264a728617a025b111dd72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-lsp/src/doc.rs:65-72 | crates/mise-lsp/src/doc.rs:93-100 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-lsp/src/doc.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc46eae44eeb08ab066fa4e9fc6174e76e40eaf535e8535be1a68b174883ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-system-packages/src/apk.rs:108-115 | crates/mise-system-packages/src/apk.rs:120-127 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system-packages/src/apk.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"331eafe1ec5464142ffa43bcf6d3ebf02cff8c2a92de897ce090fa2e8fc56fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/mise-system-packages/src/aur.rs:127-134 | crates/mise-system-packages/src/winget.rs:158-164 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/aur.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"df98ebd2a8d9844099fc6b82adc7ea2dc312228c12deaa10f0abb6767a3313c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-system-packages/src/flatpak.rs:153-160 | crates/mise-system-packages/src/flatpak.rs:173-180 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system-packages/src/flatpak.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"82838d1e417423748b364c499c81da6df7adce5c5950b5eaef61561039edb31d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-system/src/accounts.rs:797-804 | crates/mise-system/src/services.rs:479-486 \u2014 before extracting anything, compare \u0060crates/mise-system/src/accounts.rs\u0060 and \u0060crates/mise-system/src/services.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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":"crates/mise-system/src/accounts.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c60272d8ac7ef174f17c15d1530e093d7682446b636d2a17eada0fb892ba291"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-system/src/firewall.rs:219-226 | crates/mise-system/src/managed_files.rs:1428-1435 \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":"crates/mise-system/src/firewall.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c153139630d91f342ad38916ea65bfdb6ce6e9cdedda972f26820cb59dc9e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-system/src/history/store.rs:1016-1023 | crates/mise-system/src/history/store.rs:1206-1213 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/history/store.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb98017f3ff0a4ee5fc0476ca2ac050e74108dcb62489e420b1beb5eff83236d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-system/src/history/watch/runtime.rs:273-280 | crates/mise-system/src/history/watch/runtime.rs:290-297 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abfadaddeb4e8a49228f8af3f2432affa992428c8759ae6ea3f242e1c637d7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-util/src/cmd.rs:1285-1292 | crates/mise-util/src/cmd.rs:1301-1308 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8f8b6ce79a40a21f9ad6c4d525d2538d7906c3204b7615daf8393225448a4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-util/src/cmd.rs:1492-1499 | crates/mise-util/src/cmd.rs:1511-1518 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1492}}}],"partialFingerprints":{"codehealthFindingId/v1":"5820b88f38d90a7308a1f34dfcbf575d89feb52345219676a0bb707ee90f7df5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-util/src/cmd.rs:1894-1901 | crates/mise-util/src/cmd.rs:1954-1961 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1894}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea2b59d9736a4b7741094e71c5e0817f5b141aef8f80ab1027fe39df3b00790"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-util/src/file.rs:1562-1569 | crates/mise-util/src/file.rs:1582-1589 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/file.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"367c593af257a413808d5ff5b64ae9765c57a5083bb00d72b25d3bfa94b9700e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/backend/conda.rs:479-486 | src/backend/conda.rs:578-585 \u2014 both copies are in the same file, so extract the block 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":"src/backend/conda.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"8097129a246cfe335bc42a234f33e97b95998c0db711238bd434b6f91269cee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cli/sync/node.rs:89-96 | src/cli/sync/ruby.rs:62-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/sync/node.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3488a8e40ee31a771bf84f8e6daa2b82c4dcb6f49c288583f5e9be53dfdc3c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cli/system/import.rs:288-295 | src/config/config_file/mise_toml.rs:1091-1098 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/import.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35f55dfdb2b749b3bbba5cc6121866c70bb6d5079a4dfeab59424d4acead49b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cli/system/install.rs:88-95 | src/cli/system/upgrade.rs:63-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/install.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"450fc70d2eeec5a6f80262505aa5a41dae97f0dd8cafa1ce7a9f4e657a1c5fb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/config/env_directive/mod.rs:341-349 | src/config/env_directive/mod.rs:412-419 \u2014 both copies are in the same file, so extract the block 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":"src/config/env_directive/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd0edb4671657a19fc3d6852e297cb56b0273f3bbdbf1893aa2156cf5005c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/plugins/core/bun.rs:249-256 | src/plugins/core/zig.rs:438-444 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/bun.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cab7d3a60cd8048d9c9a6d91623b346f417ea9ac5e42809384a8403560eca71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/plugins/core/erlang.rs:428-435 | src/plugins/core/java.rs:279-286 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/erlang.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb0677c78209ca7bb0adfc1c18aecf911febcc1cbe981a5e4ff137ee281994a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/mise-system/src/history/watch/runtime.rs:402-408 | crates/mise-system/src/history/watch/runtime.rs:470-476 | crates/mise-system/src/history/watch/runtime.rs:597-603 | crates/mise-system/src/history/watch/runtime.rs:700-706 \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":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"855aa9eb7b86225c843b03c65d6ca49ae71bf9cf571f39f241cd9bd8144fa78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/mise-util/src/github.rs:578-584 | crates/mise-util/src/github.rs:621-627 | crates/mise-util/src/github.rs:1222-1228 | crates/mise-util/src/gitlab.rs:122-128 \u2014 before extracting anything, compare \u0060crates/mise-util/src/github.rs\u0060 and \u0060crates/mise-util/src/gitlab.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"crates/mise-util/src/github.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bd72fadc7b9aaa4cd85200e078279ce81d54222d869f7916b5876efd5342d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/mise-util/src/github.rs:972-978 | crates/mise-util/src/gitlab.rs:242-252 | crates/mise-util/src/gitlab.rs:299-306 \u2014 before extracting anything, compare \u0060crates/mise-util/src/github.rs\u0060 and \u0060crates/mise-util/src/gitlab.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"crates/mise-util/src/github.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bffd5db0909eecb5d9c510c6625d53d684bf27975bca536e3dea9592136fba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/vfox/src/hooks/backend_exec_env.rs:37-43 | crates/vfox/src/hooks/backend_install.rs:36-43 | crates/vfox/src/hooks/backend_uninstall.rs:30-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfox/src/hooks/backend_exec_env.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"43711467b6ed56309a65729f2e08707f362a64c0351c0f13b2bc55a63effbc50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/backend/github.rs:1528-1534 | src/backend/github.rs:1663-1669 | src/backend/github.rs:3189-3195 \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":"src/backend/github.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5fbc159ec429dcfb382362b900f6560021c0f05fb1812ae3e2a36c9cf08eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/aqua-registry/src/types/matchers.rs:119-125 | crates/mise-util/src/semver.rs:12-18 \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":"crates/aqua-registry/src/types/matchers.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1463b6fc508424e0a877d3e740f3bb4fe2b89acae852cdb290223600ba95be7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-lsp/src/includes.rs:284-290 | crates/mise-system/src/files.rs:2459-2465 \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":"crates/mise-lsp/src/includes.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0063d5acc067b51a2b433df52897b91fa9d4573438afa42ccfb8e9b8fd84bfab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-lsp/src/schema.rs:239-245 | src/config/schema.rs:68-74 \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":"crates/mise-lsp/src/schema.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a726cbc39560f81d5ba5a8d2e99268d3edd88a9f0a27793e0d903552c7409cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-shim/src/windows_process.rs:165-171 | crates/mise-util/src/windows_process.rs:100-106 \u2014 before extracting anything, compare \u0060crates/mise-shim/src/windows_process.rs\u0060 and \u0060crates/mise-util/src/windows_process.rs\u0060 as WHOLE FILES: this scan already matched 7 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":"crates/mise-shim/src/windows_process.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"122b92d76af932b9407c9d6d54b9619dc05078c2a5158bbdab9115345217feb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-system-packages/src/choco.rs:81-87 | crates/mise-system-packages/src/scoop.rs:356-362 \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":"crates/mise-system-packages/src/choco.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1629d15b505d757512d54c0356440a68ab3f25d0964ec433517e2909d3ce14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-system-packages/src/flatpak.rs:132-138 | crates/mise-system-packages/src/snap.rs:188-194 \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":"crates/mise-system-packages/src/flatpak.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"befe3c404919e4b38bb306e6881ae90aacaaca0c556a4d2b3544111f40539f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-system/src/files.rs:5086-5092 | crates/mise-system/src/files.rs:5111-5117 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/files.rs"},"region":{"startLine":5086}}}],"partialFingerprints":{"codehealthFindingId/v1":"e101e9c52c7e1372df2a7a29e5a84c22848bb41a753a907a0ee200d886fa7c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-system/src/history/shadow.rs:1674-1681 | crates/mise-util/src/cmd.rs:320-326 \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":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae6a8d5e25d9b80409311be7f61a9c9c86ff5c24df2541a9938ce5af60bd5ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-system/src/lib.rs:1028-1034 | crates/mise-system/src/lib.rs:1648-1654 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/lib.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"2158db308a6b5e52ab36d6282d0d5604c79377a6fca5eb9f577608c7ab34f039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-util/src/cmd.rs:1923-1930 | crates/mise-util/src/cmd.rs:1976-1982 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7f2ce55f35ec9093ac236492087bf6591a928289dc1a2cbf36b177b5e241ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-util/src/env_diff.rs:244-250 | src/hook_env.rs:616-622 \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":"crates/mise-util/src/env_diff.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b8ad857bafd33138f5b82b945eac186192a9abe1f7487f9f1f3d1bc6fb5ffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-util/src/github.rs:977-983 | crates/mise-util/src/github.rs:1142-1148 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/github.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"d750add1dac7a53db0054d21daaecc3ecfa8496b78ca1b96e62a1e379e2a55f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/vfox/src/lua_mod/http.rs:309-314 | crates/vfox/src/lua_mod/http.rs:368-374 \u2014 both copies are in the same file, so extract the block 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":"crates/vfox/src/lua_mod/http.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"affd5ad4df65f43d04aafd7a4fbf39ba136a2e3bee7febf879f3c6e00becd097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/args/backend_arg.rs:736-742 | src/args/backend_arg.rs:1015-1021 \u2014 both copies are in the same file, so extract the block 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":"src/args/backend_arg.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee75968806761b4a181ad696c4c45a595a917923d2e76feeea4eaa3d73c315b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/backend/aqua.rs:840-845 | src/backend/aqua.rs:1188-1194 \u2014 both copies are in the same file, so extract the block 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":"src/backend/aqua.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ef7be3518311aa9686c5fc20f439e98e13e1194316bccca77b92c1b6a37617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/backend/aqua.rs:2338-2344 | src/backend/aqua.rs:2413-2421 \u2014 both copies are in the same file, so extract the block 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":"src/backend/aqua.rs"},"region":{"startLine":2338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d9efbf115b71221bc9073a9fc6a4083040af26a88c018a93ee8c0b5fcda259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/backend/http.rs:1096-1102 | src/backend/s3.rs:417-423 \u2014 before extracting anything, compare \u0060src/backend/http.rs\u0060 and \u0060src/backend/s3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 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":"src/backend/http.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2449eab94bdffdd28168131cfbaac87e6b38f4e2ef6650b997f9a9f85668ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/config/ls.rs:78-84 | src/cli/config/ls.rs:107-113 \u2014 both copies are in the same file, so extract the block 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":"src/cli/config/ls.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4016d356d5025f73bf55fbb78fa5e0cab76c3779bd308b25cd06f6a581934de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/ls.rs:460-466 | src/cli/ls.rs:513-519 \u2014 both copies are in the same file, so extract the block 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":"src/cli/ls.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"5372b4fd5f001e1f56037894bbc6757d453d4caf725d838daa179b624a004974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/cli/mod.rs:623-628 | src/cli/mod.rs:630-636 \u2014 both copies are in the same file, so extract the block 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":"src/cli/mod.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"7673794444805e72e0916d18159bb050c796e4f23f3d6aa9e27d4932449d6e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/upgrade.rs:915-921 | src/cli/upgrade.rs:1116-1122 \u2014 both copies are in the same file, so extract the block 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":"src/cli/upgrade.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d01c0b367bd3dcaa1578dc693e4d9a921a5421028237fb1a50588fa9333563"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/config/config_file/mise_toml.rs:279-285 | src/config/config_file/mise_toml.rs:288-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mise_toml.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f51c05d016a7563ed884bf56ce91a27f4547cc7b15907f75c386b4ff1d62e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/config/mod.rs:1663-1669 | src/config/mod.rs:1806-1812 \u2014 both copies are in the same file, so extract the block 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":"src/config/mod.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"735cdfe55469bb14aa256e5eb2d8bfc029f2d35d6f75625b42a2dcf218d3f0d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/config/mod.rs:7429-7435 | src/config/mod.rs:7441-7447 \u2014 both copies are in the same file, so extract the block 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":"src/config/mod.rs"},"region":{"startLine":7429}}}],"partialFingerprints":{"codehealthFindingId/v1":"d658b6b07814af71194ef8765ebf4c6823ccc93beff193b321ad1126723e713f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/deps/rule.rs:65-71 | src/deps/rule.rs:158-164 \u2014 both copies are in the same file, so extract the block 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":"src/deps/rule.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"940208e692a88775a19e434683048a5bcaab4a51d6c37d52c74f6948574c84e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/lockfile.rs:3190-3195 | src/lockfile.rs:4992-4998 \u2014 both copies are in the same file, so extract the block 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":"src/lockfile.rs"},"region":{"startLine":3190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6a5af0088d8141c6e809fc90367af1c1cffd5726175d1a55cb64c1edbf3960"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/plugins/core/erlang.rs:447-452 | src/plugins/core/erlang.rs:509-515 \u2014 both copies are in the same file, so extract the block 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":"src/plugins/core/erlang.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bff8f7037d9dbf777dac161a6acfbe3d33537876d6dce93d2d67db4bb8237bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/plugins/core/ruby.rs:313-319 | src/plugins/core/ruby_windows.rs:82-88 \u2014 before extracting anything, compare \u0060src/plugins/core/ruby.rs\u0060 and \u0060src/plugins/core/ruby_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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":"src/plugins/core/ruby.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"547455c3041bd73ecd9043b83049cf3a21e3ad9690577522103a5ddfcbbddf5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/task/task_context_builder.rs:361-367 | src/task/task_context_builder.rs:376-382 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_context_builder.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffb6278323ea3328f1710e04e7245323148c02be5262e28c32b214bc58a9887"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/task/workspace/cargo.rs:114-120 | src/task/workspace/uv.rs:108-114 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/cargo.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfa29756d0c99621df80206fad055872bcd664fac97ca2aed8f4a06bccc5272"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/watch_files.rs:231-237 | src/watch_files.rs:300-305 \u2014 both copies are in the same file, so extract the block 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":"src/watch_files.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4345cf014ab6d61a4b0599f7b5a9cd81a7577065dda29c28e8a1f67e8e905a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): crates/vfox/src/lua_mod/http.rs:308-313 | crates/vfox/src/lua_mod/http.rs:333-338 | crates/vfox/src/lua_mod/http.rs:367-372 | crates/vfox/src/lua_mod/http.rs:393-398 | crates/vfox/src/lua_mod/http.rs:435-440 | crates/vfox/src/lua_mod/http.rs:475-480 \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":"crates/vfox/src/lua_mod/http.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"feca858c02a9c62d06a94d60235638d634f133b73a2d8f111b078801cb0b2bb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): src/config/mod.rs:1710-1715 | src/config/mod.rs:4539-4544 | src/task/mod.rs:2433-2438 | src/task/task_context_builder.rs:577-582 | src/toolset/toolset_env.rs:686-691 \u2014 there are 5 copies across 4 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":"src/config/mod.rs"},"region":{"startLine":1710}}}],"partialFingerprints":{"codehealthFindingId/v1":"843af604facbfae7ca03e558734506765b5c2b73942614996a7a6bf2dc279ca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): src/cli/bootstrap.rs:3578-3583 | src/cli/bootstrap.rs:3689-3694 | src/cli/bootstrap.rs:3831-3837 | src/cli/bootstrap.rs:3940-3945 \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":"src/cli/bootstrap.rs"},"region":{"startLine":3578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9be90b007be23ce3e51a8bbe98e321ec9953c16e778a8f85e079cb0198f7f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-brew-metadata/src/lib.rs:263-268 | crates/mise-brew-metadata/src/lib.rs:307-312 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-brew-metadata/src/lib.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b4b267978d41e7c7d0cebe21d49d51ff51f95d9ef11feb142a4e0b5b37f500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-config/src/min_version.rs:106-111 | crates/mise-config/src/min_version.rs:116-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/min_version.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0986d9ab54d551bb8a55b900cd476751a7398a216654f5c0d22064594b8f7f39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-dotenv/src/key.rs:82-89 | crates/mise-util/src/env.rs:1240-1245 \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":"crates/mise-dotenv/src/key.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4542c233f1eec4c5809ad2275ff223cdb0ba7bb30b14f4517543af4b211a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-system/src/accounts.rs:904-909 | crates/mise-system/src/accounts.rs:948-953 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/accounts.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b054d72d392d5a934c0acd28ea3bcef023b24ab952da8af2bc5a7e150fc38f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-system/src/history/tracked.rs:1269-1274 | crates/mise-system/src/history/tracked.rs:1287-1292 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a918d0b2a8ded195d4e794922b295ce3a7988ff4d26b3178d6c15ba82fdb596b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-system/src/scheduled_tasks.rs:671-676 | crates/mise-system/src/scheduled_tasks.rs:721-726 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/scheduled_tasks.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c1933f46295353ae5aca86f9231116664b23776d67eaf1ccd0cae6d546a04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-ui/src/sudo.rs:311-316 | crates/mise-ui/src/sudo.rs:340-345 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-ui/src/sudo.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcac4fc1d06834f67d9045aa5e7619b478d9c12c94e5e25cda9ddeb810b02585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-util/src/agecrypt.rs:325-330 | crates/mise-util/src/agecrypt.rs:356-361 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/agecrypt.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"053e5e79a8a95bfcc4041e697f5d0d7c0451fb357aff5eea7b243192a5290cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-util/src/cmd.rs:2025-2030 | crates/mise-util/src/cmd.rs:2055-2060 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"119bbc2c182a2753f9f000a770d00833e566731726189e4143e2aef5d85c9a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-util/src/errors.rs:68-73 | crates/mise-util/src/errors.rs:88-93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/errors.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"08972bf6fa5c77f1b6a35882694115aeda9d654f58c72d2395159e76a42e4d63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-util/src/file.rs:750-755 | crates/mise-util/src/github/oauth.rs:1012-1017 \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":"crates/mise-util/src/file.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"b714fb7edb4562e023a244376b42cdd1ea994fcd6843867118106a86b8cc656f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-util/src/tera.rs:1905-1910 | crates/mise-util/src/tera.rs:2026-2037 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/tera.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a13fd899f29266b180ab2d6b88753633a8555322679a4b26468c8676712c642"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/backend/aqua.rs:3525-3530 | src/plugins/core/ruby.rs:718-723 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":3525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e0d98821ff76421d64d09eec9d42a0cf03804648163ac6425b76edcaca19b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/backend/cargo/native_binstall.rs:106-112 | src/backend/cargo/native_binstall.rs:161-166 \u2014 both copies are in the same file, so extract the block 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":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8933fd7548679c4f2c38f4c4ab9c27d23088e8af405a3f162d7d572573dc14bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/bootstrap.rs:4587-4592 | src/cli/system/status.rs:131-136 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":4587}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e0a7146174a93e6195cfc7d831f5b33007918d67dfa79b067ec861e3f8e088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/lock.rs:1348-1353 | src/cli/upgrade.rs:915-920 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/lock.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"64303824433ca127985f7f638508dfb601ec83cb6a1dc9e9f2bc19705e0a9329"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/tasks/validate.rs:868-873 | src/cli/tasks/validate.rs:882-887 \u2014 both copies are in the same file, so extract the block 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":"src/cli/tasks/validate.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b02e891c47969e79ffa15714191d46f950ec588c59d665d3e5c204f11855f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/config/mod.rs:3086-3091 | src/config/mod.rs:3403-3408 \u2014 both copies are in the same file, so extract the block 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":"src/config/mod.rs"},"region":{"startLine":3086}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46b95a966687f6f34a9ab5c8357f2f4abb5a6831cd0e0a5b3e2f6639f968a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/oci/builder.rs:807-812 | src/oci/builder.rs:814-819 \u2014 both copies are in the same file, so extract the block 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":"src/oci/builder.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a3b00bc0ec9208c5097bafab6c12409278aba78d781fbde34a316d8750bd5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/plugins/asdf_plugin.rs:274-279 | src/plugins/vfox_plugin.rs:338-343 \u2014 before extracting anything, compare \u0060src/plugins/asdf_plugin.rs\u0060 and \u0060src/plugins/vfox_plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/plugins/asdf_plugin.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"426e6736d7ddb46eebadd505ab5dacb61a337ab6d2ca796a9ef51292ae2f2acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/plugins/core/deno.rs:160-165 | src/plugins/core/go.rs:320-325 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/deno.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9eee69fee10fda0951e7fbb8a5c8a79083239057f21e2d0eca7a5fb6dfede50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/plugins/core/rust/nightly_channel.rs:221-226 | src/plugins/core/rust/nightly_channel.rs:248-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/rust/nightly_channel.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5276ffc098570d4b6e21715b2d69f04ea6f83566d431895880aead1777ff0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/task/mod.rs:2361-2366 | src/task/mod.rs:2422-2427 \u2014 both copies are in the same file, so extract the block 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":"src/task/mod.rs"},"region":{"startLine":2361}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45549d91a6c0731d9917a4f118823fb840745d0d9e77c9226c068b5ac8085d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/mise-system-packages/src/brew/cask/state.rs:906-910 | crates/mise-util/src/file.rs:237-241 | crates/mise-util/src/file.rs:285-289 \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":"crates/mise-system-packages/src/brew/cask/state.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd3fb8ace3c6a6818b045d5db5d31839c50c42e92db7f78185bdd194c52511e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/mise-util/src/http.rs:643-647 | src/task/task_cache.rs:1120-1124 | src/task/task_cache_store.rs:941-945 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a7c8e9b7fa8f46f1c4a23b81fb599539ccbb870522d79abc420d5955708d75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/aqua-registry/src/types/matchers.rs:113-118 | crates/mise-util/src/semver.rs:7-11 \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":"crates/aqua-registry/src/types/matchers.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f0fe21b3b7b8aa4b31cbe01b661be4bce3ada677596a361003f9962daed50d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-brew-metadata/src/lib.rs:248-252 | crates/mise-brew-metadata/src/lib.rs:305-309 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-brew-metadata/src/lib.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48d0942196c57fff9c218f2ade2540d8b1107989af783fbf4ba528bafac7a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-lsp/src/schema.rs:249-253 | src/config/schema.rs:78-82 \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":"crates/mise-lsp/src/schema.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"430d35af4ede19bdd76876901bd4b8f8786be89813c9937ccd6cf340cbaec780"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-oci/src/docker_archive.rs:41-45 | crates/mise-oci/src/registry.rs:1326-1333 \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":"crates/mise-oci/src/docker_archive.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d04a63051ce34bfe3f41f2015773c4ebbc170d63f6094b5f431f40c6760d0ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-system/src/files.rs:1039-1043 | crates/mise-system/src/files.rs:1424-1428 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/files.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"f120b926c827591e80bd6b0521b7b314b2af6bfa5dbce04191f0415d521b961f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-ui/src/text_install_progress.rs:860-864 | crates/mise-ui/src/tty_install_progress.rs:470-474 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-ui/src/text_install_progress.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf87d284dd11e13123b99a39d3a2f1d0e5a4f3e32e340f9561c532fe599695f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/backend/aqua.rs:2332-2336 | src/backend/aqua.rs:2403-2407 \u2014 both copies are in the same file, so extract the block 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":"src/backend/aqua.rs"},"region":{"startLine":2332}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5c5e3fdc1703bb789081ed00e2917bbd0d4dfc940b5dbce2c6dd7dd2deb92a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/backend/github.rs:256-260 | src/backend/spm.rs:123-127 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40369ff5ee9dfd37262adbb0aab7a6d8ce0aa2025fb088bd46d35eff341d7da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/backend/github.rs:2167-2171 | src/backend/s3.rs:714-718 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/github.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4ca50d3dedf7fa1f832ba1d616308a2f9c8071f04941e63608b4fbfd27ac75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/backend/packslip.rs:1562-1566 | src/backend/packslip.rs:1606-1610 \u2014 both copies are in the same file, so extract the block 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":"src/backend/packslip.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"abab2dc835d0bb4ef9bb8db212ff07cc28d7f6029008be923ee48a82394c700d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/dotfiles/pull.rs:86-90 | src/cli/dotfiles/sync.rs:47-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/pull.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d84835a3ca471a972f5bf6c567482dd93ffff37a203009b34dc910640e671e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/shell_alias/mod.rs:37-41 | src/cli/tool_alias/mod.rs:51-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/shell_alias/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ecb05609598371f9396302c235f41d3e15b5b6e251e1a851726fbe7b55eebe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/config/config_file/mise_toml.rs:338-342 | src/config/config_file/mise_toml.rs:371-375 \u2014 both copies are in the same file, so extract the block 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":"src/config/config_file/mise_toml.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"487a960ed759327ba0d50fdce08b4188c189b498b4851f5853aad30288c12a2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/config/config_file/mise_toml.rs:1284-1288 | src/config/env_directive/mod.rs:861-865 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mise_toml.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65e98bf9fc8a16640d33d7f4d4765976f1cdca169f70783a185ea6bd026b67a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/config/mod.rs:1640-1644 | src/toolset/toolset_env.rs:423-427 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50fb9cf75ed36123445f503ebf0e87c5cb9d6fcb4b268f56d7c6930670b8d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/config/mod.rs:7263-7267 | src/config/mod.rs:7795-7799 \u2014 both copies are in the same file, so extract the block 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":"src/config/mod.rs"},"region":{"startLine":7263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc68aad2d9cf307a1a84b3fe33c0eff7303dc29333fc70fa9d8acfa2752570f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/config/mod.rs:7415-7419 | src/config/mod.rs:7421-7425 \u2014 both copies are in the same file, so extract the block 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":"src/config/mod.rs"},"region":{"startLine":7415}}}],"partialFingerprints":{"codehealthFindingId/v1":"57602a8d3dc1769336d21df4224df2b08c32214f3eb20e6c371334e59f73adbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/aqua-registry/src/cache.rs:141-145 | crates/mise-util/src/hash.rs:79-83 \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":"crates/aqua-registry/src/cache.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"808348eb4000ea89004a6ee04ede9842cb71572a9e1bf8ac72c8f6d8edfab58f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/aqua-registry/src/cache.rs:147-151 | crates/mise-util/src/hash.rs:29-33 \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":"crates/aqua-registry/src/cache.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1796ca9193b178913f715e0b872f8a9cef918d17ae6aedb6c8820cc2ea7dd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-cache-core/src/retry.rs:18-27 | crates/mise-util/src/http.rs:3616-3625 \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":"crates/mise-cache-core/src/retry.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"544ac8c6767bab7568800bc60c875954e3426fc82897e2697e22aed43d2091e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-system-packages/src/apk.rs:48-53 | crates/mise-system-packages/src/pacman.rs:223-228 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/apk.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f300a9f278da2acd809e57f6f4864e9ef569dc3d011b486f1bbca778a9474a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-system-packages/src/apt_sources.rs:828-839 | crates/mise-system-packages/src/dnf_repos.rs:407-418 \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":"crates/mise-system-packages/src/apt_sources.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c22dbc842c72434f594ecf1ed9f3f980b60b8cd8e55163d396467091343fd2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-system-packages/src/choco.rs:194-200 | crates/mise-system-packages/src/winget.rs:241-247 \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":"crates/mise-system-packages/src/choco.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2f58c818823f7fa1f1714be678b09b39bbf4ec44eb1301426703bfc47ba70a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-system/src/accounts.rs:642-650 | crates/mise-system/src/launchd.rs:460-468 \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":"crates/mise-system/src/accounts.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"454095a0afc83fa6f8a82a014b94d02f06f27f1dbe8dddcbc94010e8118745eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/mise-system/src/files.rs:2815-2820 | src/cli/dotfiles/add.rs:859-864 | src/plugins/core/go.rs:512-517 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/files.rs"},"region":{"startLine":2815}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81d3c02f1ad48e9fcf4a78a4d9ce60a2a9eefdf9994cfea9efc9067d967b62f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-system/src/firewall.rs:1688-1693 | src/backend/aqua.rs:4260-4264 \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":"crates/mise-system/src/firewall.rs"},"region":{"startLine":1688}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd2f9d373b8a5bb18013fbacd4a163199585b071941d3844e5cd0a10f5091b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/mise-system/src/history/tracked.rs:2441-2453 | src/config/env_directive/file.rs:131-143 \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":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"705e98e7f25c393555efebe61bd805486da20d0c29e86beede684ffa6a5e02dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-system/src/launchd.rs:427-432 | crates/mise-system/src/user_services.rs:293-298 \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":"crates/mise-system/src/launchd.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fd2f78ef0abea952fac3c895ddd55c6c6d75c3d5735d7b2cf57c47e394717e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-system/src/scheduled_tasks.rs:435-442 | crates/mise-system/src/systemd.rs:867-874 \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":"crates/mise-system/src/scheduled_tasks.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20b51d192cea4d55d5b2c14a6190fa5959b8685c76f24a21809a8ca0b8be481"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-ui/src/text_install_progress.rs:791-796 | crates/mise-ui/src/tty_install_progress.rs:153-158 \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":"crates/mise-ui/src/text_install_progress.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf15ba46240d95b14883ec29dcbbb744806925cef6890bf23c9a08d33ca73757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-util/src/file.rs:2326-2333 | src/backend/mod.rs:8743-8750 \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":"crates/mise-util/src/file.rs"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0257886113e05d9f0c96b798006a878eeb1b59a9129f701e775ba29abfd815d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-util/src/forgejo.rs:110-114 | crates/mise-util/src/github.rs:338-342 \u2014 before extracting anything, compare \u0060crates/mise-util/src/forgejo.rs\u0060 and \u0060crates/mise-util/src/github.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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":"crates/mise-util/src/forgejo.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0804fcbf7519b9b4d9b06fea21054f12b04441b1f044257d50e3778de31eee94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-util/src/github.rs:1352-1357 | src/packslip.rs:159-164 \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":"crates/mise-util/src/github.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a267436e62b77ec42e70d94a587e4184613979f0bfcd950f681ff939ceddab30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/vfox/src/hooks/mise_env.rs:51-56 | crates/vfox/src/hooks/mise_path.rs:31-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfox/src/hooks/mise_env.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ceb999c2cbc97efa378224992c1ffc26080838f76ce64ab489592989ed16d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/cache/task.rs:145-151 | src/cli/ls.rs:775-781 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/cache/task.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"936459462779b69e76ff3afd381b2c29f8437944b4a33e0011998e8f5124eccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/cli/config/explain.rs:67-75 | src/cli/config/get.rs:53-61 | src/cli/config/set.rs:120-128 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/config/explain.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2537153f19ed13985a6a4f887142005f55129537a10c7e4a99abf27cd5b57934"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/upgrade.rs:1609-1613 | src/install_context.rs:108-112 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/upgrade.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43debf79a05b30be65234eee702165a9d309a6133a8a7f4dbe49e86db240a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/plugins/asdf_plugin.rs:259-265 | src/plugins/vfox_plugin.rs:317-323 \u2014 before extracting anything, compare \u0060src/plugins/asdf_plugin.rs\u0060 and \u0060src/plugins/vfox_plugin.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"src/plugins/asdf_plugin.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8620f293034576070461b1cb814d682fe67fec818f02772fa1259da4a791c31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/plugins/core/erlang.rs:916-924 | src/plugins/core/node.rs:1323-1331 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/erlang.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c550bf1b544175f382842fc21b6eff150515a781e4faa106fc32d06b287f9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/plugins/core/ruby.rs:336-342 | src/plugins/core/ruby_windows.rs:121-127 \u2014 before extracting anything, compare \u0060src/plugins/core/ruby.rs\u0060 and \u0060src/plugins/core/ruby_windows.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 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":"src/plugins/core/ruby.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"362f037a0fb2f653ba2768b393225d8d6bce822c6ef3d72f100f50effc36d640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/backend/http.rs:1515-1522 | src/backend/s3.rs:614-621 \u2014 before extracting anything, compare \u0060src/backend/http.rs\u0060 and \u0060src/backend/s3.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 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":"src/backend/http.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d577b60f46e5730dd241d74549cfcf298f0c53c6c057641db5d58110fa46b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/edit.rs:369-374 | src/install_layout/catalog.rs:465-470 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/edit.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"29123e5e57a80401f617a7c273f47789732329aaea8d8ef48cccef8b91c07791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/shell/pwsh.rs:25-166 | src/shell/xonsh.rs:46-64 | src/shell/zsh.rs:23-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell/pwsh.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"649883af9583c47c84d2d65b7ae69debf5909a8d6fe6c79ecd581bc926a77741"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): src/shell/fish.rs:24-68 | src/shell/pwsh.rs:25-166 | src/shell/xonsh.rs:46-64 | src/shell/zsh.rs:23-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell/fish.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"88813610ed4ead2a9910cf1639955f6084f7631175743fce9982741d4cc13781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/system/package_plugin.rs:602-620 | src/system/package_plugin.rs:639-657 \u2014 both copies are in the same file, so extract the block 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":"src/system/package_plugin.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae16efd2f7db66dc396bd9c40af5e444693b25d952d816ea6bf885a9e35a17a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/mise-system-packages/src/brew/tap.rs:74-91 | crates/mise-system-packages/src/brew/tap.rs:134-150 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/tap.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e0ec8690542fc0f875475b8aebb6f01d5cfd90f254f0ffce8579bd5e8943ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-system-packages/src/apt_sources.rs:119-134 | crates/mise-system/src/systemd.rs:182-191 \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":"crates/mise-system-packages/src/apt_sources.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8b5d92ec73e1b95b2202859c03c3aad35e3e333c4b43cf4e923150c168ed1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/tool_catalog.rs:298-311 | src/tool_catalog.rs:346-359 \u2014 both copies are in the same file, so extract the block 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":"src/tool_catalog.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2bdbf8b46cca3acd99423c799fa5522ddd2db117dcf38adeb54ad020d3deaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/shell/fish.rs:192-205 | src/shell/fish.rs:216-229 \u2014 both copies are in the same file, so extract the block 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":"src/shell/fish.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"856b89c548e78de2e08ba5ece039ad61178736eee59f50d90c51bb37849c87f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-system/src/repos.rs:93-106 | src/task/task_cache.rs:1278-1285 \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":"crates/mise-system/src/repos.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c305dc5717fc065202dfe1219d596ff3cbb31b745e90f405378971f60737c612"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/config/config_file/mise_toml.rs:999-1011 | src/config/config_file/mise_toml.rs:1068-1079 | src/config/config_file/mise_toml.rs:1115-1126 \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":"src/config/config_file/mise_toml.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cd191c67f875e71af2a9762eaaa02fc4b5bce48c63a21f20fc572f395a237f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-system/src/secrets.rs:84-96 | crates/mise-system/src/services_common.rs:130-141 \u2014 before extracting anything, compare \u0060crates/mise-system/src/secrets.rs\u0060 and \u0060crates/mise-system/src/services_common.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/secrets.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4130ab61a0bb8d4cea5ee342db00b31229707c835bc53ab71ed59f60ef970a00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/mise-system/src/files.rs:4124-4136 | crates/mise-system/src/files.rs:4162-4172 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/files.rs"},"region":{"startLine":4124}}}],"partialFingerprints":{"codehealthFindingId/v1":"651cb64a511b69f1a9303f206710be5ff870518b7b41efa7c381eeecdc2551b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/backend/cargo.rs:90-101 | src/backend/options.rs:104-113 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/cargo.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca980879e6b0123c04b317908584e4c1282ccacc8a454ae4743edbdcd0f5961d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/plugins/core/bun.rs:160-171 | src/plugins/core/python.rs:111-117 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/bun.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b26fd50331ce252ae7c5b298514f61a25965822aa466e2dfdd08bee8877d972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-system/src/unapply.rs:181-192 | crates/mise-system/src/unapply.rs:251-262 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/unapply.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a17b515bd0d2ae8646b82ccfb814be53864c4381d89827d874d6acd49bd5ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/generate/tool_stub.rs:557-567 | src/cli/generate/tool_stub.rs:572-583 \u2014 both copies are in the same file, so extract the block 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":"src/cli/generate/tool_stub.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"a578650ab0b9758419cca44c4c9fd122aa1dc5db5c8ce361da06c0e772a393cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/mise-system/src/compose.rs:84-95 | crates/mise-system/src/secrets.rs:84-95 | crates/mise-system/src/services_common.rs:130-141 \u2014 before extracting anything, compare \u0060crates/mise-system/src/secrets.rs\u0060 and \u0060crates/mise-system/src/services_common.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/compose.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cb0bae12827bc65c4baac648af0619eebb14e3d385aa985d27e398acdb9a11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/mise-system-packages/src/apt.rs:94-105 | crates/mise-system-packages/src/apt.rs:121-130 | crates/mise-system-packages/src/dnf.rs:362-371 | crates/mise-system-packages/src/pacman.rs:294-303 \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":"crates/mise-system-packages/src/apt.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"94292bfd0545060306ba3a2d5bd86d121713fe5c223a04077c50ef3148017873"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/vfox/src/lua_mod/semver.rs:5-13 | crates/vfox/src/lua_mod/strings.rs:5-16 \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":"crates/vfox/src/lua_mod/semver.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"825c7548cfa4f7beda6faa79814609fe0a1a948358d95922e2245793e8ceb714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/cli/mcp.rs:449-460 | src/cli/mcp.rs:594-599 \u2014 both copies are in the same file, so extract the block 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":"src/cli/mcp.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea657fa4347bb0f726ae8bd493d8156c4ca1729b82b837eda2ec69b719698b31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/mise-system/src/managed_files.rs:400-411 | crates/mise-system/src/managed_files.rs:477-488 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa806d77fd5a847ffbdc3ec1155b2514b46918a4d46cf1e80e75d9de8666782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/cache/clear.rs:64-74 | src/cli/cache/prune.rs:57-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/cache/clear.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca207d2021ade1ec9ffa515fa81feec9d80079916ede2b45d30b62274167e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/mise-system/src/accounts.rs:798-808 | crates/mise-system/src/firewall.rs:602-612 | crates/mise-system/src/services.rs:480-490 \u2014 before extracting anything, compare \u0060crates/mise-system/src/accounts.rs\u0060 and \u0060crates/mise-system/src/services.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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":"crates/mise-system/src/accounts.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd98e509be52d6904fadfee18efcf0a190147f53fc774a05233c3ec2c7d4e6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/cli/trust.rs:234-244 | src/cli/trust.rs:325-335 \u2014 both copies are in the same file, so extract the block 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":"src/cli/trust.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"623a9866c465447574c5244c38f92c88d377e3b2c4ca58fa9b64ca1230e32aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/mise-system/src/accounts.rs:798-808 | crates/mise-system/src/firewall.rs:602-612 | crates/mise-system/src/managed_files.rs:1049-1059 | crates/mise-system/src/services.rs:480-490 \u2014 before extracting anything, compare \u0060crates/mise-system/src/accounts.rs\u0060 and \u0060crates/mise-system/src/services.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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":"crates/mise-system/src/accounts.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfffb3e67a28e0df8278cd8c66728e33da898a83c2098b1c597d0cc757e30cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/toolset/env_cache.rs:159-169 | src/toolset/env_cache.rs:335-345 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/env_cache.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a020b27b7d0aaa4acac5488df0e8f10a52018986e8990436e6af1a8e4e3b076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/cli/shim.rs:407-417 | src/cli/shim.rs:439-449 | src/cli/shim.rs:459-469 \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":"src/cli/shim.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bfb57311001836e7b9b93b87a269da28cca64c3a9cbd93c7ce11c88fc39b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/task/task_context_builder.rs:159-167 | src/task/task_context_builder.rs:226-235 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_context_builder.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffc9eeef8b942e30fe2e5a82c8e4734c5ba68d40a54d08d546fb8df369cfec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/mise-system/src/compose.rs:353-362 | crates/mise-system/src/services.rs:153-162 \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":"crates/mise-system/src/compose.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0b6101501ea9515a76642b49191d0c65bb75f29ddee7c18b731b096262498d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/plugins/core/rust.rs:574-583 | src/plugins/core/rust.rs:1697-1703 \u2014 both copies are in the same file, so extract the block 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":"src/plugins/core/rust.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"553479c1a96329b7fe05af05513c731dceba7360677bdf684cfe1efdbbc6a46b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/cli/bootstrap.rs:5788-5797 | src/cli/bootstrap.rs:5901-5910 \u2014 both copies are in the same file, so extract the block 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":"src/cli/bootstrap.rs"},"region":{"startLine":5788}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4eb9f60718f6f27468d806a3b0f25031167b247ccba8a258d87fa74e7793d29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-util/src/cmd.rs:2667-2675 | crates/mise-util/src/cmd.rs:2720-2728 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":2667}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf2a9b52d8d1d436de2a9af8986e55de244ebab5852ac7f14ac46e5c416b432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/task/task_script_parser.rs:501-508 | src/task/task_script_parser.rs:585-593 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_script_parser.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67357f4702269facefb0154d8154f7562a729675da65601c3fb56851ac653b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/mise-oci/src/registry.rs:571-579 | crates/mise-oci/src/registry.rs:673-681 | crates/mise-oci/src/registry.rs:1886-1894 \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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e6c684b5b677244f519aaf939abe8d468867f3681eb91e2e6f6e5c3376f66e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-system/src/files.rs:4117-4125 | crates/mise-system/src/files.rs:4155-4161 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/files.rs"},"region":{"startLine":4117}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c4209975463932274f90d862559713f7c5ff58d7fbff7bb5147bd6b382470b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/mise-oci/src/registry.rs:1183-1191 | crates/mise-oci/src/registry.rs:1950-1958 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4707770f36bf744f67678744020e92b51b080b47034e0a83b807deaa7989e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/lockfile.rs:5593-5598 | src/lockfile.rs:5607-5615 \u2014 both copies are in the same file, so extract the block 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":"src/lockfile.rs"},"region":{"startLine":5593}}}],"partialFingerprints":{"codehealthFindingId/v1":"708ada3f1bd83d8aeb63d810b1caa2b1d6410a242bf31fa4938c62a361ef8da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/vfox/src/lua_mod/cmd.rs:280-288 | crates/vfox/src/lua_mod/cmd.rs:320-324 \u2014 both copies are in the same file, so extract the block 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":"crates/vfox/src/lua_mod/cmd.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b58cf337da9b7dfe54b99c1079978671b62001bca5f210ba25c542b0175f3fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/task/task_cache.rs:1274-1282 | src/task/task_cache_store.rs:502-510 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_cache.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5685edb1f92598f2cedd4cdea883cf0ab0a8b94b892438712fdef6d0d42e9195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/secrets/template.rs:452-460 | src/secrets/template.rs:477-485 \u2014 both copies are in the same file, so extract the block 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":"src/secrets/template.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"11051c2cd11701e14b8e1092620dea52bb0de6b85cb748488667e2f954892c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/cli/bootstrap.rs:398-406 | src/cli/bootstrap.rs:5301-5309 \u2014 both copies are in the same file, so extract the block 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":"src/cli/bootstrap.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3122c46fd807dad01ed4b014460654cfa5195169c2642f7dc9ee6c4aac24488"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/cli/system/install.rs:144-151 | src/cli/system/install.rs:459-466 | src/cli/system/install.rs:519-526 \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":"src/cli/system/install.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"583a87643d293c644c1488b2a1f949239d6401b235003cfb5832880f0d195769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-util/src/env_diff.rs:484-491 | src/direnv.rs:114-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/env_diff.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0aea4b28b0eb5f82a73381fc2813bdffe12617b645e4b24443c0e7fac1d12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-util/src/cmd.rs:2659-2666 | crates/mise-util/src/cmd.rs:2712-2719 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":2659}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd580c04ea9bb2076191a147c6e3ba69e440e4529c1f435590d82ab657050b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tool_catalog.rs:291-296 | src/tool_catalog.rs:334-341 \u2014 both copies are in the same file, so extract the block 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":"src/tool_catalog.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e4fbe8a2f1042808e68310e44be3f15dad497e62b778b9629a8916b8803e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/config/config_file/mise_toml.rs:123-130 | src/config/config_file/mise_toml.rs:132-139 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mise_toml.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a213efb1198503c590b07dd4efbe57a33d4cf84f4ee5112ac287c80b6e8d8eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/cli/deps/install.rs:205-212 | src/cli/deps/install.rs:214-221 \u2014 both copies are in the same file, so extract the block 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":"src/cli/deps/install.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fccc206769d0cd4e11d3dc0f35466a57723bb8ae9f1a9e5226d0c481aff24c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/task/task_executor.rs:1404-1411 | src/task/task_scheduler.rs:195-202 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_executor.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"25619b66797c066e9043b4a829c2e3aca27e4975469d665b97aa39e82fb3d3e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-system/src/managed_files.rs:1087-1094 | crates/mise-system/src/managed_files.rs:1108-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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"80379e376cf0efd4b55601800fd0ac3d7d2084d76ae98aa5326a95a667d2ef4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/backend/go.rs:623-630 | src/backend/go.rs:682-689 \u2014 both copies are in the same file, so extract the block 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":"src/backend/go.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"9155079d3834e1cac9bf11dfbf454a98b65a460dc5a12cae52ae514029a4befb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/mise-config/src/de.rs:25-32 | src/config/config_file/mise_toml.rs:2479-2486 \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":"crates/mise-config/src/de.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac6d2e1b320259de82e249b383deb4d03fd6fff872a6e0179470a5d22455e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/backend/npm.rs:359-366 | src/backend/npm.rs:423-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":"src/backend/npm.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"269ccefb9d53558b09d44da72f3bedb9c50d8b6118d88dd628003c2cd3c0b55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/bootstrap.rs:4691-4697 | src/cli/bootstrap.rs:4739-4745 \u2014 both copies are in the same file, so extract the block 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":"src/cli/bootstrap.rs"},"region":{"startLine":4691}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb239d4e15bb0fd89e049e0817e3b349fa5cee1829564040a191a52fbdd4dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/task/workspace/cargo.rs:250-256 | src/task/workspace/uv.rs:290-296 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/workspace/cargo.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4220d548e9947c52aebbed167998b1951803f40cbee9a420e1d1edc3cd9bb1ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/cli/tasks/add.rs:172-178 | src/cli/tasks/add.rs:179-185 | src/cli/tasks/add.rs:212-218 \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":"src/cli/tasks/add.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"798b4f5edf0d77e78d5e1b27365eb37ab64545f04bf40278ab29c1a5e51ffbdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/cli/tasks/add.rs:178-184 | src/cli/tasks/add.rs:185-191 | src/cli/tasks/add.rs:195-201 | src/cli/tasks/add.rs:211-217 | src/cli/tasks/add.rs:218-224 \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":"src/cli/tasks/add.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe4484ca87deb13193537c4f743d7f427b37e7408a7e158e897b0648fbfd7f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/plugins/core/erlang.rs:469-475 | src/plugins/core/erlang.rs:532-538 \u2014 both copies are in the same file, so extract the block 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":"src/plugins/core/erlang.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"55709957411dce57a5e43404f96220bb3b6ac143e6ce62faea72161a11333478"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/mise-util/src/forgejo.rs:49-55 | crates/mise-util/src/github.rs:195-201 | crates/mise-util/src/gitlab.rs:182-188 \u2014 before extracting anything, compare \u0060crates/mise-util/src/forgejo.rs\u0060 and \u0060crates/mise-util/src/github.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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":"crates/mise-util/src/forgejo.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3cf4a5e41ba7b91b84ab41a65512a27bac34702836a3eddc1f13f8fc5a8d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/mise-util/src/github/oauth.rs:642-648 | crates/mise-util/src/github/oauth.rs:894-900 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/github/oauth.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"205da857cead7fa0331d4cf456dae9bb73ed5787821aa718286cebb1d4de3f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/oci/push.rs:130-136 | src/cli/oci/run.rs:140-146 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/oci/push.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce676254b8c5bed97b057cbc622365d75cc75dfe03ce90b186ee1249420db34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 9): crates/mise-util/src/forgejo.rs:47-53 | crates/mise-util/src/forgejo.rs:60-66 | crates/mise-util/src/github.rs:165-171 | crates/mise-util/src/github.rs:180-186 | crates/mise-util/src/github.rs:193-199 | crates/mise-util/src/github.rs:206-212 | crates/mise-util/src/gitlab.rs:167-173 | crates/mise-util/src/gitlab.rs:180-186 | crates/mise-util/src/gitlab.rs:193-199 \u2014 before extracting anything, compare \u0060crates/mise-util/src/forgejo.rs\u0060 and \u0060crates/mise-util/src/github.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 38 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":"crates/mise-util/src/forgejo.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"078370ab1723bdf3746f280382b9faa59014faf04e1dc6e28b4cd2149fb89e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/cli/tasks/validate.rs:803-809 | src/cli/tasks/validate.rs:828-834 \u2014 both copies are in the same file, so extract the block 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":"src/cli/tasks/validate.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30e8e7911b2c03b7101585e865f830d39af4b6ad0cc4c01eaae4412f92866f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/task/task_cache.rs:1443-1447 | src/task/task_cache.rs:1466-1471 \u2014 both copies are in the same file, so extract the block 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":"src/task/task_cache.rs"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"edec01a7a2325607b7a4ebab3556975d960298cc22d3662d930d7327bef88781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-system-packages/src/choco.rs:84-89 | crates/mise-system-packages/src/winget.rs:143-148 \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":"crates/mise-system-packages/src/choco.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d1c42a90679336eaee530796b951521300f9a5cb325fe6101194f8cc3bd643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-system/src/history/sync/onboard.rs:70-75 | crates/mise-system/src/history/sync/onboard.rs:500-505 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/history/sync/onboard.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc298a8f31d8c2e8fc57aa6efe5d2c3dd340324aae63c744c2cccd5d016707fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-system/src/history/notify/macos.rs:74-79 | src/enclave/macos.rs:55-60 \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":"crates/mise-system/src/history/notify/macos.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2e23e4b885eae502765b472e3dceec6ea130bc2b920efd9c99ddb661333db7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/cli/mcp.rs:528-533 | src/cli/mcp.rs:594-599 | src/cli/mcp.rs:622-627 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mcp.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f95246bc572fbe6a83185a79cf0d0d5bd7d03cc26543e397b006ddb2042ab38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-oci/src/layer.rs:178-183 | crates/mise-oci/src/layer.rs:531-536 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-oci/src/layer.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed43ed9cbce2a5d2e6d626a7fdda653156ecc1e5f060c32453a613ed3c2ed616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-util/src/tera.rs:1769-1774 | crates/mise-util/src/tera.rs:1776-1781 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/tera.rs"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bfeeba77075c0d187c9e93a5e6968459c544787d53b9d11450d78c87d8a41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-util/src/versions_host.rs:1016-1020 | crates/mise-util/src/versions_host.rs:1048-1052 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/versions_host.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d5271d4c4864b5d2e1d45a3ca4470e382c3d8bbc578740ca1b5702e8351bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-config/src/task/decls.rs:24-28 | crates/mise-config/src/task/decls.rs:94-98 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-config/src/task/decls.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c64f7612648ecfdc3ac0e299f000934fe32e495edca61db0475c886c4c1cbaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-system/src/managed_files.rs:2143-2147 | crates/mise-system/src/managed_files.rs:2339-2343 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"02098baee767306d17d5ebc83875d07d8ea029fb657978d3686548f520698b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/generate/install_script.rs:334-338 | src/cli/generate/mod.rs:88-92 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/generate/install_script.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"484caec93886b75aa6c3ee153bd75475f0e83dae4e0331ed0ba87f3fe413ec2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/mise-lsp/src/complete.rs:563-567 | crates/mise-lsp/src/keypath.rs:27-31 | crates/mise-lsp/src/tasks.rs:837-841 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/complete.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f2fd605296425f68036a7354e2502bc17087dda1f93a7638c7f247e9da4dd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/mise-lsp/src/includes.rs:22-26 | crates/mise-lsp/src/includes.rs:42-46 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-lsp/src/includes.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"523daa2b65f828655fd1aaa0dbdcd8c0cd9e27ade2ba0a7270e4845b52c7a3de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/dotfiles/track.rs:797-801 | src/cli/dotfiles/track.rs:857-861 \u2014 both copies are in the same file, so extract the block 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":"src/cli/dotfiles/track.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"e621f249a05d28b31e73d71c1c0387dcdad8b36badc76b430f04d1a71ef271ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/cli/dotfiles/untrack.rs:119-123 | src/cli/dotfiles/untrack.rs:233-237 \u2014 both copies are in the same file, so extract the block 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":"src/cli/dotfiles/untrack.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2670cfcc98a60408f9e016937e027e4612f9fe92ccfdffc22dd119a6b86bb800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/config/config_file/mise_toml.rs:961-965 | src/config/config_file/mise_toml.rs:1200-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":"src/config/config_file/mise_toml.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3ebc1fd6399b1549bf080579ef9112824e082f335b567017d5563faf687533"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/config/miserc.rs:202-207 | src/config/settings.rs:783-788 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/miserc.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d56657a716e4ee5989dd0bcdddd3d2580d3f6177c0093a255effbf80df1cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/lockfile.rs:4148-4152 | src/lockfile.rs:4180-4184 \u2014 both copies are in the same file, so extract the block 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":"src/lockfile.rs"},"region":{"startLine":4148}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79b5428944f6869cba36fae0e0621539b17bfc57656d29347e40270b4f7100b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/toolset/tool_version_options.rs:927-931 | src/toolset/tool_version_options.rs:940-944 \u2014 both copies are in the same file, so extract the block 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":"src/toolset/tool_version_options.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"6910b6dc2b39308ee54d94a5aa3392a7a43b980017ef63b4a8ee948c2fd8feb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/mise-system-packages/src/brew/tap_cask_metadata.rb:7-31 | crates/mise-system-packages/src/brew/tap_formula_metadata.rb:8-32 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/mise-system-packages/src/brew/tap_cask_metadata.rb:7\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/tap_cask_metadata.rb"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e366455be57d8f041a57a8e2a301c12ea98f88402b3ca4f620781cbb150bd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/mise-system-packages/src/brew/cask_shim.rb:255-263 | crates/mise-system-packages/src/brew/tap_cask_metadata.rb:264-269 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask_shim.rb"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0fbe890ea3ce88a9ae32f36147d5d7f6c6c3235e63730afa6982a364e6b6c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/mise-system-packages/src/brew/shim.rb:175-179 | crates/mise-system-packages/src/brew/tap_cask_metadata.rb:84-88 | crates/mise-system-packages/src/brew/tap_formula_metadata.rb:69-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/shim.rb"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e37259d95baeb5920d4789e8515e0d1cc721b5c78f3225bc5224261f7ed3b48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/mise-util/src/sandbox/landlock.rs:209-223 | crates/mise-util/src/sandbox/landlock.rs:233-247 \u2014 both copies are in the same file, so extract the block 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":"crates/mise-util/src/sandbox/landlock.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61d5954b2178c7c7ddd33aa0688ad8d7fee93f5b985fc0dddaed08d084b4dc0"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project mise-oci: mise-oci has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a36ffb510568d2ecc8aab9d6547449cf0cce5ef69bd3fdf30d84db5313fcccb2"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project mise-system-packages: mise-system-packages has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8e11cd40b341026653fe8e728dea93725c101046c76209e0b015190617c30112"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mise-agent-env: mise-agent-env: 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":"42d1f89e3173b00968dc43beb6bbafb44012d729f38082289d1e821f7e6e84c5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mise-bootstrap: mise-bootstrap: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3484204f1545f57871ddd3941ed54b9f5a0171e26cf9a4c43ca2e0f7e7c3d72a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mise-brew-metadata: mise-brew-metadata: 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":"092227e5c0660098f2919bc65d1f75644cd6f8881cc111ded9b1ab28c9f0208d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mise-brew-relocation: mise-brew-relocation: 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":"a86d614655eaf5d1767f31f73dddccfc96a2632a549466c019786fb6bfe5bfa0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mise-dotenv: mise-dotenv: 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":"0260f25f45250850503e8910400c4f3e0d2bd7c94183b5c5b2a118c66aba03b6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mise-lsp: mise-lsp: 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":"b0401d4990e1b3b0e36c7ed22881344912497ec1734eee2a58835d9972249587"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: aqua-registry: aqua-registry: abstractness 0.04, instability 0.00, distance 0.96 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fca5964ef30749215e2d4b065df9e30abf45bfa0c4a181e11d173344bdc27d25"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mise-config: mise-config: abstractness 0.00, instability 0.14, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"07a99e0dc7ae92fba30b57b0f908d84f5e6bb96a94de465a46c3ff53b2e43935"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mise-interactive-config: mise-interactive-config: abstractness 0.15, instability 0.00, distance 0.85 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b23193787db67e1be6626a55777a4aa182edb14dbaba4aa5b4ad421b73354522"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mise-settings: mise-settings: abstractness 0.00, instability 0.22, distance 0.78 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e8501fedb79e92adf54114a4b69a7439ae040850a718195b88d7151c686f0ae2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: mise-cache-core: mise-cache-core: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6594f3b113ba8db8c134d8c7c82387f9c0b689334e82bbe990b265daac7eb61d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Settings (LCOM4 17): Settings\u0027s methods fall into 17 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/settings/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8e26edf49df3774c497f9eea36a6bb4d3dfbaac7359cca5df4baac91907152"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NodePlugin (LCOM4 9): NodePlugin\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/node.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb11784cf2b998fc987f4d812dd2ec447cf2114bd16918cd4391e6abe4b8b26"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RustPlugin (LCOM4 8): RustPlugin\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/rust.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd2d3640883414caa0c73dac3fe6e39a5596e0acad2339440e06675196f5806"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NPMBackend (LCOM4 7): NPMBackend\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/npm.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2859e128d7531151b0115cb9e7361472cb59356e3e8322e6a736a0d6e59cb716"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MiseServer (LCOM4 7): MiseServer\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mcp.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"30582128ea6569cff0ec07400eb337d1b1a0d4644735403ea86a2611e5119aa1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PackslipBackend (LCOM4 6): PackslipBackend\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/packslip.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"246cdecfe77e68a0f948b4d4cf9304cf1cde0c56fe14f2b9d12bf9cf168e15fc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PIPXBackend (LCOM4 6): PIPXBackend\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/pipx.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35ab96ffdcf95e19134a18ab473d658c96bef132c22153ee16a843716c12de7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DotnetPlugin (LCOM4 6): DotnetPlugin\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/dotnet.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f876a3f8418ad1b798f7898a11fb6b67becfd2c9f7860916edf9576e34061d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: JavaPlugin (LCOM4 6): JavaPlugin\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/java.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94812908b1909a4b5e51229fc759a50aa01782af820a6d35873f907230468f8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: GoBackend (LCOM4 5): GoBackend\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/go.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbcb004900f6047082002c0ece63e1679e54c2318738adfb8f3fe5b01db20673"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Config (LCOM4 5): Config\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8f4cc91651ee166192e125085e5cd6d953e02079519d9188aa6889b7188b92"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BunPlugin (LCOM4 5): BunPlugin\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/bun.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fedb16efe82081b3359600c9c25adfcf3c6e862d39937e09525e9756b46373c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SwiftPlugin (LCOM4 5): SwiftPlugin\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/swift.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"30281c55e621a4e23cd8b5aa50352ec48494b4aebd05e5e6bb874dbdb88c6e9b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ZigPlugin (LCOM4 5): ZigPlugin\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/zig.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3a82f10a3f72a04465893f3a9fc06ca8dd2bbcd3a4b721fd43165477c16633"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CondaBackend (LCOM4 4): CondaBackend\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/conda.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a766765782358afffe4198dbb48a645abad2848f45229c30dc4582155f007d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DotnetBackend (LCOM4 4): DotnetBackend\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/dotnet.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1acbd721e448ff3ef8d7f754690672fba1345c491c72ce6aea94a6d487b6ef3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HttpBackend (LCOM4 4): HttpBackend\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/http.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"181f16e48937fa00ae0220d25ec3b78b2e0b5427a507e1fa40cd2643e530b27a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UbiBackend (LCOM4 4): UbiBackend\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/ubi.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fe55b0e6d96e33c06b0346075fd97e8c687b1b17b06874e7130c91faa85a0b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DenoPlugin (LCOM4 4): DenoPlugin\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/deno.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"403dcd7c7a952ab67f96b7d31e4c8c27c1103b274b64ee375ffc828ffb294d2b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RubyPlugin (LCOM4 4): RubyPlugin\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/ruby_windows.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e721abfefea52e8b381edc4f33238304c7e9e4e90edeaccfd86e32f61e8e01a"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: built-page checks offer the showreel as og:video on the homepage only: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* \u2014 so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/social-images.test.mjs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f7e1028a84f359f01623bc77a1e470f3910d6ea72261c86862355d3ba28230"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/bootstrap.rs: src/cli/bootstrap.rs changed 101 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in Bootstrap::run_phases at line 1916. 21 of those changes were fix/bug commits, and the other 80 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/bootstrap.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":"src/cli/bootstrap.rs"},"region":{"startLine":1916}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c5277cd2305ca16b260ce3ea25234c6f1087c2b893e1c53e1794d623364ba4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/mod.rs: src/backend/mod.rs changed 122 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in Backend::install_version at line 5023. 59 of those changes were fix/bug commits, and the other 63 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9d9fc8d38ecb2c7826149343fed896162e76d80ae6530a868e9acff11e64f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/mod.rs: src/cli/mod.rs changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in Commands::run at line 516. 25 of those changes were fix/bug commits, and the other 54 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/mod.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf926830e9464e9d083c52d68a0dba6c6996c5a4f3bb1999058dd3449872c61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config/mod.rs: src/config/mod.rs changed 166 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in mise::config::merge_file_and_config_tasks at line 6366. 73 of those changes were fix/bug commits, and the other 93 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/config/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/mod.rs"},"region":{"startLine":6366}}}],"partialFingerprints":{"codehealthFindingId/v1":"0136cc8779811045ebca9b2d43df9afa9314d981ef2c1d119c22419e4d2f3f89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/task_executor.rs: src/task/task_executor.rs changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in TaskExecutor::exec_program at line 1847. 25 of those changes were fix/bug commits, and the other 41 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_executor.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":"src/task/task_executor.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acd6945ed05371797ae5d2ec553daad492bf67e168b77c155b8934476f44898"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/files.rs: crates/mise-system/src/files.rs changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in mise_system::files::merge_file_entry at line 1549. 3 of those changes were fix/bug commits, and the other 59 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/files.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":"crates/mise-system/src/files.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3c2c6575fdf1f657198e2fe6a470b628560de259e4e7f698bb4e6510c892df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/upgrade.rs: src/cli/upgrade.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in Upgrade::upgrade at line 789. 24 of those changes were fix/bug commits, and the other 27 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/upgrade.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":"src/cli/upgrade.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"093b6b660766cbc7ba0328d29c7671ede5151e19c68360a8b208091430388526"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/toolset/tool_version.rs: src/toolset/tool_version.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in ToolVersion::resolve_version at line 808. 29 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/toolset/tool_version.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":"src/toolset/tool_version.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"758cf6ab9a4729d36b7d749551c689417f51c23e8915b0d1eba38896ead37d0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/lock.rs: src/cli/lock.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in Lock::get_tools_to_lock at line 2268. 21 of those changes were fix/bug commits, and the other 23 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/lock.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":"src/cli/lock.rs"},"region":{"startLine":2268}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8ab56ab7fdd7c9a0754196a38e4515e7ebbfcbf319f9191dd2b5c27cf263fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/dotfiles/add.rs: src/cli/dotfiles/add.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 92 in DotfilesAdd::run_inner at line 154. 6 of those changes were fix/bug commits, and the other 27 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/add.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":"src/cli/dotfiles/add.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d22a8ee85fcc238ad6cc6ad2e656460dd277c8712193ac0366cfd1424d11cf8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/lockfile.rs: src/lockfile.rs changed 61 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in mise::lockfile::update_lockfiles at line 3296. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/lockfile.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":"src/lockfile.rs"},"region":{"startLine":3296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6363bc1ab983d781ff7bcf596028446f37211c474b1521fead9689c4ef2a5f7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/run.rs: src/cli/run.rs changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Run::run at line 674. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/run.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":"src/cli/run.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"809e516f94727d60e68e14f1be5c3b330d36f7f1bda219d16057805461f462ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/aqua.rs: src/backend/aqua.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in AquaBackend::resolve_lock_info at line 826. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/aqua.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":"src/backend/aqua.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"de742099ec259964f258bff5a393ef330081364828699bcb124d0316cf7df775"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config/env_directive/mod.rs: src/config/env_directive/mod.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in EnvResults::resolve_with_toolset at line 192. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/config/env_directive/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dee88781340e37deb609e7f664a0597677eee2984af1a38a3531fa1ad8e47d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/dotfiles/track.rs: src/cli/dotfiles/track.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in DotfilesTrack::run at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/track.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":"src/cli/dotfiles/track.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"35988ad97cc393bb8463e1de6e95d1237f320ad235a20c34b373c284e2b0d0d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config/config_file/mise_toml.rs: src/config/config_file/mise_toml.rs changed 91 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in MiseToml::replace_versions at line 1707. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/config/config_file/mise_toml.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":"src/config/config_file/mise_toml.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05c973d86b3f1972620357fe98efe705727bee47ce8cb9f9ad749ffc6e3ca99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config/settings.rs: src/config/settings.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Settings::set_hidden_configs at line 1751. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/config/settings.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":"src/config/settings.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"735acf771f1d171f3f3d5aec76b913258ab36370917671ac6062d4e793b57b84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/mod.rs: src/task/mod.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Task::merge_toml_overlay at line 2599. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/mod.rs"},"region":{"startLine":2599}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6d068d254413e26105cd19d7066c3b3f4a02e955327fdbf2300b03aff56820"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/checkpoint.rs: crates/mise-system/src/history/checkpoint.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in Store::attempt_locked at line 189. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/checkpoint.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":"crates/mise-system/src/history/checkpoint.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fd92aff0c1295157c9fafe7122a6f6bec1755050f986385a60697e2f474962"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/daemons.rs: src/cli/daemons.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in Daemons::run at line 256. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/daemons.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":"src/cli/daemons.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bf6ee7e89903e2e5e4071eb28cc80f7432f37e693b4a73872a221903bc02f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/toolset/toolset_install.rs: src/toolset/toolset_install.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Toolset::install_all_versions_with_progress at line 322. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/toolset/toolset_install.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":"src/toolset/toolset_install.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9c9ab12150ebc7de16f1a2df1eff5b2e54064c01eb99b1d69c3d597f90bdb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/dotfiles/status.rs: src/cli/dotfiles/status.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in DotfilesStatus::run at line 75. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/status.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":"src/cli/dotfiles/status.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae0f2b94d1baacf7ef313f27c59fe18630073744f2c98debe4ff05c6437c53e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system-packages/src/brew/cask/mod.rs: crates/mise-system-packages/src/brew/cask/mod.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in BrewCaskManager::install_one_with_ancestors at line 582. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system-packages/src/brew/cask/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"067cb2f2638e39e0fdfff8f2a4cefc71230fe0bc3b9d9c616ba9e41fba96639d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/packslip.rs: src/backend/packslip.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in PackslipBackend::install_payload at line 2179. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/packslip.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":"src/backend/packslip.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae63512d1485d3f8a3c5ebd850684d80c09895191d00c873a3ed4645ae89c666"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/watch/runtime.rs: crates/mise-system/src/history/watch/runtime.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in mise_system::history::watch::runtime::run at line 97. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/watch/runtime.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":"crates/mise-system/src/history/watch/runtime.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a236527f7a09d06a807692e968c0b87d3d848b0e84986f24c8f56a0c102b49c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/exec.rs: src/cli/exec.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Exec::run_with_context at line 276. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/exec.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":"src/cli/exec.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2e9b30bb2ebc0cd482b21240ec0cc8fa804a5d99e5dc4f45d841d506f5d490"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config/config_file/mod.rs: src/config/config_file/mod.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in mise::config::config_file::trust_check at line 739. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/config/config_file/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mod.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c3e24f623107d9f364db70407ce3222287914fc60679a53a3c545555a8f662"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/github.rs: src/backend/github.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in UnifiedGitBackend::verify_attestations_or_slsa at line 2858. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/github.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":"src/backend/github.rs"},"region":{"startLine":2858}}}],"partialFingerprints":{"codehealthFindingId/v1":"5563962baa5a0ab4bf30e9ad390dbd7fd3bea136a345d3855fda368ada7ad36b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/doctor/mod.rs: src/cli/doctor/mod.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Doctor::check_dotfiles at line 847. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/doctor/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/mod.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"953b563764fc15017981e818ff27995336120972d574b4ba2d395c8db5771231"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/pipx.rs: src/backend/pipx.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in PIPXBackend::install_version_ at line 707. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/pipx.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":"src/backend/pipx.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"9762109e1055c15e1ffa0f3ce51312db23c7f807b0ab6e656230a15104522699"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/toolset/mod.rs: src/toolset/mod.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in mise::toolset::get_versions_needed_by_tracked_configs_with_progress at line 995. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/toolset/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/mod.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca32e43dd892fb08572b83777c9ccb017efdba263131348a953a158fcef0b204"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-util/src/http.rs: crates/mise-util/src/http.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Client::download_file_attempt at line 1990. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-util/src/http.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc8dd3cf80e77a1c5cf9c43aab83abea59247d7a95300e7f26506a110c27d81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/shims.rs: src/shims.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in mise::shims::sync_command_wrapper_shims at line 997. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/shims.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":"src/shims.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"237dbef16caa339a888433e812b0a9ffd4723c5f654260ecbc2f5c4e79543c40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/packslip.rs: src/packslip.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in mise::packslip::fetch_files at line 319. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/packslip.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":"src/packslip.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"78913e9fc7529267bb10bc3056d461c61df306ade0fdb743d959c919467ac21c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/tracked.rs: crates/mise-system/src/history/tracked.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in mise_system::history::tracked::walk_entry at line 933. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/tracked.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":"crates/mise-system/src/history/tracked.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"097fc294559b1a3d4674aaef0cd1855d2a0552723ed4d0b23f59cd3ab8b2ac05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/oci/builder.rs: src/oci/builder.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Builder::build_image_config at line 776. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/oci/builder.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":"src/oci/builder.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2c5727a6e0ae68d4418ae14fbe25592e069c4b3980047199f2e0e7f3fe1a64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/args/backend_arg.rs: src/args/backend_arg.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in BackendArg::full at line 613. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/args/backend_arg.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":"src/args/backend_arg.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"622c3392bbffb3794b5b4c42655066d43769c23517b8814b078fb4180023fe7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/lockfile/generate.rs: src/lockfile/generate.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in mise::lockfile::generate::generate at line 400. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/lockfile/generate.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":"src/lockfile/generate.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0e377dd1973800f845046c943c19d1a0ec2495e6120499e4cee594195e4812"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/use.rs: src/cli/use.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Use::run at line 272. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/use.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":"src/cli/use.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5843efb9cbe7131af442c8ef81d6baf198bc5cebc05ffef661dea1f89bead8d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/resources.rs: crates/mise-system/src/resources.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in mise_system::resources::plan at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/resources.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":"crates/mise-system/src/resources.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd527f7b26a62df78a59275fe6a4462717700ffb2753e888de08dd362a741f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/install.rs: src/cli/install.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Install::install_runtimes at line 296. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/install.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":"src/cli/install.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"a657beee63d540699a4b8db390f886996ca981f36c3b7c3cff3b38fdc4eb368a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/shadow.rs: crates/mise-system/src/history/shadow.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in HistoryRepo::read_meta_in at line 905. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/shadow.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":"crates/mise-system/src/history/shadow.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fd8e8cd1743aabf27b54f9914fc99b484b4b5ce01feb11533984040047eedf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/edits.rs: crates/mise-system/src/edits.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in mise_system::edits::apply at line 1155. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/edits.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":"crates/mise-system/src/edits.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc90bcc3fd9f77288518668df50873e27315136426d24769390862ef3140fd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/replay.rs: crates/mise-system/src/history/replay.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in mise_system::history::replay::apply_steps at line 530. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/replay.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":"crates/mise-system/src/history/replay.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa17e356e7f783655a225c7e9ce3dc052b5dbb27986f237ad465cff1e05db48d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/watch.rs: src/cli/watch.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Watch::run at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/watch.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":"src/cli/watch.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d7ee4a3837f7f9e18d25d485ed122c15e008e054e13f3ac8017800c8a97043"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/npm.rs: src/backend/npm.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in NPMBackend::install_version_ at line 1233. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/npm.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":"src/backend/npm.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f47ec4151724d12c9f8450b50c1e1d75a3f67251be4537f917b23273d781cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hook_env.rs: src/hook_env.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in mise::hook_env::check_exit_early_fast at line 217. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/hook_env.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":"src/hook_env.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a8a8112101e8d5551f52d3953c6652d88b6b839972aa75dbbe084834345a96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system-packages/src/brew/mod.rs: crates/mise-system-packages/src/brew/mod.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in BrewManager::install_via_pour at line 121. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system-packages/src/brew/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b602affaf9e8ad917eab80a43272a67f97eb246bba73eab32eff9776568060ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/managed_files.rs: crates/mise-system/src/managed_files.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in mise_system::managed_files::apply_with_accounts at line 929. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/managed_files.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":"crates/mise-system/src/managed_files.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"12909512313e38dab27f89951be41902f3627bb30ce605bc625edba70a6d2621"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/sync/run.rs: crates/mise-system/src/history/sync/run.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in mise_system::history::sync::run::sync_locked at line 265. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/sync/run.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":"crates/mise-system/src/history/sync/run.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb9f510ad43d8019b6fba9721a004b8d5e0874dc20629535d5e855a599bfa44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-util/src/cmd.rs: crates/mise-util/src/cmd.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in CmdLineRunner::execute_async_with_cancel_check at line 1461. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-util/src/cmd.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":"crates/mise-util/src/cmd.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde82902a5c4627c3190237f19394db41fe0cffe30e3e884c82fe0d6765625c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/sync/apply.rs: crates/mise-system/src/history/sync/apply.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in mise_system::history::sync::apply::apply_locked_with_scope at line 1152. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/sync/apply.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":"crates/mise-system/src/history/sync/apply.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6af854063b8dbd6af19d69434761b9bfafa27f9786c970dde883a8684b76a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/task_template.rs: src/task/task_template.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in Task::merge_template_with at line 50. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_template.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":"src/task/task_template.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d80af612846bc5e81a5806fcb35046626cd28f3bcd1da8ce6e0ca049829f9e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system-packages/src/brew/cask/flight.rs: crates/mise-system-packages/src/brew/cask/flight.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in mise_system_packages::brew::cask::flight::execute_flight_step at line 585. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system-packages/src/brew/cask/flight.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":"crates/mise-system-packages/src/brew/cask/flight.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2a31018daf2fbe22e6d25ede8b30989fb6bf818e8eb4e8ffe93d7658fd0190"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-daemons/src/runtime.rs: crates/mise-daemons/src/runtime.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Runtime::prepare at line 526. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-daemons/src/runtime.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":"crates/mise-daemons/src/runtime.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7c50d088573aad8da22fcc77faf8b7eeb9f4a5557e85b7c40344b2c0e5cab2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/task_cache.rs: src/task/task_cache.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in mise::task::task_cache::copy_excluded_outputs at line 1482. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_cache.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":"src/task/task_cache.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf64613030b5ed7734fd3e50add4dd047f7fe2507f3b607c799f2a70050673a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/hook_env.rs: src/cli/hook_env.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in HookEnv::build_path_operations at line 349. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/hook_env.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":"src/cli/hook_env.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"59be1e6fef5bdeeaf651bdc0fe95babfc395f4e3bafb6c71a63fa95412420c75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/config/set.rs: src/cli/config/set.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in ConfigSet::run 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/config/set.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":"src/cli/config/set.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"04eca343eff7c5fc272310a3c76b9f82e9504f2cf94b4882506b5fb9c72458fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/task_source_checker.rs: src/task/task_source_checker.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in mise::task::task_source_checker::compute_output_hash at line 1133. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_source_checker.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":"src/task/task_source_checker.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b835d08208bdf660b520789879b33d692ff3dcd9aeceee97079c983bf026e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/driver.rs: crates/mise-system/src/driver.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in mise_system::driver::run_manager at line 183. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/driver.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":"crates/mise-system/src/driver.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c88b90fc6566a1e7c5cdc91af380e05651f87211d26665476dd646cb534f74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/dotfiles/mod.rs: src/cli/dotfiles/mod.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Dotfiles::dispatch at line 206. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/dotfiles/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7febc3fa125b82ba417da5d953bf2fb203abd919cbe537fde9f5ae57a5d9ded6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/unapply.rs: crates/mise-system/src/unapply.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in mise_system::unapply::plan at line 78. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/unapply.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":"crates/mise-system/src/unapply.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1c57b659968152dda3ba65ec7164ea7da771f6b234d5675f6fff0d8f95521b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-daemons/src/presets.rs: crates/mise-daemons/src/presets.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in mise_daemons::presets::expand at line 666. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-daemons/src/presets.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":"crates/mise-daemons/src/presets.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db4d737c90288cb94c34ffef90028f209e500ff5eacc090299296200b044193"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/remote.rs: crates/mise-system/src/remote.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in mise_system::remote::run_staged at line 498. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/remote.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":"crates/mise-system/src/remote.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea9f556b272b46041185de9133429ea933ce0f2e6ddb2b0f3c7c33773e91361"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/sync/origin.rs: crates/mise-system/src/history/sync/origin.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in mise_system::history::sync::origin::set_inner at line 69. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/sync/origin.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":"crates/mise-system/src/history/sync/origin.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"00314a4f6b16d2054ae31b831ac08356f3c31e8f3ec3032748a46cd72efc1605"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/toolset/install_state.rs: src/toolset/install_state.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in mise::toolset::install_state::remove_credential_named_installs_in at line 1275. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/toolset/install_state.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":"src/toolset/install_state.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9060a5f4147f49b68a0785cf33b1756d11216e8e16ea31129a9d3435526e2293"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/hooks.rs: src/hooks.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in mise::hooks::run_one_hook_with_context at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/hooks.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":"src/hooks.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"403c11eba11ba8fa9690d29025382b15d550844710cb631e050bf41380a92673"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/edit.rs: src/cli/edit.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in MiseBackendProvider::list_backends at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/edit.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":"src/cli/edit.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa79ff17ab88970574511971cb4b4796401bf8e3b4c4e40192af7b968c97c37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/plugins/core/rust.rs: src/plugins/core/rust.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in RustPlugin::outdated_info at line 970. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/plugins/core/rust.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":"src/plugins/core/rust.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f718c9b4186cca3f0bfdbc4820c83088e7355e8288567696cc174f15b14755"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/plugins/core/ruby.rs: src/plugins/core/ruby.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in RubyPlugin::fetch_ruby_release_dates at line 570. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/plugins/core/ruby.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":"src/plugins/core/ruby.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8f62112db5e2078f8f824d11049303e03180d4e1f1e3cbe78dc1b19fdcaf12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/generate/task_stubs.rs: src/cli/generate/task_stubs.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in mise::cli::generate::task_stubs::validate_stub_paths at line 543. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/generate/task_stubs.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":"src/cli/generate/task_stubs.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27031515608c2ea581e9bc7e0518d16f79a58be02018137cd2f387f89edc641"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/settings/set.rs: src/cli/settings/set.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in mise::cli::settings::set::set at line 66. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/settings/set.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":"src/cli/settings/set.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4684c0abbbe3df56974efdc387a53422a786c1a658a6d37ac4bcdce1326f5a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config/env_directive/file.rs: src/config/env_directive/file.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in EnvResults::file at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/config/env_directive/file.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":"src/config/env_directive/file.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f8eb19bd5ad2f5949b606288a3452fbbf4521161a8d2e3fa682972c0bafec7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/static_helpers.rs: src/backend/static_helpers.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in mise::backend::static_helpers::install_artifact at line 890. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/static_helpers.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":"src/backend/static_helpers.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75a6ad7bbc6eb58907384a833a3fb373d48b71e8c558ed09265f5dd9662c555"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/task_script_parser.rs: src/task/task_script_parser.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in TaskScriptParser::register_task_source_files_function at line 192. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_script_parser.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":"src/task/task_script_parser.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb6262b2b75a5499ca443ae7fec365b53a701b5623d2f2590e7ec96c5d375ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/unuse.rs: src/cli/unuse.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Unuse::run at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/unuse.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":"src/cli/unuse.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15d9bd102c5229b04690c494d692dbb5d0e989478ebc921b17796b98ae47609"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/tool.rs: src/cli/tool.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Tool::output_user at line 178. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/tool.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":"src/cli/tool.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b59edf423bf1855bee3dbc1f15a89ed1a905f8f0277a163a5e6843bd459bbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-util/src/github/sigstore.rs: crates/mise-util/src/github/sigstore.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in mise_util::github::sigstore::verify_with_mirror at line 630. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-util/src/github/sigstore.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":"crates/mise-util/src/github/sigstore.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f120b6f2507dd1c38c1c8f3f3b25ae45c1049caddb41b5ced4b5a16477236c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/workspace.rs: src/task/workspace.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in WorkspaceProjectGraph::affected_projects_for_changes at line 855. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/workspace.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":"src/task/workspace.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ff5b8ca58644538fa09b26556c926b8706c9b943dcdff8577ffe8ac3c7b8fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/task_list.rs: src/task/task_list.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in mise::task::task_list::get_task_lists at line 444. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_list.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":"src/task/task_list.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"754e3e3e5b666a285ca65fa3e646295d1dd36bee3285236a31384514acfcb1f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/uninstall.rs: src/cli/uninstall.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Uninstall::run at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/uninstall.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":"src/cli/uninstall.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc4e7164e94faed7155380cd66a9e3a1b7fefac54c3b1939ac2ca7a8fd5e7ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/plugins/core/python.rs: src/plugins/core/python.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in PythonPlugin::install_precompiled at line 492. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/plugins/core/python.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":"src/plugins/core/python.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdea575fcc4c2833bd3dadf8bddb203a842c719dca3527bf941f28d5c89a562"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/conda.rs: src/backend/conda.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in CondaBackend::create_bin_launcher_dir at line 634. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/conda.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":"src/backend/conda.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39708e81171ed126a20d2d018a4936b5a977a2c302432a289ea094336a897f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/prune.rs: src/cli/prune.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in mise::cli::prune::delete at line 219. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/prune.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":"src/cli/prune.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d37be69dc7634e19a849c202bf4d2286263904a879e47ed5328dd75dc065378"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/toolset/tool_version_options.rs: src/toolset/tool_version_options.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ToolOptions::insert_core_option at line 662. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/toolset/tool_version_options.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_version_options.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"582d727d3d268790201763d4e1076ebde3c160c61e929a6f0a4b4290e11c593e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/cargo.rs: src/backend/cargo.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in CargoBackend::install_crate at line 292. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/cargo.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":"src/backend/cargo.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7506e8ec669334cd8aadc7bce80eb9af5b3610868650d56f30a8a5f08b9b95f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/set.rs: src/cli/set.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Set::run at line 137. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/set.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":"src/cli/set.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fa72abe4784b3103adc6d0b03f278124328f5d281187ff0c84dfb153767792"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-config/src/env.rs: crates/mise-config/src/env.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in EnvList::deserialize at line 293. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-config/src/env.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":"crates/mise-config/src/env.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc40046cf79174fcc972a4e72969d20e1b0ba5eeb041d7a7de6c609e12f6e4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/system/status.rs: src/cli/system/status.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SystemStatus::run at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/system/status.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":"src/cli/system/status.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a95397ffa1c459629a517aa1082bd8d78dc435c4aa097febaaf4cc09d966b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/tasks/add.rs: src/cli/tasks/add.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in TasksAdd::run at line 94. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/tasks/add.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":"src/cli/tasks/add.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"487a1545640675788cba7e05791014399c878f98162c544189abc0ec2abafe17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/deps/engine.rs: src/deps/engine.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in DepsEngine::run at line 592. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/deps/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":"src/deps/engine.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"d806ae160b78692e786c563f429c78bbfc269ee7f46716301556c54def526e42"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/sync/onboard.rs: crates/mise-system/src/history/sync/onboard.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in mise_system::history::sync::onboard::run at line 291. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/sync/onboard.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":"crates/mise-system/src/history/sync/onboard.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed00d8d195a8d2a26a956984f13052a69832e07d6dde7fdc9bc27555c851d2ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/toolset/outdated_info.rs: src/toolset/outdated_info.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OutdatedInfo::resolve at line 109. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/toolset/outdated_info.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":"src/toolset/outdated_info.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8feddc2ce52ff750082c774adb3a024837dba8b14c97e2ecfbc152b2aadbc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/tasks/info.rs: src/cli/tasks/info.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in TasksInfo::display at line 71. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/tasks/info.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":"src/cli/tasks/info.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a1cebb2b589d85478a06a6cfedc3adccd1c0db11e0c576068a42377cd9e600"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/shim.rs: src/cli/shim.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in mise::cli::shim::which_shim at line 368. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/shim.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":"src/cli/shim.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc05a5e13f1a71b5f0bc952e68c09c66a6ab3397fd0a1ae113bfe520dcc61f5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/dotfile_groups.rs: crates/mise-system/src/dotfile_groups.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in mise_system::dotfile_groups::group_entry at line 351. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/dotfile_groups.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":"crates/mise-system/src/dotfile_groups.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceacae2c12f5d03c29f115ab657f1efeca00e8ac668b33bcb613ed08f452643a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/tasks/ls.rs: src/cli/tasks/ls.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in TasksLs::run at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/tasks/ls.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":"src/cli/tasks/ls.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"81de891db503f4c072cf7d9b1726a5842ea729f397ca2e4ac96306572bc533cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/task_cache_store.rs: src/task/task_cache_store.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in mise::task::task_cache_store::materialize_remote_tree at line 717. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_cache_store.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":"src/task/task_cache_store.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41d6e52c8f73494b25ebd540b8d4b54d281be3204f0281d5ea98de32d4f16f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/dotfiles/unapply.rs: src/cli/dotfiles/unapply.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in DotfilesUnapply::run_inner at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/unapply.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":"src/cli/dotfiles/unapply.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6b4b315ee64a8c9ed3efa019fb1d3031540c9269c3d88bb2a432a30db87926"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/runtime_symlinks.rs: src/runtime_symlinks.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in mise::runtime_symlinks::list_symlinks_for_dir at line 219. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/runtime_symlinks.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":"src/runtime_symlinks.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2dfd09f34627a31a5ea262806b30149908aa475e38bb97443a5ef1ba303424"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/test_tool.rs: src/cli/test_tool.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TestTool::run at line 71. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/test_tool.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":"src/cli/test_tool.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb43dd1ca58567d4d56b8d709e3c7274abdc2183fc13f06b50528591e08262b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/.vitepress/config.ts: docs/.vitepress/config.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in fence at line 166. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- docs/.vitepress/config.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/config.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8a6e975c7ab2f534821747ad95843c2bd22cba045054b4a5f26d530dd45839"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/daemons/tasks.rs: src/daemons/tasks.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in mise::daemons::tasks::start at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/daemons/tasks.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":"src/daemons/tasks.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a966315ce55dfd2d2e135049d0a4544ad3a10107ca0de3b5b91243e35f381549"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/ls.rs: src/cli/ls.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Ls::run at line 158. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/ls.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":"src/cli/ls.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade3da13e51515a31aae9ea43fcde3a1be32b871079cf97fce22306cd403387d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/cargo/native_binstall.rs: src/backend/cargo/native_binstall.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in mise::backend::cargo::native_binstall::install at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/cargo/native_binstall.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":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb358778b6b7cba8b3ee9fa89454e976567545c6885eff3f05403aceb7868f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/enrollment.rs: crates/mise-system/src/history/enrollment.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in mise_system::history::enrollment::reconcile at line 168. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/enrollment.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":"crates/mise-system/src/history/enrollment.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c71967e4d5d32587cd1cb78831966641a149a47654399a9e614b9c5a97e08cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/manifest.rs: crates/mise-system/src/history/manifest.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Manifest::validate at line 546. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/manifest.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":"crates/mise-system/src/history/manifest.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"95446b1e65b49bc59d9d76469d1c42ad290a842aa3cf97cd0bdebf253d875ce1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system-packages/src/brew/pour.rs: crates/mise-system-packages/src/brew/pour.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in mise_system_packages::brew::pour::link_keg at line 769. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system-packages/src/brew/pour.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":"crates/mise-system-packages/src/brew/pour.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da8c288a46a5890166ec6d8368fdfe12e1f3d3f2b8831fe6920acf5f2a22e90"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/deps.rs: src/task/deps.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Deps::new_with_cycle_limit at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/deps.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":"src/task/deps.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7a12f0f70045120b83236c803ee0345dfc54f3439fd7c796fbdd8e3d0b3a0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/go.rs: src/backend/go.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in GoBackend::fetch_proxy_versions at line 396. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/go.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":"src/backend/go.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"c798dd24c63b595629fbc718e19e74254d9e28da77da0b7020b9307d73a5f40c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/systemd.rs: crates/mise-system/src/systemd.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in mise_system::systemd::render_service at line 658. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/systemd.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":"crates/mise-system/src/systemd.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"e743d935eb744a2d2b64a269eb6b87d97fb37c29a69388b5b7ce920df6a86251"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/watch_files.rs: src/watch_files.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in mise::watch_files::execute_runs at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/watch_files.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":"src/watch_files.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e501d3666c41a779b5f6e6d3d143cb5265aeb05dcf069a822c4ac4ec4dbcdbd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/remote_repository.rs: crates/mise-system/src/remote_repository.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in mise_system::remote_repository::install_at at line 204. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/remote_repository.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":"crates/mise-system/src/remote_repository.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5284296fbc86fb92e1284bae0fad6e10103c82340cb4cddc694527a6b2c6ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-oci/src/registry.rs: crates/mise-oci/src/registry.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in mise_oci::registry::push_image at line 1314. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-oci/src/registry.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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d6ce2fd3b479ad30af442f0c43ca559cd42233af633e6f81074094a02185f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tool_purgatory.rs: src/tool_purgatory.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in mise::tool_purgatory::auto_prune at line 156. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/tool_purgatory.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":"src/tool_purgatory.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8a8ceb30497ad837aab0fb0c68c1627f533d2ca27bf01996ebe7c92eab1fbc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/config/get.rs: src/cli/config/get.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ConfigGet::run at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/config/get.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":"src/cli/config/get.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f8caa687c5667d7cf0bbfa69896438b58bbf0328b74782a8c6fcf933473944"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/.vitepress/llms.ts: docs/.vitepress/llms.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in description at line 72. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- docs/.vitepress/llms.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/llms.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c334e18e4139d2de06073b7c0aa58698ba15f8159cf56b7b40dcbe9c9889576e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/doctor/project.rs: src/cli/doctor/project.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Project::run at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/doctor/project.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/doctor/project.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"000239632e4a7edc96834266d8044c959e6d3258383d8f34f64d7260a93d2318"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config/env_directive/venv.rs: src/config/env_directive/venv.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in mise::config::env_directive::venv::create_python_venv at line 145. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/config/env_directive/venv.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":"src/config/env_directive/venv.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c770bccbd2e5e6bed86bd1768081c067a7304a4c8fcc0f6daaebf1aaed61fbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system-packages/src/brew/resolve.rs: crates/mise-system-packages/src/brew/resolve.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in mise_system_packages::brew::resolve::resolve_closure_pairs at line 144. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system-packages/src/brew/resolve.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/resolve.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9900857eb90cbab6f9350225a2adb7b328096d4f94bcca0ee0dcee4723e82c03"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/install_layout/resolver.rs: src/install_layout/resolver.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in mise::install_layout::resolver::locate at line 358. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/install_layout/resolver.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":"src/install_layout/resolver.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf022c80a8c355ac8dca1cae67e81ddcd4888268e2428f4b04c3e22ccba72e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/dotfiles/history/show.rs: src/cli/dotfiles/history/show.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in HistoryShow::run at line 40. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/history/show.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":"src/cli/dotfiles/history/show.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5187a605ee7ef77cca61706de1f941dfbe403abf95b2972103d4da1f24126035"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/task_scheduler.rs: src/task/task_scheduler.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Scheduler::run_loop at line 228. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_scheduler.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":"src/task/task_scheduler.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a934b95a55c0601871f556992f449a40473dde4370a84e01e47eb4aa5b89daf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-util/src/github/oauth.rs: crates/mise-util/src/github/oauth.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in mise_util::github::oauth::refresh_cached_token at line 182. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-util/src/github/oauth.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":"crates/mise-util/src/github/oauth.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"863d6eb4f13ceb5c4d9d5bab0323f0b92a7f1d2206a5383a6c1460e68550a31e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/services.rs: crates/mise-system/src/services.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in mise_system::services::apply_with_notifications at line 399. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/services.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":"crates/mise-system/src/services.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27d85737f2d304cc80e2401de455c6e177c655ad739b0943a854bde0e2ed3ca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system-packages/src/brew/cask/fetch.rs: crates/mise-system-packages/src/brew/cask/fetch.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in mise_system_packages::brew::cask::fetch::fetch_cask at line 3. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system-packages/src/brew/cask/fetch.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":"crates/mise-system-packages/src/brew/cask/fetch.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c83582ef4575fe04dfae7eae08008f2191e57217366a6b86acd92d41d2081f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-util/src/sandbox/landlock.rs: crates/mise-util/src/sandbox/landlock.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in mise_util::sandbox::landlock::apply_landlock at line 170. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-util/src/sandbox/landlock.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":"crates/mise-util/src/sandbox/landlock.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc2044aa33147a968c96369aec8e3e19b2b2533dc781686e650844b6f53e20f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/dotfiles/untrack.rs: src/cli/dotfiles/untrack.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in DotfilesUntrack::run at line 36. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/untrack.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":"src/cli/dotfiles/untrack.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda0a3a5449795203492811a3985e77d66a5b581ffbf25c0e28e55facd5748ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/dotfiles/paths.rs: src/cli/dotfiles/paths.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in DotfilesPaths::run at line 72. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/paths.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":"src/cli/dotfiles/paths.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2363fdc95688433e5b29f9e56a3ff718c03758c8d5135f63d6a44d9048c9071e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/vfox/src/vfox/install.rs: crates/vfox/src/vfox/install.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Vfox::verify at line 255. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/vfox/src/vfox/install.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":"crates/vfox/src/vfox/install.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab83d1c0a0a9e36cd4460115015a5eb3cf95bea2efe00190bbe420c628680c1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/repos.rs: crates/mise-system/src/repos.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in RepoRequest::from_toml at line 73. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/repos.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":"crates/mise-system/src/repos.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ff5f4b99052263ce705d660be8ec7cc4f185a8a26e60975f9c133b494f8348"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-util/src/sandbox/mod.rs: crates/mise-util/src/sandbox/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in SandboxConfig::filter_env at line 478. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-util/src/sandbox/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/sandbox/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd39addc8b922393861af71a57b4419f5c74c82172c6ef236d93b0e9da805bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/sync/preflight.rs: crates/mise-system/src/history/sync/preflight.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in mise_system::history::sync::preflight::prospective at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/sync/preflight.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":"crates/mise-system/src/history/sync/preflight.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecca35e6dfce6e550784afd08923637560cce7c0682882eb25e98f0152c363d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/history/sync/files.rs: crates/mise-system/src/history/sync/files.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in mise_system::history::sync::files::audit_history_cached at line 66. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/history/sync/files.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":"crates/mise-system/src/history/sync/files.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"985b2f661c92c396441b341abf8af8d979d65be0a331c162ed0557dc17e098ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/plugins/ls.rs: src/cli/plugins/ls.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in PluginsLs::run at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/plugins/ls.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":"src/cli/plugins/ls.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5395c15f4cbd8deb8be6011558e9d0a9c3bc7d764e505adc128831f4189ab0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/lib.rs: crates/mise-system/src/lib.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BootstrapTomlConfig::merge_below at line 135. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/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":"crates/mise-system/src/lib.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1e2c0cef98234c74f861af6311823f7003ebe10c87f139736103f397f41dc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/toolset/helpers.rs: src/toolset/helpers.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in mise::toolset::helpers::preflight_system_deps_inner at line 50. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/toolset/helpers.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":"src/toolset/helpers.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"88138ea92c4b6ccbffbb6725f6f1d4611b4022d6da8eea68b7fd7cec195f2dcc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/link.rs: src/cli/link.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in Link::run at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/link.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":"src/cli/link.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d185e918cefeedcdba1af25ff5c7605c357ea4e4f13f6c5879960d3f661f5b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/ssh.rs: src/cli/ssh.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Ssh::run_inner at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/ssh.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":"src/cli/ssh.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60e46973a2ddcf5d7cae62ca8f19352c5d7ffba7bbb935b2af53e9684252e15"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/deps/install.rs: src/cli/deps/install.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in DepsInstall::run at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/deps/install.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":"src/cli/deps/install.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f466e37a1a2e2b3cd1ff81cab8bdb63f9bf220d102ae628d96e851853620ee4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/config/config_file/config_root.rs: src/config/config_file/config_root.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in mise::config::config_file::config_root::config_root at line 55. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/config/config_file/config_root.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":"src/config/config_file/config_root.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19bed55be867d2ca2e5ccd9b36135e13a75e6b49109dd4b87d1d987895898d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/oci/run.rs: src/cli/oci/run.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Run::run at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/oci/run.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":"src/cli/oci/run.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cfc2fc69710e0a868901491f25f6d74f481ec5aedb96b6ae7867a004bc1012"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/backend/backend_type.rs: src/backend/backend_type.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in BackendType::guess at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/backend_type.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":"src/backend/backend_type.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4060a41c4b4c96780974c6a3c5013945c1df5019a845015ba8a92ae5df9b98d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/task_context_builder.rs: src/task/task_context_builder.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in TaskContextBuilder::resolve_task_env_with_config at line 324. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_context_builder.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":"src/task/task_context_builder.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f00cf9c922ea95e4083ff1b6cbb7d220d41223af98e1f4c93f74ea4b4ad6e60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-util/src/sandbox/macos.rs: crates/mise-util/src/sandbox/macos.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in mise_util::sandbox::macos::generate_seatbelt_profile at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-util/src/sandbox/macos.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":"crates/mise-util/src/sandbox/macos.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"70734793073dc5a070abb605ca79ff433ea9565074263b1c960c90da8dd62a6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/launchd.rs: crates/mise-system/src/launchd.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in mise_system::launchd::plist_value at line 312. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/launchd.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":"crates/mise-system/src/launchd.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"16539afca93e4c7c104836129dd1ee5b3c468c594009e1b7c8624d81b974f398"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/secrets/broker.rs: src/secrets/broker.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in SecretBroker::grant_values_with at line 886. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/secrets/broker.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":"src/secrets/broker.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55bc87a79224a5f9b1aa6861a28799422d167d4a74840657121cba539f86e72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-interactive-config/src/render.rs: crates/mise-interactive-config/src/render.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Renderer::render at line 119. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-interactive-config/src/render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/render.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d87f6fe5eab639c3d80145a1ef8987663db11d5ec428019bcf0bcc33ea3d009"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/secrets/grant.rs: src/secrets/grant.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in mise::secrets::grant::static_problems at line 564. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/secrets/grant.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":"src/secrets/grant.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65936e0045ca6baf550d314523392a1e28018aea91fce51df6944e738b28281"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system-packages/src/brew/prefix.rs: crates/mise-system-packages/src/brew/prefix.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in mise_system_packages::brew::prefix::bootstrap at line 196. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system-packages/src/brew/prefix.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":"crates/mise-system-packages/src/brew/prefix.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa44b8c258a9aab636e4fcc6c656c40734d19a03a9e5b7483e85feaf8d672656"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/sops.rs: src/sops.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in mise::sops::decrypt at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/sops.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":"src/sops.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fe584e098bb6e8b6e222e3103a051c432ae586d833d2b25997282e3d7a24af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/cli/dotfiles/save.rs: src/cli/dotfiles/save.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DotfilesSave::save at line 96. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/save.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":"src/cli/dotfiles/save.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"178d2097e55ebf5d68ae9ed01715c07c6c2b77a336c56b4109711e0111dd1c3d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-system/src/scheduled_tasks.rs: crates/mise-system/src/scheduled_tasks.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in mise_system::scheduled_tasks::apply at line 490. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-system/src/scheduled_tasks.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":"crates/mise-system/src/scheduled_tasks.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ec51d99df6ddcb2072b86021134331adf2aaa41e249e5aa2a7cc4dafac6cca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/config-reference.data.ts: docs/config-reference.data.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in config-reference.data.referenceMarkdown at line 408. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- docs/config-reference.data.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/config-reference.data.ts"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff508251ca5a40723ef323ea881122c55f1ed65785b92af60614ea29719f2949"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/task/task_cache_audit.rs: src/task/task_cache_audit.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in TaskCacheAudit::report at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_cache_audit.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":"src/task/task_cache_audit.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5deb3efbf8d21a66213da482f7a025da1840d3888bf52ec3161ad669af1d13ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/mise-dotenv/src/render.rs: crates/mise-dotenv/src/render.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in mise_dotenv::render::is_unquoted_safe at line 137. Frequent change and high complexity in one file compound: schedule 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-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-dotenv/src/render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-dotenv/src/render.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf70a0665052ed0011dc0d08360c55b5e7d1fe15d955a17f14a3d8c9bbe9f0db"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/errors.rs: src/errors.rs changed 15 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is mise::errors::format_install_failures at line 68), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(config): require content-bound trust for env files in paranoid mode (#14604)\u201D; \u201Cfix(lock): refuse to lock a version that a failed listing never confirmed (#13552)\u201D; \u201Cfix(cmd): name the child\u0027s last stderr line in a command failure (#13315)\u201D; \u201Cfix(install): skip lockfile-missing warnings for unrequested tools (#13259)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/errors.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":"src/errors.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cf89f77e9091b667666bb6b21f8087ac9f14c6a34f2ef02b9da8d38f51450e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/aqua-registry/src/types.rs: crates/aqua-registry/src/types.rs changed 14 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is aqua_registry::types::deserialize_registry_aliases at line 302), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(aqua): make the baked registry encoding deterministic (#14809)\u201D; \u201Cfix(windows): repair ARM64 project tooling (#12931)\u201D; \u201Cfix(aqua): suggest compatible package backends (#12225)\u201D; \u201Cfix(aqua): use crate names in cargo warnings (#12252)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/aqua-registry/src/types.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":"crates/aqua-registry/src/types.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5c86268165c0c659ca34ab96ef3433161b58e8bc02b4717393d443012006c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cli/dotfiles/history_status.rs: src/cli/dotfiles/history_status.rs changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is mise::cli::dotfiles::history_status::print_capture at line 437), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(dot): show the local history path in status and explain split track entries (#14979)\u201D; \u201Cfix(dotfiles): stop a newly selected profile from deleting its shared file (#14275)\u201D; \u201Cfix(dotfiles): diagnose stale history watchers (#13864)\u201D; \u201Cfix(dotfiles): restart the history watcher after mise is upgraded (#13845)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/history_status.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":"src/cli/dotfiles/history_status.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be44c365878896b57b1b9f4ae28ee5ae2024e268c6cd7018df46e5bec00df1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/toolset/install_options.rs: src/toolset/install_options.rs changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is InstallOptions::default at line 55), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shim): skip other missing lazy tools when a lazy tool installs on first use (#14201)\u201D; \u201Cfix(npm): report aube safety checks and honor --yes (#13123)\u201D; \u201Cfix(task): auto-install tools for run task references (#13086)\u201D; \u201Cfix(install): summarize interactive progress without duplicate rows (#13030)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/toolset/install_options.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/install_options.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd0257ca02664d1b2cb31cb67f1b5a08485feb3490adf9de6231289de27b8c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mise-shim/src/main.rs: crates/mise-shim/src/main.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is mise_shim::run at line 80), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(shim): keep the version tag in the Windows release mise-shim.exe (#14656)\u201D; \u201Cfix(shim): forward Node IPC through Windows shims (#13903)\u201D; \u201Cfix(shim): stop native shim copies recursing through mise x (#13681)\u201D; \u201Cfix(release): package every file mise reads at compile time (#13573)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-shim/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-shim/src/main.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f895331e52d750c96da1bf363f128561ad60308a3bc443d61efcd9a59070e617"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/backend/asset_matcher.rs: src/backend/asset_matcher.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is AssetPicker::score_build_penalties at line 635), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(github): never auto-select metadata assets as the tool (#13908)\u201D; \u201Cfix(backend): handle unsupported ARM32 artifacts safely (#13004)\u201D; \u201Cfix(backend): normalize shorthand archive stems (#12199)\u201D; \u201Cfix(backend): preserve Windows ZIP preference (#12200)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/backend/asset_matcher.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":"src/backend/asset_matcher.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"0584cb05316b246b4723d2347d5a2bd05d8c20869a21dc974c75eb506df1e905"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mise-util/src/versions_host.rs: crates/mise-util/src/versions_host.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is VersionsHostLogContext::fields at line 232), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(github): retry api.github.com when mise-versions errors (#14501)\u201D; \u201Cfix(github): verify attestations from mise-versions without api.github.com fallbacks (#14469)\u201D; \u201Cfix(github): list git tags from mise-versions instead of api.github.com (#14461)\u201D; \u201Cfix(github): stop falling back to api.github.com when mise-versions misses (#14460)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-util/src/versions_host.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":"crates/mise-util/src/versions_host.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc399cfdd148b38a07a4d1b49dab1c318aaa0e967530228b59d3cc23d15fc50"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/vfox/src/http.rs: crates/vfox/src/http.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is vfox::http::download_to_file at line 238), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(http): fall back to bundled root certificates when the system store is empty (#14817)\u201D; \u201Cfix(vfox): report an HTTP client that cannot be built instead of panicking (#14576)\u201D; \u201Cfix(vfox): apply netrc credentials to HTTP requests (#12168)\u201D; \u201Cfix(vfox): honor url replacements (#11795)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/vfox/src/http.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfox/src/http.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"629d969532b471a0cac0e29beeba8de77c0bfe6f1c1714c1e0d82001d866706f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/lockfile/graph.rs: src/lockfile/graph.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is SidecarWrites::prepare at line 408), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(lock): keep npm sidecars in one place for a symlinked config dir (#14961)\u201D; \u201Cfix(lock): pin a relocated dependency sidecar to the bytes mise just wrote (#13407)\u201D; \u201Cfix(lock): keep installing lockfiles whose sidecar digest was recorded on Windows (#13403)\u201D; \u201Cfix(lock): install locked npm and pypi tools from Windows checkouts (#13398)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/lockfile/graph.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":"src/lockfile/graph.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d91af3744440a6beb2f9ae625af118c380f5fe2027cd3fe38e5804f49aa8652"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/migrate.rs: src/migrate.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is mise::migrate::migrate_incomplete_markers at line 39), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(migrate): keep an unwritable stderr from aborting mise during a migration (#14158)\u201D; \u201Cfix(install): keep incomplete-install markers out of the cache (#14051)\u201D; \u201Cfix(skills): show $HOME as ~ in skills sync output (#13910)\u201D; \u201Cfix(backend): retire expired runtime symlink migration (#13868)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/migrate.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":"src/migrate.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1389562baafd752939381237802e32d95b0a050e945d99bca4880e6eba0d61c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/toolset/tool_version_list.rs: src/toolset/tool_version_list.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is ToolVersionList::resolve at line 27), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(exec): limit @latest resolution to the tools named on the command line (#13943)\u201D; \u201Cfix(lock): make --bump check remote versions and fail when it can\u0027t (#13544)\u201D; \u201Cfix(tool): exclude os-inactive inspection versions (#12021)\u201D; \u201Cfix(rust): resolve nightly to dated toolchains (#11980)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/toolset/tool_version_list.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":"src/toolset/tool_version_list.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2fa06815a668ce87ef3fafc08e76d0cdb4395722417199f67b37bb4a5d08bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/task/task_file_providers/remote_task_git.rs: src/task/task_file_providers/remote_task_git.rs changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is RemoteTaskGit::fetch_to_destination at line 153), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(task): preserve Git task snapshots (#12000)\u201D; \u201Cfix(task): support azure devops cloud ssh urls (remote git sources) (#12102)\u201D; \u201Cfix(task): handle azure devops remote git includes (#11768)\u201D; \u201Cchore(clippy): fix warnings surfaced by clippy 0.1.97 (#11516)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/task/task_file_providers/remote_task_git.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":"src/task/task_file_providers/remote_task_git.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2008d64e982b84643899d5594177b13aa34f5a595dd9896a9591f4cbf749b76"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/cli/dotfiles/capture_health.rs: src/cli/dotfiles/capture_health.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is mise::cli::dotfiles::capture_health::watcher at line 38), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(dotfiles): don\u0027t say nothing is configured when history tracks entries (#14206)\u201D; \u201Cfix(dotfiles): diagnose stale history watchers (#13864)\u201D; \u201Cfix(dotfiles): restart the history watcher after mise is upgraded (#13845)\u201D; \u201Cfix(dotfiles): restart a history watcher that is not watching this store (#13190)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/cli/dotfiles/capture_health.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":"src/cli/dotfiles/capture_health.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d68ada275fc271aa406e0d14138ded86ff70d6da0064c0922d1f3b3f15863d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/aqua-registry/src/cache.rs: crates/aqua-registry/src/cache.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is RegistryCache::write_compiled at line 78), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(aqua): make the baked registry encoding deterministic (#14809)\u201D; \u201Cfix(aqua): invalidate incompatible compiled registry caches (#13884)\u201D; \u201Cfix(aqua): use crate names in cargo warnings (#12252)\u201D; \u201Cfix(aqua): apply explicit package type overrides (#11901)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/aqua-registry/src/cache.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":"crates/aqua-registry/src/cache.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5098618ddb2c70fd0ef607eb657d5c90e868f74a2a9a06d5f07173e44438e707"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/mise-util/src/packslip_pins.rs: crates/mise-util/src/packslip_pins.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is mise_util::packslip_pins::check_against at line 291), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(install): retain saved packslip shared-workflow pins (#14408)\u201D; \u201Cfix(packslip): let a workflow list carry the signer pin across a workflow move (#14338)\u201D; \u201Cfix(packslip): follow transferred repositories, and document installing mise with packslip (#13710)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- crates/mise-util/src/packslip_pins.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":"crates/mise-util/src/packslip_pins.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbfa66567e5bdd4945ea8ac2ab17a1e34cd2925dad9aa1e1dc13021bba4d9fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/packslip_forge.rs: src/packslip_forge.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is ForgeExpect::new at line 216), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(packslip): keep a renamed project\u0027s lockfile signer under packslip 1.7 (#14362)\u201D; \u201Cfix(packslip): let a workflow list carry the signer pin across a workflow move (#14338)\u201D; \u201Cfix(packslip): follow transferred repositories, and document installing mise with packslip (#13710)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/packslip_forge.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":"src/packslip_forge.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"830d3012b210d52619c463be2dae483524ccb011a0655689127f167be7492b30"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/deps/state.rs: src/deps/state.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is mise::deps::state::hash_dir_files at line 174), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(deps): rerun providers when mise recreates the venv (#14532)\u201D; \u201Cfix(deps): honor source and output overrides (#11896)\u201D; \u201Cfix(deps): invalidate state when commands change (#11849)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-27..2026-10-25, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-27 20:15:51 -05:00\u0027 --until=\u00272026-10-25 20:15:51 -05:00\u0027 --full-history --no-merges -- src/deps/state.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":"src/deps/state.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0967d625a7830c0e242be9c9349180393e7ca89bdef0e622a452fbaf8f658ae5"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 173 significant file(s) lose their only recent owner: src/cli/bootstrap.rs, crates/mise-system/src/history/tracked.rs, src/backend/packslip.rs, crates/mise-system/src/managed_files.rs, crates/mise-util/src/http.rs, src/packslip.rs, src/task/workspace.rs, crates/mise-util/src/github.rs (\u002B165 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"432ed75cf6115abfb309a8ac1823ae4365d0317c7c7d3ff08662574e12ed3ca7"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 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 (175 single-owned of 719 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; 719 of the 934 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)), anonymized user #3 (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: crates/mise-interactive-config/src/editor/handlers.rs, crates/aqua-registry/src/file_ext.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe instead of overwriting, we should create the new lockfile at \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"7230073e4cf9fb79d0436b03af2e69ed8072a6fd4a46947903737f45efde8f4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use TOML 1.1 multiline inline tables once toml_edit supports \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lockfile.rs"},"region":{"startLine":6374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8688a4f75faf59d2378db65a788908351af3e9562b16f8041360dc032c90f65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should be different but I don\u0027t have easy access to it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watch_files.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bbc80d6544c486f51af34d75445a912bdd130cbed7f138b9415ab341ef8234"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this a utility function in xx \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/tool_version.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b5e9cd373412a00a971a3cce37eeb49965322c4853afdfa7f729439feacb7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: why? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/toolset_paths.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5706382810ef1bd374adcb2371f31545e83268390779578939688a71cdd15b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ensure no gaps in args, e.g.: 1,2,3,4,5 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_script_parser.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"305ee3ec6c56d7f9b5097ff9add0d1c6873c482e081a104bd2e2bc487599de89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: ensure no gaps in args, e.g.: 1,2,3,4,5 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/task/task_script_parser.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf9ed642e2b91d6cc0416f6ebf9aed8a14805c506d9cc5e993bf42f2a5a3bae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: drop illegal chars, not escape? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell/xonsh.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c91480906f9e2e47408de39f03541a27b1a15de815a1427f99d5372171e670"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: drop illegal chars, not escape? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell/xonsh.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4460b6c594e892b9363867a6c9ec03e328f0703e733e92b9c61c65f88abd85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way to not have to do this #1209"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/erlang.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8056815ad5ca0cf4fb9501a91490b888d242facd427469816fb54ef6d0f38a88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: do not update if recently updated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/python.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"598d9322470c6b8552f6738bcf5353e0e06f53c48001ea1b2d8124077c5bf852"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: enable when it is more reliable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/python.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"596a809258185272bb825d45db8af3ad10b67c09916a4ea2f5518636dd483ef1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use windows set of versions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/ruby_windows.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ab7b85ed41c457c21a2299b6dc400bdee942a334dd8034a7bb2f78c2d8e078"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(2027.8.0): Remove the per-tool warning accessors once the NixOS \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/settings.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31a5cce9a4dfbacf1d31df597a9e2dbef98e020fdc81ad9620f6d171434121f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: the toolset stuff doesn\u0027t feel like it\u0027s in the right place here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/venv.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"370e9e8e313a8e0677dd25bf9bf94f3104da4959eb40a2a19a3db2bb0b32f02a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: in fact this should probably be moved to execute at the same time as src/uv.rs runs in ts.env() instead of config.env() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/venv.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a84e57c8f793512c6ba33b6bc148efa6ef8bb8bfb989afb7af711c75ad6579"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this has become a complete mess and could probably be greatly simplified \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mod.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bac6cce33098bc42b09ca7dbd277c356db52a28bc441492dd41725491e7f0a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: env is being calculated twice with final_env and env_with_path \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/exec.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff51fec4b866d4147d94f4f1016d130884913cdebf704dcfd1b711e35c055cf3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: global is a little weird: it will show global versions as the active ones even if \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/ls.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81a125603fcb1504a15aefe78ca9e6dfca782be59dd95d407f130a041f732a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: instead, check if bin is in shims dir \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/shim.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f793037b81a20bc4709d33b541cd54e308be4452113bcc75bd75f913790beb7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this should only happen on this tool, not all of them \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/use.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aa05da6fec32b379b821ce966e681520e469d1af31e19023d51a6dda8cd228"}},{"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":"src/cli/tasks/add.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"18df8989fb63eb4384fb10d3512bd029482b3cc52a915a05312c253a089a5b2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fill this out \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/ls.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"912cc1eac2e78f96306f71982df49d9bdcbe16fd510dceac306fabaf09f3e50a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: uv doesn\u0027t support symlinked dirs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/sync/python.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5c1eaa3d6f18c531a79ade416b6cdbb9830cecc009c27438d19d939e7c642f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: exit early if envrc_path exists and is up to date \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/direnv/envrc.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd40b7786c1c58699dc37acc85c03ebedd4e80ab1d39ef7c7f990d61acd78e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: find a way to enable this without deadlocking \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/asdf.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72c2a8c3937147d0571de8b9c0958d88d8204ff936c2018424c259d50b4aefd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe fetch tags/branches from git? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/cargo.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e18f8669fd6d9035caeef72ef9b64cf7d4d54645d2568063dcbcbfbe86b64c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Find a way to get the list of executables from the gemspec of 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":"src/backend/gem.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77d74b240b3d3f1e833648cce9b0dfd63dba06169280ee03ee9b143c717aedf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement checksum fetching \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":6520}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fdc85dcbcd145c29be454c3fe2c291a94a213e445d56fc434842a0c5168712"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement size fetching via HEAD request \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":6521}}}],"partialFingerprints":{"codehealthFindingId/v1":"54004fc5c55341ca2130cab17d6f5ff7a1c7dd3862c81ce38d76502448daf044"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement checksum fetching from releases \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":6555}}}],"partialFingerprints":{"codehealthFindingId/v1":"847f9479023d5fb8fdc79e0b6facc6c58e2ef8e64f6b61883135f04cc2a988e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement size fetching from GitHub API \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/mod.rs"},"region":{"startLine":6556}}}],"partialFingerprints":{"codehealthFindingId/v1":"657e9e54bbd7ac8c08bc0db441d120ccdf741f69207e464bcd2ec987eec388bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once bun supports querying packages without package.json, this can be updated \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/npm.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c03f9455de62770a9bd634f536c4011adf1b4887f7f8b03f6c1b4ac2489092a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: hacky but does not compile without it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/ubi.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfc84c7c3a8a9b528ccf7e57df1dbb0f7fbf7dfe89229152cb80070268f98eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: expose a plugin hook (e.g. BackendLockInfo) so custom Lua backends \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/vfox.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"9569658e93730b0d59ceaf4556bf04681282c2f5791a384328ebf2d06020d08b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support a vfox backend plugin capability/metadata field 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":"src/backend/vfox.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48a05b115685ab17fa0c486ba0a464b9a8ba4e1c4c0e86a3972e64e4a4385f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: put this in ctx.pr.set_message() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/vfox.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2d7f77115a964a06115b546ef83ea39090c5d31a4d80a0ea12ff74f59702f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this not a hash key anymore to use 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":"src/args/backend_arg.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2436e7e5cd1b8d3500522ac63dd90854df79bfe1371a02009fb228bfe117b511"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: see above about hash key \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/args/backend_arg.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b11696024382b23914b038b27306b64bef3258305b7f0b024a2320d656c0320"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Once Shiki bundles KDL (tracked in shikijs/textmate-grammars-themes), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/config.ts"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"812254dfb35d010e96e0eb2880f9de10294778730289f3c9217582b1aafbb6a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this actually work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfox/src/lua_mod/html.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fe1703a7720b1b32fa4f5a010be3e0114218d9a61eddd7313b871a761630f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check results \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfox/src/lua_mod/html.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4a658e55eb1c026f892d45750b3138459e01d261cc87a5e5be8c3402336605"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we probably shouldn\u0027t assume raw is tar.gz, but this was to retain existing behavior \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/file.rs"},"region":{"startLine":2596}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c642bd1ab8f17bd0667ff260cbed158499c50b36d1ec7b730e3f1069eaba4c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: show progress \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/file.rs"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68c72f1f0ac6b64ef43a96245466f8fb636b1b0593f8fc32c7c906d7c94b11a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: not this when I can figure out how to use eyre properly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/http.rs"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31796934c571e18136197e57b2ad25ce90342ada635a47f5bc61a20dc3c11ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement moving to and editing the new field \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-interactive-config/src/editor/actions/edit.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e113aa1fe8bdc499b5c52cbf227c19631d96fb0f66e381ff8df828f2f1f42383"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: it would be possible to track if the user specified a string and if so, continue that format \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-config/src/task/dep.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a597f96a6358734aa11cd56b72b4611c5e7a18429060ecfddc3123fc2285d880"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This does not support \u0060{{.Asset}}\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":"crates/aqua-registry/src/types/verification.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d73237df3427c4550b3dfed5c43ac11825c7a7a241c59cabe9e0ff01267050"}},{"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: 5 of 22 project(s) overshoot their size bounds, lowering Project Cohesion to 5.5/10. The most over is \u0060(repository root)\u0060 (328500 LoC, 560 module-visible types across 62 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":"4f32e8f3fbf7570a6be9670d21e5c6b43cdac618ba5bf8a556a1c427f087797e"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4995bcbd98126fb95da2a940eb536d9c7b146863d491efaf62ef78c91ca12844"},"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":"4678f84762c04cdb3f6f30858a5fcaedbbd1320dcaa99a2aa2ef06c191d88a72"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99df662f7e0dcb633bd7cdf5a2b8f245a968de179ae3df54f6acce65a8f26a85"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2f4d416015102b2b1061cc772f169e4143eaaf8fbc9f12822a2e6854c1ed1da"},"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":"336551f13c5e7ba2c2ecdc6104ecce0a553867d8133c2c2256c9e0f1be9be759"},"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":"d64df1ed560bf331a91960ad3fb6b8efaf19d66d9d480a02dc4e4658d77a96ef"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6101122318cca03e208ef00da8436d053e1492dca7d22b2b6efad8765b155f4c"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b92cae77e913987e4c944fbb675df40c5562e1ff8658e10b891981c42f6b8036"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"37c4e3685a8266c2269c7e2858585a9149475088c16751bc212d29c3f0766763"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"054707545418da025855ff928171cb1c0e474e07e3d1b9ab483af04773a153ba"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"195cbae80e2053370a527292e3b04604fe28afbfc81e7ce4cd0d663d3884f61a"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b045f06583c9b465f808666ab807bb301b75e163408a0670ffe050a381f461f6"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9cc11eb69cf95bfe0cfc5a25c9d70a4fca66c10006decc718eb72c016eac69df"},"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":"87a925eba98121c4bce51a8d5e21b7beeec7606109f07f77015e4ebf42865e65"},"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":"09d7bc4bbe5b5e18db1457f395325acce7cbddc2b8934e051a97c43da47c7d2b"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"03b75cb69709fe735a9eb585d01d3be7ce35367c083b30fb6f2a595045b11679"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-88","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":"7447b0f98115028e3ec984ac9bdf42a81aca1f4781648009ef327b855cfb95b9"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2028c168a84af469f21b1ad2b1de95364f54467c5f346fa9a59f5d83012f7315"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76a768be28af2edd3ff5b8ba45d05b0ae94fb9647ffbb12006daf064c16ed2d4"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"6af2a4dd66d7507e2b082dd931ae63c1472a544328129e62f21faa42e143c4c3"},"taxa":[{"id":"CWE-570","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-571","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","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":"78478b144b6b9cfca96f916da7e6de0190f8bac7c599ba858ed467bc9a7eaa4a"},"properties":{"dependency":{"package":"gix","version":"0.89.0","advisory":"[GHSA redacted]","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":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"2b5cc6a78fe02a95b2f6755616011982ae866dcba8c2aeaae7b037f36ce19be5"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","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":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","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":"35bd835fcf003cf3a7b49b86bdff9a197a4b7f04ac962e67f6482102c80b3d29"}},{"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":"9e97e7e2198948c79f52ee466cd44294b4d4acd7ac9e474f568601d2cf03ce0e"}},{"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":"b2bf38e3cc4b91b4a36f8dae893afa4c7a48584bee1f8421dd9994c8e67a2eb4"}},{"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":"80cb15f96c5d8971115f57a24ba9e0739734a1ca8cc3ca9cc27e168cc06f8f63"}},{"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":"cda32186a062ca137505bcc30107ea817ade22ea18b8d95604581eb4af124a9e"}},{"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":"5bdd74160d11b182504bac933ddd99f708e57f6effd59a50d5f86ac11f6ca9e3"}},{"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":"54c7c114e64e20425279187a25a0c3835480beba07d4d25c54e39de8469c43db"}},{"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":"3922a51a2877db2d32b209b361a9e83e66f6f34325f83c842a903d454f81d079"}},{"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":"fc37928f2ede10fec69243b9d84c1c8c8fb176dc1ef2e7c237d4610eff521387"}},{"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":"e0a7959466df7f7903369b2b7c6219bb6fdf2b5e459e2a77cd4e90c238d570b3"}},{"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":"cabfbbea2b7d29ab5c2675d5dcfb862ccf804032887d8cc3fbab2e811201b31b"}},{"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":"b67787f58bbdcde79a43cc08af597219f8bc8ccd5a82b8588a8f7af6b62ec402"}},{"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":"29ca72965a9d7c96475c13ef9fff564286375f3c5ec15df56b8499b135e66b4f"}},{"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":"a9735d7994b6c4668de55f0f573a651ebd59dec528b8987dd49aa6620699d1a9"},"taxa":[{"id":"CWE-276","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D32","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":"b47decc3ee58d91ef48f4ebba1cc894e9c762b6c302bc43500ea77a8221787eb"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 upgrade.rs: \u0060crates/mise-system-packages/src/lib.rs\u0060 (context crates) and \u0060src/cli/system/upgrade.rs\u0060 (context cli) sit in DIFFERENT parts of the tree yet change together 79% of the time (11 of the 14 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 \u006048d2fd0e\u0060 feat(bootstrap): support zypper host packages (#13335) (at that commit the file was still \u0060src/system/packages/mod.rs\u0060); \u006082052914\u0060 fix(bootstrap): reject two spellings of one package that disagree (#1\u2026 (at that commit the file was still \u0060src/system/packages/mod.rs\u0060); \u0060e09d0963\u0060 feat(bootstrap): add winget package manager support (#12928) (at that commit the file was still \u0060src/system/packages/mod.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ddf5a91982dcd98cdd368ea3a0d47531d53ec506b69e6600b7338ce9666f70"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: resources.rs \u2194 mod.rs: \u0060crates/mise-system/src/resources.rs\u0060 (context crates) and \u0060src/system/mod.rs\u0060 (context system) sit in DIFFERENT parts of the tree yet change together 62% of the time (10 of the 16 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 10 shared commits counted here, the most recent 3 are \u006082052914\u0060 fix(bootstrap): reject two spellings of one package that disagree (#1\u2026 (at that commit the file was still \u0060src/system/resources.rs\u0060); \u00604252b279\u0060 feat(bootstrap): compose config roots (#12105) (at that commit the file was still \u0060src/system/resources.rs\u0060); \u006084c54e31\u0060 feat(bootstrap): support self-updating and adopted brew casks (#12074) (at that commit the file was still \u0060src/system/resources.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/resources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0457bf0b675257af23d241bdc74b34d6e8893c85ab515930dedc507e500b82"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 mod.rs: \u0060crates/mise-system-packages/src/lib.rs\u0060 (context crates) and \u0060src/system/mod.rs\u0060 (context system) sit in DIFFERENT parts of the tree yet change together 50% of the time (11 of the 22 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 \u006039a82172\u0060 feat(bootstrap): enable COPR repositories with [bootstrap.dnf.repos] \u2026 (at that commit the file was still \u0060src/system/packages/mod.rs\u0060); \u0060926dd15b\u0060 feat(bootstrap): add snap package manager (#14402) (at that commit the file was still \u0060src/system/packages/mod.rs\u0060); \u006082052914\u0060 fix(bootstrap): reject two spellings of one package that disagree (#1\u2026 (at that commit the file was still \u0060src/system/packages/mod.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2230d853fcfdd167908f4db9465e438eb00dce16111eb6757087790493562ea5"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 install.rs: \u0060crates/mise-system-packages/src/lib.rs\u0060 (context crates) and \u0060src/cli/system/install.rs\u0060 (context cli) sit in DIFFERENT parts of the tree yet change together 50% of the time (11 of the 22 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 \u0060926dd15b\u0060 feat(bootstrap): add snap package manager (#14402) (at that commit the file was still \u0060src/system/packages/mod.rs\u0060); \u006048d2fd0e\u0060 feat(bootstrap): support zypper host packages (#13335) (at that commit the file was still \u0060src/system/packages/mod.rs\u0060); \u006082052914\u0060 fix(bootstrap): reject two spellings of one package that disagree (#1\u2026 (at that commit the file was still \u0060src/system/packages/mod.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5431ad19173ac6e21639c6d7da956e747714227f996a4ebc890f4989f31d3a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: install.rs \u2194 upgrade.rs: \u0060src/cli/system/install.rs\u0060 and \u0060src/cli/system/upgrade.rs\u0060 change together 93% of the time (13 of the 14 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u006083345da9\u0060 feat(bootstrap): add --upgrade to upgrade packages and tools (#14433); \u0060a50c23e5\u0060 refactor: remove every core \u2192 cli dependency (#13642); \u006048d2fd0e\u0060 feat(bootstrap): support zypper host packages (#13335) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/install.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ede231354f5548449a06ba55fda1b850b41c49c723710daffc2de702ff8600"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cache.rs \u2194 types.rs: \u0060crates/aqua-registry/src/cache.rs\u0060 and \u0060crates/aqua-registry/src/types.rs\u0060 change together 82% of the time (9 of the 11 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006048c85e3e\u0060 fix(aqua): make the baked registry encoding deterministic (#14809); \u006013e05af7\u0060 fix(aqua): use crate names in cargo warnings (#12252); \u0060bc1bb339\u0060 fix(aqua): apply explicit package type overrides (#11901) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/aqua-registry/src/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ad162027a70da1d9fa234756d19dd419fe66aded9774570bc8fbc85c38ee55"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: outdated.rs \u2194 upgrade.rs: \u0060src/cli/outdated.rs\u0060 and \u0060src/cli/upgrade.rs\u0060 change together 80% of the time (16 of the 20 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 16 shared commits counted here, the most recent 3 are \u006090ca0b36\u0060 perf(outdated): resolve many registry tools with one request to the m\u2026; \u00600090d946\u0060 feat(upgrade): add --global so self-updating tools can update through\u2026; \u0060710686ec\u0060 fix(cli): replace unimplemented!() in --monorepo flags with an error \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/outdated.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9866fd8b4862b38907f2323831ab90d18966b73f6e0c484675d10d3a2f19d9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mise_toml.rs \u2194 tool_versions.rs: \u0060src/config/config_file/mise_toml.rs\u0060 and \u0060src/config/config_file/tool_versions.rs\u0060 change together 79% of the time (34 of the 43 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 34 shared commits counted here, the most recent 3 are \u006000da73f7\u0060 security(hooks): render hook commands once and keep templates out of \u2026; \u006027e92ea0\u0060 security(config): require trust for path: tool versions (#14358); \u0060d1ca2185\u0060 feat(config): expose the config file\u0027s own path to templates (#12454) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/config_file/mise_toml.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a399ff7576ee71b0af8fac39203695b64aa16734daf482fc70d0bde8601a249"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: ls.rs, set.rs, unset.rs: 3 files \u2014 \u0060src/cli/settings/ls.rs\u0060, \u0060src/cli/settings/set.rs\u0060, \u0060src/cli/settings/unset.rs\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/settings/ls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d69dc6af66617fd65c3dc541299412e17eb74a0296f1c846f3c36507ead058b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: install.rs \u2194 use.rs: \u0060src/cli/system/install.rs\u0060 and \u0060src/cli/system/use.rs\u0060 change together 73% of the time (11 of the 15 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u006083345da9\u0060 feat(bootstrap): add --upgrade to upgrade packages and tools (#14433); \u0060926dd15b\u0060 feat(bootstrap): add snap package manager (#14402); \u0060a50c23e5\u0060 refactor: remove every core \u2192 cli dependency (#13642) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/install.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa12f1d78a1b2d06cd186575b282b5a69087a5334768ce5c528db2bcaf00dee"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: upgrade.rs \u2194 use.rs: \u0060src/cli/system/upgrade.rs\u0060 and \u0060src/cli/system/use.rs\u0060 change together 71% of the time (10 of the 14 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006083345da9\u0060 feat(bootstrap): add --upgrade to upgrade packages and tools (#14433); \u0060a50c23e5\u0060 refactor: remove every core \u2192 cli dependency (#13642); \u0060e09d0963\u0060 feat(bootstrap): add winget package manager support (#12928) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/system/upgrade.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a015e91201f83f449d82f2da19ea07626cbd1a9085fb6079c94dd6c9ba2b4fd3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: node.rs \u2194 python.rs: \u0060src/cli/sync/node.rs\u0060 and \u0060src/cli/sync/python.rs\u0060 change together 64% of the time (7 of the 11 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060f2b35406\u0060 fix(lock): allow lock and upgrade in locked mode (#10111); \u006030d9e19e\u0060 feat: added \u0060mise sync python --uv\u0060 (#3575); \u0060ba961329\u0060 fix: bug with missing shims after install (#3159) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/sync/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0e4132d6686779efef2bec5328c422b65f566932432d1f2a6327c8c218ee62"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: envrc.rs \u2194 hook_env.rs: \u0060src/cli/direnv/envrc.rs\u0060 and \u0060src/cli/hook_env.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 \u00601aa36708\u0060 fix: bug fixes with tools=true in env (#3639); \u006039ab82ce\u0060 fix: windows paths; \u0060a7aa50ca\u0060 refactor: env parsing (#1515) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/direnv/envrc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4fec81c015806a6866de11d32eec31a0b4d42a9b0a2ab84fe89be456bc54e5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: asdf.rs \u2194 uninstall.rs: \u0060src/backend/asdf.rs\u0060 and \u0060src/cli/plugins/uninstall.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, 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 7 shared commits counted here, the most recent 3 are \u006044cca9fe\u0060 refactor: split asdf into forge\u002Bplugin (#2226); \u00609314640a\u0060 verbose: improve verbose progress bar output (#1187) (at that commit the file was still \u0060src/plugins/external_plugin.rs\u0060); \u006037f592af\u0060 plugin-update: update in parallel (#1186) (at that commit the file was still \u0060src/plugins/external_plugin.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/asdf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d528dd24db22d036b525bf3c5719c9de29fe5d2a8643afdf0be66c12fe0b816"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: run.rs \u2194 edit.rs: \u0060src/cli/run.rs\u0060 and \u0060src/cli/tasks/edit.rs\u0060 change together 57% of the time (8 of the 14 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 8 shared commits counted here, the most recent 3 are \u0060d949e6c8\u0060 chore: update singular/plural forms for word \u0022task\u0022 (#7448); \u0060baa4d33b\u0060 feat(tasks): add experimental monorepo task support with target paths\u2026; \u0060be06de19\u0060 fix: use project_root for task execution (#2942) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90697e3c616df2807f0c476362c45c97628a58df5825884ac3cec7dd1c76228"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: hooks.rs \u2194 watch_files.rs: \u0060src/hooks.rs\u0060 and \u0060src/watch_files.rs\u0060 change together 56% of the time (10 of the 18 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006071529e4d\u0060 security(config): stop treating help, shims, hooks and config writes \u2026; \u006000da73f7\u0060 security(hooks): render hook commands once and keep templates out of \u2026; \u006049290aac\u0060 fix(hooks): run task hooks with mise instead of the initiating tool s\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/hooks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aacfd7add5ee99f6d3ff5c855b7fbcbcfc50b1af03030562f810e61e3a37075"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: settings.data.ts \u2194 settings.rs: \u0060docs/settings.data.ts\u0060 and \u0060src/config/settings.rs\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, 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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060d821d59f\u0060 refactor(cache): generalize remote action protocol (#11763); \u00601c4ebb54\u0060 feat(python): rework \u0060python.uv_venv_auto\u0060 setting (#7905); \u006049c7002d\u0060 feat(http): add URL replacement feature for HTTP requests (#6207) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/settings.data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df3fb37eedfda43af9ba4a971ab01a3ddb507645b360544fddfa0a823fef388"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: bootstrap.rs \u2194 edit.rs: \u0060src/cli/bootstrap.rs\u0060 and \u0060src/cli/dotfiles/edit.rs\u0060 change together 54% of the time (7 of the 13 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 7 shared commits counted here, the most recent 3 are \u00609a79c907\u0060 feat(dotfiles): remove targets with mode = \u0022absent\u0022 (#13513); \u0060f80454c9\u0060 feat(dotfiles): set target file permissions with a permissions key (#\u2026; \u00605fb0429e\u0060 feat(dotfiles): run history reload commands after mise dot apply (#13\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/bootstrap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f970a48abf51635c3e05334ec6646e221977c95405407237df3e159bfac836"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: info.rs \u2194 ls.rs: \u0060src/cli/tasks/info.rs\u0060 and \u0060src/cli/tasks/ls.rs\u0060 change together 52% of the time (13 of the 25 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u006006abf0fc\u0060 fix: require experimental for remote task sources, OpenTelemetry and \u2026; \u00607ecc466b\u0060 feat(task): allow {{ secrets.X }} in task env values (#13978); \u006052ee31d2\u0060 feat(daemons): let tasks require daemons and daemons run tasks (#13340) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d26135561e96182e7dd7b588f592dcb9ab6a52de439b823ddabd08a54b3c91"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: uninstall.rs \u2194 upgrade.rs: \u0060src/cli/uninstall.rs\u0060 and \u0060src/cli/upgrade.rs\u0060 change together 50% of the time (21 of the 42 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 21 shared commits counted here, the most recent 3 are \u0060329a7dda\u0060 fix(upgrade): defer pruning replaced tool versions (#12593); \u0060259b3584\u0060 refactor(cli): defer process termination (#11440); \u0060f2b35406\u0060 fix(lock): allow lock and upgrade in locked mode (#10111) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/uninstall.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"651ce965206dc6cbd25769b599ba8db2fa834ce87ca2a7797c0b034fe08698d7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: asdf_plugin.rs \u2194 vfox_plugin.rs: \u0060src/plugins/asdf_plugin.rs\u0060 and \u0060src/plugins/vfox_plugin.rs\u0060 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) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u0060da974fbe\u0060 refactor: distinguish \u0022could not ask\u0022 from \u0022no\u0022 in confirmation promp\u2026; \u0060ee3e9171\u0060 fix(plugins): support local paths in config (#11487); \u0060f617b961\u0060 feat(config): add MISE_SAFE mode to block repo-controlled code execut\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/asdf_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8caa38c377c7e06a0552728250e687ac9d2bd67ba99435470a37c1b672de3322"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: install.rs \u2194 uninstall.rs: \u0060src/cli/plugins/install.rs\u0060 and \u0060src/cli/plugins/uninstall.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise 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 \u006044cca9fe\u0060 refactor: split asdf into forge\u002Bplugin (#2226); \u00602b1aa1a9\u0060 logging: added --quiet flag (#1140); \u00609fba26f0\u0060 completions: fix zsh completions when sourced directly (#1080) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/plugins/install.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ed3fb352360c6a92cc21ff6d70c6f805b5658afea49abe0dcda5cb2e57fb84"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: unset.rs \u2194 use.rs: \u0060src/cli/unset.rs\u0060 and \u0060src/cli/use.rs\u0060 change together 50% of the time (5 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 between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006011c78ba1\u0060 feat(config): add global section write targets (#14018); \u0060e055799d\u0060 fix(unset): respect global config path from home (#10105); \u00604ed73b4d\u0060 fix: MISE_PROFILE fixes (#2973) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/unset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25601d36d488008fdcfb737bbb3f329ff79bc81eee6f081e074a495fe00e3845"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: envrc.rs \u2194 exec.rs: \u0060src/cli/direnv/envrc.rs\u0060 and \u0060src/cli/exec.rs\u0060 change together 50% of the time (5 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 5 shared commits counted here, the most recent 3 are \u00601aa36708\u0060 fix: bug fixes with tools=true in env (#3639); \u00606c74c4ac\u0060 chore: sign macos binary; \u00600a7d33b9\u0060 bump rust version \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/direnv/envrc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0615e5840bece8c022cbc7cb790c320d106ce78e99e87e4cc1fc422b766757"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: main.rs \u2194 shims.rs: \u0060crates/mise-shim/src/main.rs\u0060 and \u0060src/shims.rs\u0060 change together 50% of the time (5 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 5 shared commits counted here, the most recent 3 are \u00600f2a89a1\u0060 feat(doctor): flag a mise-shim.exe template older than mise (#14586); \u00602fcec190\u0060 fix(shim): support shared executable directories (#12675); \u00602e15e1ae\u0060 fix(generate): deliver Windows launcher arguments intact (#12463) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-shim/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7fc2f6e35ec5e1902de413ed0e5200355f7e33a2e27fc4557f243943012063"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"42503a92b437c506e62b4e3e227fd52413497b3ec844c7c896ed71c2358becb6"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Cvideo\u003E without a captions track: Video with no captions \u003Ctrack\u003E offers no captions. This player\u0027s source is set at runtime, so there is no caption file to author here: give the player a way to carry captions \u2014 accept a track/captions URL alongside the media and render a \u003Ctrack kind=\u0022captions\u0022\u003E when one is supplied \u2014 and capture that asset wherever the media enters the product (upload, import or generation)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/.vitepress/theme/HomeShowreel.vue"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f8dd7ad600f1095d29dd87ec78cef7cb96c848701248a2cd8e94a27c5b2aa4"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/registry.vue"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb42fb097980907b243609e58f6c30400faf118bfbc0187dda394dfaaa55c053"}},{"ruleId":"AC2","level":"error","message":{"text":"Link with no accessible name: A link with no text, aria-label or labelled child (e.g. an icon-only link) has no accessible name, so assistive tech can\u0027t say where it goes. Add visible text or an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/registry.vue"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"defc4cb568087e6298b15ae3c0344a8896b0e6815f1d93a290df91011c50d117"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/components/config-key-detail.vue"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5ae89d9c34730068c4d7c5f4b22a1bf5e71bfe6584209709369a9c73435edd"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (an accessibility check that can read your UI \u2014 no component framework was detected and your pages are rendered by server-side templates, which neither the JSX/Vue ESLint plugins nor the HTML-template linters can parse; run axe/pa11y over the rendered pages, or assert the accessibility invariants over that rendered HTML in the test suite you already have) and no axe/pa11y/Lighthouse in tests or CI. Start by running that check over your rendered pages in CI. What was searched, so you can tell an absence from a miss: the 13 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":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: TasksValidate.find_additional_graph_issues: \u0060TasksValidate.find_additional_graph_issues\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tasks/validate.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f6d8f076821586c4e16a658d6bcce4cbb8f3816b3b971de8957274284eb853"}},{"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":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 14/16 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/mise-shim\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::builder()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-tls/src/lib.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e9d35c36aa7bb55af05c5857e947f1cb3d562507810eae3bdc4c1bc63a842b"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060Client::builder()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-tls/src/lib.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d8af29284317c4ac9a32fe59dfd4b04f9102af4ed492ee3aa85a0337601b86"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ClientBuilder::new()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfox/src/http.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c7848e7d93e3f0a49a0d6cb4655a8fb08dfa8e5a3ca68c7fc0857e2c61e18c"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ClientBuilder::new()\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfox/src/http.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2e3a3932519f852c4e41b20d62a3fde37fc64c23f11409997f91ae439aac27"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060load\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/settings.data.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c52a1616aa8657d33e6da2f1eb812bbe0765f18a22a21b8952f835f79ec8b9"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository starts an HTTP server and nothing in its Rust source or committed \u0060Rocket.toml\u0060 secures the transport: no TLS served (actix-web \u0060bind_rustls\u0060/\u0060bind_openssl\u0060, axum-server \u0060bind_rustls\u0060 with a \u0060RustlsConfig\u0060, tonic \u0060ServerTlsConfig\u0060, a \u0060TlsAcceptor\u0060, Rocket\u0027s \u0060[default.tls]\u0060), no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (crates/mise-util/src/github_relay.rs:525)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Rust server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (crates/mise-util/src/github_relay.rs:525)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"S1","level":"note","message":{"text":"No inbound request validation detected: No handler of this repository\u0027s Rust server answers 400, 413 or 422 (\u0060StatusCode::BAD_REQUEST\u0060, \u0060HttpResponse::BadRequest()\u0060, \u0060Status::BadRequest\u0060, tonic \u0060Status::invalid_argument\u0060), and nothing declares validation \u2014 no \u0060validator\u0060/\u0060garde\u0060 derive, no body limit (\u0060DefaultBodyLimit::max\u0060, \u0060RequestBodyLimitLayer\u0060, \u0060JsonConfig::default().limit(\u2026)\u0060, Rocket \u0060Limits\u0060) \u2014 nothing shows inbound requests being checked, and refused, before a handler acts on them. A check that answers its failure with 200 and an error body is not seen. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (crates/mise-util/src/github_relay.rs:525)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0ffa303f3c9cef4b4c2cf028a78ce2f3c83f6078f80716eea7362fad047265eb"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: No package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock \u2014 JS installs aren\u0027t reproducible (SSDF PW.4.4). Commit your package manager\u0027s lockfile and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"40a08798dc9f9c819eaa9f7c084938e1cf2517a9281aed2c31563d6f7d5ba90d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060@languages[@default_language] || @languages.values.first\u0060 appears character-identically in 2 files \u2014 crates/mise-system-packages/src/brew/cask_shim.rb, crates/mise-system-packages/src/brew/tap_cask_metadata.rb. 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":"crates/mise-system-packages/src/brew/cask_shim.rb"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"977ee9652890d80f27520b58902ddebdf61ba93f192dd8eeaf45ba6c5ffce941"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060OS.mac? \u0026\u0026 macos \u0026\u0026 macos_condition_matches?(macos)\u0060 appears character-identically in 3 files \u2014 crates/mise-system-packages/src/brew/shim.rb, crates/mise-system-packages/src/brew/tap_cask_metadata.rb, crates/mise-system-packages/src/brew/tap_formula_metadata.rb. 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":"crates/mise-system-packages/src/brew/shim.rb"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b39a8178ea6a9cffb5018d76c5a28fb6817c229511581ac4aed4443decccfd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host \u003C= target || host.same_release?(target)\u0060 appears character-identically in 3 files \u2014 crates/mise-system-packages/src/brew/shim.rb, crates/mise-system-packages/src/brew/tap_cask_metadata.rb, crates/mise-system-packages/src/brew/tap_formula_metadata.rb. 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":"crates/mise-system-packages/src/brew/shim.rb"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e7a471433e5ece243f1b24037969af13fe41c484327a7f0841a546f9be8d02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mine[0] == theirs[0] \u0026\u0026 (mine[0] \u003E= 11 || mine[1] == theirs[1])\u0060 appears character-identically in 2 files \u2014 crates/mise-system-packages/src/brew/shim.rb, crates/mise-system-packages/src/brew/tap_formula_metadata.rb. 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":"crates/mise-system-packages/src/brew/shim.rb"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a5de523b4e17255062aaac0b119051b2ab8b2260d6dd06263236d5c632cf6b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!(self.global || env::in_home_dir()) || self.path.is_some() || self.env.is_some()\u0060 appears character-identically in 2 files \u2014 src/cli/system/import.rs, src/cli/system/use.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":"src/cli/system/import.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2485e2506b9c4c5de1fdb3a318f5a62e85be213b19eca0540c704c020b15fea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Settings::get().task.run_auto_install || !Settings::get().auto_install\u0060 appears character-identically in 2 files \u2014 src/cli/run.rs, src/task/task_tool_installer.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":"src/cli/run.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"9339487004d85610952d106ef5c0fd1d1fde4a2926eb99aca1442f3b1820388b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!crate::config::is_global_config(path) || crate::config::is_system_config(path) || crate::config::is_override_config(path)\u0060 appears character-identically in 2 files \u2014 src/cli/system/import.rs, src/cli/system/use.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":"src/cli/system/import.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"187e5e7b78ec67077a17da31780bc5ef74dcbd704a572fc9d3430dc6cb8cdcb6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!dry_run \u0026\u0026 !yes \u0026\u0026 console::user_attended_stderr()\u0060 appears character-identically in 2 files \u2014 crates/mise-system/src/user_services.rs, src/cli/system/install.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":"crates/mise-system/src/user_services.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"3781b02b2ed2550c545c59ed8a493b905761c6188d4af211f91fffeee027305a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!file_type.is_file() \u0026\u0026 !file_type.is_dir()\u0060 appears character-identically in 2 files \u2014 crates/mise-oci/src/registry.rs, crates/mise-system/src/files.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":"crates/mise-oci/src/registry.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a205f2f5e3af0c6d641bbb77a1dd2be02b770978fecf6d5188a4f86ef9e37bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!force_verify \u0026\u0026 locked_provenance.is_none() \u0026\u0026 lockfile_has_checksum\u0060 appears character-identically in 2 files \u2014 src/backend/aqua.rs, src/backend/github.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":"src/backend/aqua.rs"},"region":{"startLine":3267}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bad832508eca1d6673502297efa7e1e37fec790776e0cb5f97edf0719a610d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!format.is_archive() \u0026\u0026 format != file::ExtractionFormat::Raw\u0060 appears character-identically in 2 files \u2014 src/backend/http.rs, src/backend/static_helpers.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":"src/backend/http.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91e631dc498936731fc8ea0a8d87ab99efaaabee150d653a3554435b9c4a5bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!input.is_empty() \u0026\u0026 !input.contains(needs_quoting)\u0060 appears character-identically in 2 files \u2014 src/shell/elvish.rs, src/shell/fish.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":"src/shell/elvish.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7534999620fba00603c632cc668c0046e4b0510f80417d54bd69b672d14aea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!opts.yes \u0026\u0026 console::user_attended_stderr()\u0060 appears character-identically in 2 files \u2014 crates/mise-system/src/edits.rs, crates/mise-system/src/files.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":"crates/mise-system/src/edits.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"493a1f99e8506b34dcd9f85e011f1d5499f03d39fd3aa416043cd40c52326fe8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!output.status.success() \u0026\u0026 output.status.code() != Some(1)\u0060 appears character-identically in 2 files \u2014 crates/mise-system-packages/src/apt.rs, crates/mise-system/src/history/shadow.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":"crates/mise-system-packages/src/apt.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8b74f3e544fdc4a872031214043f00fc1935e8557f9a46cfb450e9f8072f28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!pkg.repo_owner.is_empty() \u0026\u0026 !pkg.repo_name.is_empty()\u0060 appears character-identically in 2 files \u2014 src/backend/aqua.rs, src/cli/search.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":"src/backend/aqua.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22aa284c59976934d684fadde4ebb9a59c151e4a2f740d1bdbcd6693ccc90ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!settings.yes \u0026\u0026 self.repo_url.lock().unwrap().is_none()\u0060 appears character-identically in 2 files \u2014 src/plugins/asdf_plugin.rs, src/plugins/vfox_plugin.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":"src/plugins/asdf_plugin.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e810f861015ea71233b531d14cae70324ebdeac72af92bb890186a3c6d49488e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!spec.cmd.args.is_empty() || !spec.cmd.flags.is_empty() || !spec.cmd.subcommands.is_empty()\u0060 appears character-identically in 2 files \u2014 src/task/task_executor.rs, src/task/task_script_parser.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":"src/task/task_executor.rs"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf095bdb271e464327281f2d33496dadda0a2e8a55cf33964e4ee2647c0a662d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060EXIT.load(Ordering::Relaxed) || mise_util::cancel::mark()\u0060 appears character-identically in 2 files \u2014 crates/mise-ui/src/ctrlc.rs, crates/mise-ui/src/ctrlc_windows.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":"crates/mise-ui/src/ctrlc.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c435642cc5632c2be442c6a221f2dd8ef19e625c3ed182ce363e24f11389a61d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Settings::no_hooks() || Settings::get().no_hooks.unwrap_or(false)\u0060 appears character-identically in 3 files \u2014 src/cli/tool_update.rs, src/hooks.rs, src/watch_files.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":"src/cli/tool_update.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8db7f67a766d4d96dc37be68907847fa032ed9514e7e1c99fda5e1219bea738"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.is_empty() || b.is_empty() || (windows_arm64(a) \u0026\u0026 windows_arm64(b))\u0060 appears character-identically in 2 files \u2014 build.rs, src/registry.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":"build.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"8077870801d158afbce5aaa509bce953b0bee86aa4bfff29d4fc6748f008b9ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060backend.plugin() \u0026\u0026 !plugin.is_installed()\u0060 appears character-identically in 3 files \u2014 src/cli/doctor/mod.rs, src/toolset/tool_version.rs, src/toolset/toolset_install.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":"src/cli/doctor/mod.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"24290ab1b9d388dc3da6fd8c6c5a85485e2fd35445cb0e6b842a2df07ccdf007"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060backend.starts_with(\u0022packslip:\u0022) \u0026\u0026 new.signer.is_some()\u0060 appears character-identically in 2 files \u2014 src/lockfile.rs, src/lockfile/generate.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":"src/lockfile.rs"},"region":{"startLine":3782}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1f6f90e69ad970f59df48747b38c43ac4f0ad7f7bac68d640d13f5c2fcaa35"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.len() \u003E= 2 \u0026\u0026 bytes[0].is_ascii_alphabetic() \u0026\u0026 bytes[1] == b\u0027:\u0027\u0060 appears character-identically in 3 files \u2014 crates/mise-util/src/path.rs, crates/mise-util/src/remote_source.rs, crates/mise-util/src/windows_posix.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":"crates/mise-util/src/path.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ab3408bd5f9ae309dafbae796236be420d4c00d3980817effd5b91f7063ebe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dry_run \u0026\u0026 plan.action == ResourceAction::Unknown\u0060 appears character-identically in 2 files \u2014 crates/mise-system/src/accounts.rs, crates/mise-system/src/services.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":"crates/mise-system/src/accounts.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"00eb6898644d53b965ccb3951359dd1bb1165728f09bb0a7486a180ff79df978"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filter_prereleases \u0026\u0026 VERSION_REGEX.is_match(v)\u0060 appears character-identically in 5 files \u2014 src/backend/aqua.rs, src/backend/aqua/tests.rs, src/backend/mod.rs, src/backend/ubi.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":"src/backend/aqua.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08d55761c0581155ba47f3e58441a22657c060e6e94799319f04fb3077f66a5"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) reduce the strict null checking score: ~1.4 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 56 assertion(s) across the 40575 source line(s) of the 136 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: docs/.vitepress/theme/showreel/kit/diagrams/skills-link.ts (5), docs/.vitepress/mise-toml/scan.ts (4), docs/components/config-reference-toml.ts (4). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"edb251d0f8dd1deb75ff6fa12d145c3d5c948a70b0aaf8da052107c857335979"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060claimed_ports\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/runtime.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"be79f7bbfd3422aab9382e427ee0db395782eead10bb08c35c0ce8716e405df9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060executable_stamp\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-daemons/src/runtime.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc4e3104b0e3c5e0afc5c1dd368616962fe3dd2e6071a240204f511c3c226af"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060script_aliases\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-lsp/src/tasks.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"94314d6c7f59b7995333e408de31ff40c039ee6cc2f614eadf4c8036b126bc2e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060certificate_uri_sans\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-sigstore/src/certificate.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a07457520a0bf52c5d6094a1ce799d1241c1a95acdefd31a1e11229047a19dc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060certificate_identities\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-sigstore/src/cosign_identity.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa4f4b6455119bd983c04682355cd0667c8171f8ac0a47b90749be16879fdda"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_records\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/dotfile_groups.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31848e5f39ac04f896d8b641043e527a4f9e6aeeed623dc20dbea6012957af3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060exclusion_sources\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/config.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"4010c40e8733e1395e92c6fb9939c39b877f6f2000b309110f27315cfc3a23e8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060take\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system/src/history/notices.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d1a1638ec446cd5f355df937c93bec1e80831183d32d932dd3a142f8b215c3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060origins\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/apt_sources.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fc4415539532490cf1d21b8211931acfc4eb45555a824aaa2a327832bf1ea8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060installed_skip_reason\u0060 turns every \u0060Err\u0060 into \u0060Ok(Some(\u0022skipped: installed app version is unreadable\u0022))\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/mod.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3c71a84c252481bafa9f538ed6e3d9e7b89d466ed69733d676f97d7665387d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060single_nested_cask_archive\u0060 turns every \u0060Err\u0060 into \u0060true\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/fetch.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"673c3b218f60600dc1aa7d61b8b21af1de61698a3b6bd81d32da98ab0bb64555"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060installed_versions\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/cask/state.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dc8f5dd4f8cf9b03105db76fedc32e9f60d9ed7ee97f53247ad0fb9c36659a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060bottled_by_homebrew_at_least\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-system-packages/src/brew/pour.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5c12fb1bfe12243226fe2cc12a5f3949364af75bac4f0d3dac3de857e5aca9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060find_expired_glab_tokens\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-util/src/gitlab.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"477954a1a488e59b51ee04d09c9a61ee68ad22b8d69df59749d9850cc59d2e6d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060values_to_string\u0060 turns every \u0060Err\u0060 into \u0060\u0022?\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/vfox/src/lua_mod/log.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4774807cc6e519c5b14a0522f265d56e60584a70da391503ff696b3e03d5215c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060security_info\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/aqua.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc86a40553329e86bb34c1bc33bbc835f48c7fd71b1ef226c85aadc446a8852"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060lifecycle_scripts_from_package_json\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/npm.rs"},"region":{"startLine":2651}}}],"partialFingerprints":{"codehealthFindingId/v1":"664f7e9ffad4bd03a8688fc338306e8d67fd0178ba629aa44aedce933c5bcf93"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060yaml\u0060 turns every \u0060Err\u0060 into \u0060Ok(EnvMap::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/config/env_directive/file.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58589050c7fe685b383dca30b96dee6b11e1fc146ea79579062439c04fefe6b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060submodule_paths\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/deps/providers/git_submodule.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccde36bbd35f44bad59d6db0a70443139509c9546511235ffb85da589653b90f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060remove_selections_of\u0060 turns every \u0060Err\u0060 into \u0060Ok(0)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/install_layout/catalog.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3cbb8fd2b60e2530e97b2c022216c68218c56e1429ceb65d814f3cd4873051"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060new\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/swift.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e36b24b801c2e0953b644fec690a65c6531296f91166480c9dfde89dd93a60"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060resolve_lock_info\u0060 turns every \u0060Err\u0060 into \u0060Ok(PlatformInfo::default())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/zig.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"578baadf5b4d4fbcb7c05e5a8bec92582255ad2d90abb54e37a1fa3a7c46899b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060version\u0060 turns every \u0060Err\u0060 into \u0060\u0022(unknown version)\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/fnox/mod.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbae1c585aa11e769cfa444a69d472931c93321b47f7d9431fc99344aac34b93"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060file_keys\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/config/keys.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cc1b7ccff54d2fd50213e81b8c8b051589a660774ff7ea0cbbf7f6015456f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060helper_orphans_in\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/self_update.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6071d3c46905f54aa21c8c5522d78425b6e245349feee37d6fef69c1d7c644"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_executable_files_recursive\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli/tool_stub.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6fd69280d7e20362ed44e779919c9edacd805133090091e6180029802890909"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_dir_records\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/install_layout/catalog.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec042f771a2a41b81d7e101f3c29fc53c0ede6e5dfd2895284f5d31040a9cb1a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parent_cx_from_env\u0060 turns every \u0060Err\u0060 into \u0060Context::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/otel/task_run_telemetry.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"94af1915d0acff97460595cefc25ddecd2cff1ffe38c5b02b48ac360ae3cd5d5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060gemfile_watch_patterns\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/plugins/core/ruby_common.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"746942e17834d5a9cf8e37a96b352ca9db027d695bf7e49c91b93f67dae590b8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060status_line\u0060 turns every \u0060Err\u0060 into \u0060\u0022daemon: not responding\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/secrets/fnox/daemon.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3071fda6e23c6ef30a8646abd6dac3ebcdd201e723999deb4295d4c278288b7f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060task_tool_args_from_env\u0060 turns every \u0060Err\u0060 into \u0060Ok(vec![])\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shims.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"566d6970c882d364b56b555a2294abc1fb7ba05d33ebc0e97e958362a82d8ef8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060recorded_failures\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tool_update.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dea0dca06c0faf99e2521d2b42c1c6141b07a1ee53976148ad96f743ddee3c9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060command_line_paths\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/running_linux.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c193a6c6bb529fe3c66dc28fc33d5ee1d657d71856f118bc5caab56b5577a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060process_name\u0060 turns every \u0060Err\u0060 into \u0060\u0022unknown\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/running_linux.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec31e770a5082eae74072c08c08d8e96136012efd79fc6f256f5d34fa15022f0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060pids\u0060 turns every \u0060Err\u0060 into \u0060vec![]\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/toolset/running_macos.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6f2107ecb9130bd0123b1c7232c5c384f6ce7444dd2965e74217d6ae7ad269"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060triple.contains(\u0022-gnueabihf\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060triple.contains(\u0022-gnueabihf\u0022)\u0060 also satisfies \u0060triple.contains(\u0022-gnu\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/backend/cargo/native_binstall.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ff2d9e0b0fc926a58aa2af3938d5058cabfefa770b16a85dfe328654fdb877"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060layer.media_type.ends_with(\u0022.tar.gzip\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060layer.media_type.ends_with(\u0022.tar.gzip\u0022)\u0060 also satisfies \u0060layer.media_type.ends_with(\u0022.gzip\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/mise-oci/src/packages.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0843f277e60b1d498cd86778e06f06411b406af173cf3d68c7a40c12e2473389"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-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-276","guid":"4e27da05-61af-1d5c-aeb5-9f56b6ede3e3","name":"Incorrect Default Permissions","shortDescription":{"text":"Incorrect Default Permissions"},"helpUri":"https://cwe.mitre.org/data/definitions/276.html"},{"id":"CWE-312","guid":"96724ece-b0b2-a45c-83f9-0869fa3f6bea","name":"Cleartext Storage of Sensitive Information","shortDescription":{"text":"Cleartext Storage of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/312.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.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-359","guid":"b7dfe5b0-0351-645b-a311-b936102c2929","name":"Exposure of Private Personal Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Private Personal Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/359.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-570","guid":"1c94c05a-8663-e95c-b750-8a0329b22647","name":"CWE-570","shortDescription":{"text":"CWE-570"},"helpUri":"https://cwe.mitre.org/data/definitions/570.html"},{"id":"CWE-571","guid":"c0fe8265-1b68-da53-9217-4ebb9a96d5f7","name":"CWE-571","shortDescription":{"text":"CWE-571"},"helpUri":"https://cwe.mitre.org/data/definitions/571.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-88","guid":"32dec161-013d-ac58-8599-1309e12e67f5","name":"Improper Neutralization of Argument Delimiters in a Command (\u0027Argument Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Argument Delimiters in a Command (\u0027Argument Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/88.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"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-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":47,"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."]}]}