{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"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":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"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":"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":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"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":"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":"llmfit_core::hardware::gpu_memory_bandwidth_gbps (cyclomatic 95): llmfit_core::hardware::gpu_memory_bandwidth_gbps has cyclomatic complexity 95 (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":"llmfit-core/src/hardware.rs"},"region":{"startLine":3357}}}],"partialFingerprints":{"codehealthFindingId/v1":"9590865bb253844ddc85bb04f1d0ae08cae884fd3738812a7ee1183f569a6393"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelFit::analyze_inner (cyclomatic 75): ModelFit::analyze_inner 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":"llmfit-core/src/fit.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a895538d655af0d066d256a7c38f5b5d2793b3f394f6f67c60f02031589ebe7"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::main (cyclomatic 68): llmfit::main has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":4240}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d002c99a082715bdac00b7affbc97ee019adb30e91513e765b1beb2a531570"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::hardware::estimate_vram_from_name (cyclomatic 66): llmfit_core::hardware::estimate_vram_from_name has cyclomatic complexity 66 (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":"llmfit-core/src/hardware.rs"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7cb88541d53fac98bcc64972f921ebce7df59c0a5c7bcb28c39259febb2b79"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::models::parse_generation (cyclomatic 66): llmfit_core::models::parse_generation has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/models.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d767f9354f9746b0de8fc48fb2e10a79a4349c99426d1a6cd774c79fdca121e"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_events::handle_normal_mode (cyclomatic 65): llmfit::tui_events::handle_normal_mode has cyclomatic complexity 65 (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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb13a5ad08e2a9133ccc237f5978c78e7274b23561121c22ff1acd263bf79ae"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_events::handle_mouse_at (cyclomatic 62): llmfit::tui_events::handle_mouse_at has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cde5d065e104ce6f56cef376ee68cc8806d36ad9cd468a19f085251bc57a62"}},{"ruleId":"D1","level":"warning","message":{"text":"DetailPanel.DetailPanel (cyclomatic 57): DetailPanel.DetailPanel has cyclomatic complexity 57 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 22 belong to 5 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":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c8b86193364727dd2815d1b2e0bd569075b134027ac68ed61aa328634490b6"}},{"ruleId":"D1","level":"warning","message":{"text":"App::apply_filters (cyclomatic 55): App::apply_filters has cyclomatic complexity 55 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4b64fb8dbb66c94e6410d61372602d303e017ec184142083beb4153964f678"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw_bench (cyclomatic 49): llmfit::tui_ui::draw_bench 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9e60245b22a75fa26f37c08fcad702ac58f966c37aa8cf6052073b7e6fa872"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_events::handle_view_mouse (cyclomatic 45): llmfit::tui_events::handle_view_mouse 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"323a74ffd4c7a616d55b4784fe03507b746ae3478a03f08d685a0377aae46299"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw_detail (cyclomatic 45): llmfit::tui_ui::draw_detail 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d76313535e4d72cc9e6f02acf088e152b057c194967ee974a1ecf01c38cd60"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_events::handle_popup_mouse (cyclomatic 43): llmfit::tui_events::handle_popup_mouse has cyclomatic complexity 43 (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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"3731a7459d3657e435230462591cafb500938c05f746092ce5d8d43cbb94a05c"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::run_recommend (cyclomatic 40): llmfit::run_recommend has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":2554}}}],"partialFingerprints":{"codehealthFindingId/v1":"197bb8e385e199acc3d5343f5e7c20de4f5a43266e16c483c23a35d17242f44b"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw_table (cyclomatic 39): llmfit::tui_ui::draw_table has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d5cf121a73f9356db83928f9f6694a5a2771e769c922c163167d310e865ef8"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::status_keys_and_mode (cyclomatic 38): llmfit::tui_ui::status_keys_and_mode 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a077725ea8f808ea2f97327877b1687f1243c635a7baafb919fb75aeacb96142"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw_system_bar (cyclomatic 37): llmfit::tui_ui::draw_system_bar has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36bac069703837a8ef7fef3c2569f3a10d9f30bdc5c87a8bb45a88ba6467642"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::models::infer_heads_from_name (cyclomatic 32): llmfit_core::models::infer_heads_from_name 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":"llmfit-core/src/models.rs"},"region":{"startLine":2541}}}],"partialFingerprints":{"codehealthFindingId/v1":"faaf952657c5fe554ec8235f0db7504605caa662ee79c600655d48517dfddd53"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::run_download (cyclomatic 31): llmfit::run_download 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":"llmfit-tui/src/main.rs"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"954d51e004f8075d28906f11a5f62ac3f216d75a3e9f28d374fe59e73f301dc8"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw_search_and_filters (cyclomatic 31): llmfit::tui_ui::draw_search_and_filters 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cda503369c413ff6e55e59689733dc4c9d6d5aed739c7bea543e36efe65e04e"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw_filter_popup (cyclomatic 30): llmfit::tui_ui::draw_filter_popup 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5267}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f746042e025ebe67bf763db8c5b63c1c2b4a1523566e60367d926968da569"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::fit::estimate_tps (cyclomatic 29): llmfit_core::fit::estimate_tps 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":"llmfit-core/src/fit.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"992cd5c23891b4d7bd0a3d94a34332d9f04356fb0732b405ff27cf2fd1c79799"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::run_hardware (cyclomatic 29): llmfit::run_hardware 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":"llmfit-tui/src/main.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31d3635020185b7016845f39ff3389fe8431b0857b9b386b3ab9bb98fa4ccce"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.applyClientFilters (cyclomatic 29): utils.applyClientFilters has cyclomatic complexity 29 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/utils.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"61643bc6f83b3fb4f1236a81e72839fbd33e6ae66169cdb93295d3cb91d57440"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::fit::quality_score (cyclomatic 28): llmfit_core::fit::quality_score has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/fit.rs"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3f448c034368184cfec3c36dfb5a9a603cdf71b9b2109629bbb3da01de83d2"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::models::merge_duplicate_entry (cyclomatic 27): llmfit_core::models::merge_duplicate_entry 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":"llmfit-core/src/models.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9556455b6648620dce1d1537897458bdf3bb1bb151d986899419cb0190334da"}},{"ruleId":"D1","level":"warning","message":{"text":"App::with_specs_context_and_config (cyclomatic 27): App::with_specs_context_and_config 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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"068f4021a2792b8b9fbb1de5b8b9e9c58bacbf56e7b856ff114d5cb4102de2e1"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_events::key_hint_at (cyclomatic 26): llmfit::tui_events::key_hint_at 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa5e7d725329b39a7245d619b5b53900481d37927c7abc19a0a1fa3517f8aa2"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::run_quality_bench (cyclomatic 25): llmfit::run_quality_bench 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":"llmfit-tui/src/main.rs"},"region":{"startLine":3897}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fe519662c22c9c17f48e91cc02a8886677a5450cf511fb85654b40c92e5f32"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::run_bench (cyclomatic 24): llmfit::run_bench 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":"llmfit-tui/src/main.rs"},"region":{"startLine":3540}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f14b383afbfc32f9fe7e3bbda02f1da57ccaad0f9ba55bbc01e911627b20f32"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_events::handle_download_manager_mode (cyclomatic 23): llmfit::tui_events::handle_download_manager_mode 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":1461}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fdd93727f2db5abef88d69fdbaa7c4ba03c33f8e88a369332cc8e3f4b27a57b"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw (cyclomatic 23): llmfit::tui_ui::draw 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35eeac5868b6d46e0bfe2a3654da7598c44ab23beeb757b1ca52de3d2b9ac10"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw_multi_compare (cyclomatic 23): llmfit::tui_ui::draw_multi_compare 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d35f3422e5eed0e6ddd142669534d7f093b8563f8d31071bab4b39cabb3f823"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::doctor::vulkan_memory_heap_summary (cyclomatic 22): llmfit_core::doctor::vulkan_memory_heap_summary 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":"llmfit-core/src/doctor.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0102470749e845bf018c97c48b2d13ba00118742b95374418fcfac2a5562b357"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::serve_api::start_download (cyclomatic 22): llmfit::serve_api::start_download 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":"llmfit-tui/src/serve_api.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c035eda27d4990d39a12002a45faac674b0bb1c61fd09f9d4c446746585367d"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw_compare (cyclomatic 22): llmfit::tui_ui::draw_compare 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de08f92e6c662338345a0cedc9252f9638893f391556b2fa0eda189e903791d"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw_benchmarks (cyclomatic 22): llmfit::tui_ui::draw_benchmarks 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4957}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5510609434f3084ca1b6abf6a329868697c386cbdae7558078d1185fa5924b"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemPanel.SystemPanel (cyclomatic 21): SystemPanel.SystemPanel has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: 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":"llmfit-web/src/components/SystemPanel.jsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2992aa4367e54a3d8ca925e6f9f707a5031560fe1b5466fb87c639ae1ee83898"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemSpecs::detect_all_gpus (cyclomatic 20): SystemSpecs::detect_all_gpus 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"8626b13ecf3983c268cc7394069cc89579644d7aef8faf905a4ef47cd3b6da4b"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::fit::rank_models_by_fit_opts_col_dir (cyclomatic 20): llmfit_core::fit::rank_models_by_fit_opts_col_dir 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":"llmfit-core/src/fit.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83dd8fa585f476e7240473c2d7cd0e94faa76a65d34c7309f4752d95aab1040"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::storage::estimate_storage (cyclomatic 20): llmfit_core::storage::estimate_storage 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":"llmfit-core/src/storage.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f47625d99251e304e4c6a667f2cc5b8f9b7de57c8a8769f9551a754299fbde"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_events::handle_selection_popup_mouse (cyclomatic 20): llmfit::tui_events::handle_selection_popup_mouse has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: llmfit::tui_events::handle_key (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"e066fc9321970bba48a02b7f40b5a16152cb158d570a642aa1faebce6a5ea31d"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemSpecs::parse_nvidia_smi_extended (cyclomatic 19): SystemSpecs::parse_nvidia_smi_extended 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e4fbd949e55cc3a3ef17ccb6c3ab2701b64c0013232b492d88a72a29a96028"}},{"ruleId":"D1","level":"warning","message":{"text":"LlamaCppProvider::download_gguf_paths (cyclomatic 19): LlamaCppProvider::download_gguf_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":"llmfit-core/src/providers.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"118daab3f970a367fdcf4a9b30ef01d6851ac7541b5f68129c95cda2065da5e5"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::cluster_cli::interactive_init (cyclomatic 19): llmfit::cluster_cli::interactive_init has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/cluster_cli.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e8415d2129ec24a0c5efb6ca2d4ccf2e4dabe870481ddb830604ac29a96ee0"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemSpecs::detect_nvidia_gpu_sysfs_info (cyclomatic 18): SystemSpecs::detect_nvidia_gpu_sysfs_info 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce8421a27f1699ce9fd118d30e38a9445fc67f86c82b70718566c1c669eac68"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemSpecs::parse_rocm_product_names (cyclomatic 18): SystemSpecs::parse_rocm_product_names 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac2751c48bad1de959f65f2c2f4de84f9f25c4d60cf1d756304f0bf194263eb"}},{"ruleId":"D1","level":"warning","message":{"text":"Capability::infer (cyclomatic 18): Capability::infer has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: llmfit_core::models::quant_bpp (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/models.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"8921903c346cb5571c4fc75e99b2658e2a7216aa2edb69b83e57370eb9e811eb"}},{"ruleId":"D1","level":"warning","message":{"text":"LlmModel::params_b_from_name (cyclomatic 18): LlmModel::params_b_from_name 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: llmfit_core::models::quant_bpp (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/models.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"9452ecbbfe13906d33fb2fe416a81910c32ae88a54af76902b78deb5581663b5"}},{"ruleId":"D1","level":"warning","message":{"text":"LmStudioProvider::start_pull (cyclomatic 18): LmStudioProvider::start_pull 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":"llmfit-core/src/providers.rs"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4853d1c2e728017b63e652d3bc05ddc943dfc617dd78973779c213f9926813"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::plan::estimate_model_plan_with_config (cyclomatic 18): llmfit_core::plan::estimate_model_plan_with_config 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":"llmfit-core/src/plan.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eead077779d89f3f50251849e62d73e35505e85991eab1ca84390db37a4aeb6"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::display::display_model_detail (cyclomatic 18): llmfit::display::display_model_detail 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":"llmfit-tui/src/display.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baeb6fbfc583fa2498566e4722b1285c7cd74af188730587b9cbcc8d9c0736c"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_app::bench_offer_worker (cyclomatic 18): llmfit::tui_app::bench_offer_worker 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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bd6077ee66a8642ba06c9a54575aa5da562aba09790b1bfbc14ccda527ab3e"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::tui_ui::draw_plan (cyclomatic 18): llmfit::tui_ui::draw_plan 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9db603fc93bdbb607a3368c75a2d3f2b2bd7cb2ff00edee62f4a393c082f1c"}},{"ruleId":"D1","level":"warning","message":{"text":"SystemSpecs::is_same_gpu_name (cyclomatic 17): SystemSpecs::is_same_gpu_name 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e6567079d9891b2c5e44d5daf5d77822264923701e65da187b767842e12794"}},{"ruleId":"D1","level":"warning","message":{"text":"App::available_download_providers (cyclomatic 17): App::available_download_providers has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":4673}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3edf4c8138a9b7c1d5af8ef3f8ce1aa9c7da29cb0d181b1a677a21827d54353"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::ensure_dashboard_available (cyclomatic 17): llmfit::ensure_dashboard_available 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":"llmfit-tui/src/main.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa84b726905b023014a2be623670818a0e456e18ce3b55b4f29a75fc0353288"}},{"ruleId":"D1","level":"warning","message":{"text":"HardwareProfile::validate (cyclomatic 16): HardwareProfile::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":"llmfit-core/src/hwprofile.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab4025774757e91a30b6a3512780829dc268c1a46e10873b3d76773392f150a"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit_core::hardware::gpu_compute_capability (cyclomatic 16): llmfit_core::hardware::gpu_compute_capability 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":3688}}}],"partialFingerprints":{"codehealthFindingId/v1":"d82edad87a848b47cb3ee57542cf6269077674b7141bf8eb98b32eb61e3e7a6b"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::run_diff (cyclomatic 16): llmfit::run_diff 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":"llmfit-tui/src/main.rs"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68c103726761c78070efb906b40e579cdfe6b6bab840d9b5c5f4d981351fc6d"}},{"ruleId":"D1","level":"warning","message":{"text":"llmfit::serve_api::filtered_fits (cyclomatic 16): llmfit::serve_api::filtered_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":"llmfit-tui/src/serve_api.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a353cd7e78f17354642f915d365dfd9c1dde16350c83c20ca22b49e2fb9b6649"}},{"ruleId":"D1","level":"warning","message":{"text":"api.buildModelsQuery (cyclomatic 16): api.buildModelsQuery 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":"llmfit-web/src/api.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3f594d40bfc7e78620234360f027e3b12aacf1d67e381d4317a12b6d43e447"}},{"ruleId":"D1","level":"warning","message":{"text":"StoragePanel.StoragePanel (cyclomatic 16): StoragePanel.StoragePanel has cyclomatic complexity 16 (threshold 15). Of this number, 10 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":"llmfit-web/src/components/StoragePanel.jsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"652911bf15da8a47616883b8ed1744f24e29c803135c82ed7966948751db02fc"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_bench (cognitive 145): llmfit::tui_ui::draw_bench has cognitive complexity 145 (threshold 15). Drivers by points: if/else 51 (115 pts), loops 5 (19 pts), match/switch 3 (7 pts), boolean chains 4 (nesting depth added 82). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5531}}}],"partialFingerprints":{"codehealthFindingId/v1":"2310f9c2d497ceca10b999f461feabf86a3a43f969f88dbdbae6f4c554ddd140"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::main (cognitive 133): llmfit::main has cognitive complexity 133 (threshold 15). Drivers by points: if/else 51 (111 pts), boolean chains 9, match/switch 3 (8 pts), loops 1 (5 pts) (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":4240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7562ab814f839fe6aeda650236c5f75c098190c73f3a0fb97c8da9a510275a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelFit::analyze_inner (cognitive 132): ModelFit::analyze_inner has cognitive complexity 132 (threshold 15). Drivers by points: if/else 76 (111 pts), boolean chains 11, match/switch 6 (10 pts) (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":"llmfit-core/src/fit.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54ea38169a4a3779d42d9ebbacd945cb39c1f9c73b1e0d12283f79021207ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_events::handle_mouse_at (cognitive 96): llmfit::tui_events::handle_mouse_at has cognitive complexity 96 (threshold 15). Drivers by points: if/else 46 (79 pts), boolean chains 13, match/switch 2 (4 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc88a49520f01b2ed0f5b0cc49b62477a8ac047d2d703cd4b9a8dbef10b3bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::hardware::gpu_memory_bandwidth_gbps (cognitive 94): llmfit_core::hardware::gpu_memory_bandwidth_gbps has cognitive complexity 94 (threshold 15). Drivers by points: if/else 93, boolean chains 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":3357}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f93748252675476ae24438508cf1db5485f8e6eb191b5e7109f2ec68e8a4cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::models::parse_generation (cognitive 92): llmfit_core::models::parse_generation has cognitive complexity 92 (threshold 15). Drivers by points: if/else 47 (74 pts), boolean chains 18 (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":"llmfit-core/src/models.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c3bb6a28e7ec20be73f39f4f60d9f34f887c7a0d3a90994e01e77741b50349"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_detail (cognitive 81): llmfit::tui_ui::draw_detail has cognitive complexity 81 (threshold 15). Drivers by points: if/else 44 (66 pts), loops 5 (9 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5153833b76df0e439eea299c06e45abd4447a63b70f996974da539b704c0bc1b"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::run_download (cognitive 73): llmfit::run_download has cognitive complexity 73 (threshold 15). Drivers by points: if/else 30 (51 pts), loops 6 (17 pts), match/switch 2 (4 pts), boolean chains 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":"llmfit-tui/src/main.rs"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"68029a74ebc2e974293bbdc79aa52f8f934cde0bae5376c63b58d314bd386883"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_events::handle_view_mouse (cognitive 69): llmfit::tui_events::handle_view_mouse has cognitive complexity 69 (threshold 15). Drivers by points: if/else 31 (54 pts), boolean chains 10, match/switch 2 (5 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1995a28ce46c6dd877d99887f2729adc1bac7ff802cec41182a421dff0bc590"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::hardware::estimate_vram_from_name (cognitive 65): llmfit_core::hardware::estimate_vram_from_name has cognitive complexity 65 (threshold 15). Drivers by points: if/else 62, boolean chains 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc97e86ee4ee06cce3c3cc09c8d7ab6cd3163d3d16c3779e7cd3914359390c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::run_hardware (cognitive 65): llmfit::run_hardware has cognitive complexity 65 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 7 (15 pts), loops 5 (14 pts) (nesting depth added 37). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"4360781d6e84c7e56850c6688676bb9a6156aa91d0b2c50163ca0ee9a4f81e64"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_system_bar (cognitive 65): llmfit::tui_ui::draw_system_bar has cognitive complexity 65 (threshold 15). Drivers by points: if/else 53 (59 pts), match/switch 2 (6 pts) (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e64112b1be9412b989f7203ab6f4c75241ab5e2efc0406e134cd285655ee502"}},{"ruleId":"D2","level":"warning","message":{"text":"DetailPanel.DetailPanel (cognitive 63): DetailPanel.DetailPanel has cognitive complexity 63 (threshold 15). Drivers by points: ternaries 25 (36 pts), boolean chains 20, if/else 5 (6 pts), error handling 1 (nesting depth added 12). Of this number, 36 points are the body\u0027s own statements and 27 belong to 5 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":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4665908acccb66aec54e58246f6e4a8fe75d78cc4977e81d1c3a15729d1e3c3d"}},{"ruleId":"D2","level":"warning","message":{"text":"App::apply_filters (cognitive 57): App::apply_filters has cognitive complexity 57 (threshold 15). Drivers by points: if/else 31 (33 pts), boolean chains 20, match/switch 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53f871cb31a94601654a166de60cd26764457c71b4b3f9cec1bf9e7735c46ad"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::run_bench (cognitive 54): llmfit::run_bench has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (42 pts), match/switch 4 (7 pts), loops 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":"llmfit-tui/src/main.rs"},"region":{"startLine":3540}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e7b0a42730fdfa19cde903794a564a061eb9ddd019ce820d89748f8f0e1429"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_table (cognitive 54): llmfit::tui_ui::draw_table has cognitive complexity 54 (threshold 15). Drivers by points: if/else 37 (44 pts), match/switch 4 (6 pts), boolean chains 4 (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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c651359ab91bf3add340ee15984d7f889382918855171582b5f9ea705594294"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::cluster_cli::interactive_init (cognitive 47): llmfit::cluster_cli::interactive_init has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 5 (12 pts), loops 2 (6 pts), boolean chains 1 (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":"llmfit-tui/src/cluster_cli.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6e218bc2a17b98bb02b264bb9a1195ecee6742e3314192e6c4ac0104673c72"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_plan (cognitive 47): llmfit::tui_ui::draw_plan has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (38 pts), loops 3 (8 pts), boolean chains 1 (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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dac2763c3522414f3c763d446db96da9fb7ff2dc1d29ac1c30c693f9020d1b1"}},{"ruleId":"D2","level":"warning","message":{"text":"LmStudioProvider::start_pull (cognitive 44): LmStudioProvider::start_pull has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (36 pts), match/switch 3 (5 pts), loops 1 (2 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":"llmfit-core/src/providers.rs"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"feeaf41b84069d4b39e243e31882538d966c259fb2722d845cd68cf18bcc474f"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::models::infer_heads_from_name (cognitive 44): llmfit_core::models::infer_heads_from_name has cognitive complexity 44 (threshold 15). Drivers by points: if/else 36 (42 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/models.rs"},"region":{"startLine":2541}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7b97436de36c34ef7871d0279a610d69b51e7cf0889111dfd7c510f5cff845"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_events::key_hint_at (cognitive 43): llmfit::tui_events::key_hint_at has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 2 (9 pts), loops 3 (8 pts), boolean chains 2 (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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a54680ef415d3886a851e1bb51994de6ce1a3a61f95aadf69a44f60eca825f"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::run_quality_bench (cognitive 42): llmfit::run_quality_bench has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 5 (9 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":"llmfit-tui/src/main.rs"},"region":{"startLine":3897}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2b53022d0b642c772869c4c7af6a49e2481669e928a8852989fb75fff70dca"}},{"ruleId":"D2","level":"warning","message":{"text":"LlamaCppProvider::download_gguf_paths (cognitive 39): LlamaCppProvider::download_gguf_paths has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (26 pts), match/switch 3 (7 pts), loops 3 (4 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":"llmfit-core/src/providers.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"10998dfaf333afeb08f314fb2d6559c01bdee626435b65353b3c5b84cd207584"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_search_and_filters (cognitive 38): llmfit::tui_ui::draw_search_and_filters has cognitive complexity 38 (threshold 15). Drivers by points: if/else 24, boolean chains 7, match/switch 4 (6 pts), 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a51b8e8bbedc2f54f053d4aff3eb5b00d2e2640aafa8d532d6e1d49be44f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemSpecs::display (cognitive 35): SystemSpecs::display has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (12 pts), loops 2 (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":"llmfit-core/src/hardware.rs"},"region":{"startLine":2835}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19af000c8fe45a5fe9ba9dd6eee929adbdc39d0a6189559038bd1b1362dc017"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::fit::estimate_tps (cognitive 35): llmfit_core::fit::estimate_tps has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (31 pts), boolean chains 3, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/fit.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"48908d80cadb69a69ef832b2f9479ce69cbe6559a73450f59376572aa6e9593c"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::status_keys_and_mode (cognitive 35): llmfit::tui_ui::status_keys_and_mode has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1ce25b0f4d918fa7798f990d1ede685e38680addab0eb7626cb386fd7f0819"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_compare (cognitive 34): llmfit::tui_ui::draw_compare has cognitive complexity 34 (threshold 15). Drivers by points: if/else 33, boolean chains 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bd5a30d3061276c4235770384043de4ad1fda94ca28c914229fb2dfdf69c35"}},{"ruleId":"D2","level":"warning","message":{"text":"LlmModel::params_b_from_name (cognitive 33): LlmModel::params_b_from_name has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/models.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"323ba81f65f8879978a0dc6a4bfaf0ee6131ce6c07bfc51d157fcfc210c54dad"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::fit::quality_score (cognitive 33): llmfit_core::fit::quality_score has cognitive complexity 33 (threshold 15). Drivers by points: if/else 22 (26 pts), match/switch 3 (4 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":"llmfit-core/src/fit.rs"},"region":{"startLine":2528}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ac24cdd802ec85c6086fbbcb33d0ff07d891c003e9a915f83c146ec774bf13"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_events::handle_popup_mouse (cognitive 33): llmfit::tui_events::handle_popup_mouse has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 5 (7 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bca673a7af717889e978a818facd534c3100f786f30b2234421805e8187856"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_events::handle_normal_mode (cognitive 33): llmfit::tui_events::handle_normal_mode has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (27 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6fe02deceaa6de27af1b7df177f71533646315a4cc233b202ae78de408ebf8"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemSpecs::parse_nvidia_smi_extended (cognitive 31): SystemSpecs::parse_nvidia_smi_extended has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 3, 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63d7b490abd4a624e952948e54a12457aed63707475c97a12f5afd080a0e2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemSpecs::parse_rocm_product_names (cognitive 31): SystemSpecs::parse_rocm_product_names has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (5 pts), boolean chains 3, 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"46121d214ce9f2eb89f8f16a323ba00618b61b8c2eb95d9009f7c41c3dbb7478"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::doctor::vulkan_memory_heap_summary (cognitive 31): llmfit_core::doctor::vulkan_memory_heap_summary has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 8, 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":"llmfit-core/src/doctor.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd2d4a8e9aebd866b2a5b8872ab0e509ea32a64135a06870d4fdbd941d20d41"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemSpecs::detect_all_gpus (cognitive 30): SystemSpecs::detect_all_gpus has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 3 (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":"llmfit-core/src/hardware.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1da8dc6e0237e8df4bb09ce29a5877f726315aa8938508fd9403b2456dc150"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::storage::estimate_storage (cognitive 30): llmfit_core::storage::estimate_storage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 4, 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":"llmfit-core/src/storage.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8677beca851f298aef5f75315657680f144ffc511d04b3ffebb8100b89a362"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_filter_popup (cognitive 30): llmfit::tui_ui::draw_filter_popup has cognitive complexity 30 (threshold 15). Drivers by points: if/else 23, boolean chains 4, match/switch 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50854d3d755200565afac4aa7bf3302f4542683f43fa3a6022336f39ad69760"}},{"ruleId":"D2","level":"warning","message":{"text":"applyClientFilters (cognitive 30): applyClientFilters has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 11, ternaries 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 15 belong to 9 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/utils.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0e5a0ac63aaa7d3c73aaba22be16e3d0a8bbd89eea2b305ab62f6a6646e770"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemSpecs::detect_nvidia_gpu_sysfs_info (cognitive 29): SystemSpecs::detect_nvidia_gpu_sysfs_info has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29ae344f0ad08583309ce2f186cb6f0716bbfbe2713a064f5d5504ecf0131c3"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::models::merge_duplicate_entry (cognitive 29): llmfit_core::models::merge_duplicate_entry has cognitive complexity 29 (threshold 15). Drivers by points: if/else 22 (25 pts), loops 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/models.rs"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"465dbbcf71957a67184b4993ffc4aee94cf01c043ad6b1cac5453ca1ef9093ce"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::update::extract_model_params (cognitive 28): llmfit_core::update::extract_model_params has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3, 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":"llmfit-core/src/update.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d0259bc184185aabb20d5557fc7d0ae9430bcca26c4e622dd419d7af9fa667"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_multi_compare (cognitive 28): llmfit::tui_ui::draw_multi_compare has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20 (21 pts), boolean chains 3, loops 3, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"b857befd6d9e029fa374a813d479b1bd8e793aac7cc3f07d0afe71aeddf87efa"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_benchmarks (cognitive 28): llmfit::tui_ui::draw_benchmarks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23 (25 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4957}}}],"partialFingerprints":{"codehealthFindingId/v1":"40344078e6acc97589f44399dca887b60f39f5ab906ac77a83313bc8bda18c52"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemSpecs::scan_amd_sysfs_cards (cognitive 27): SystemSpecs::scan_amd_sysfs_cards has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (7 pts), loops 2 (4 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb48623b50b99e774a064e355ab1e9c56b3d9cd40f1623901c25d84eb682dba"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::run_diff (cognitive 27): llmfit::run_diff has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4, match/switch 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":"llmfit-tui/src/main.rs"},"region":{"startLine":2316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5514f2002fdf86f26f8d87be5eba3158b10cea1edd06511bbdf4ad97aa6caea2"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::run_recommend (cognitive 27): llmfit::run_recommend has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 7 (10 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":2554}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6f543ebdf13103508a002f3f8d6ac515daaea8e875e32bf87fda36def2a93b"}},{"ruleId":"D2","level":"warning","message":{"text":"HardwareProfile::validate (cognitive 25): HardwareProfile::validate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (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":"llmfit-core/src/hwprofile.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a461f4d7f2316abb999b34bcb2944afdb05f91fde828e5399747e7c4408f1f7"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_provider_popup (cognitive 25): llmfit::tui_ui::draw_provider_popup has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f271bbaecc691b69d7bb6a7c4fa5fc8a77f1ab9440765d1b619bab7f0e8fa5d"}},{"ruleId":"D2","level":"warning","message":{"text":"OllamaProvider::start_pull (cognitive 24): OllamaProvider::start_pull has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (17 pts), match/switch 2 (5 pts), loops 1 (2 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc39a740e36a01979ef7b961a01aa2a247035610ba594161c5df6fa122889a05"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::benchmarks::hw_query_params (cognitive 24): llmfit_core::benchmarks::hw_query_params has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (24 pts) (nesting depth added 15). 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":"llmfit-core/src/benchmarks.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a40107d5b05fa6ab78e69aae91a4a8019bbd3b3db0831d81d18a5ff18294c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"StoragePanel.StoragePanel (cognitive 24): StoragePanel.StoragePanel has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 3 (4 pts), boolean chains 3, error handling 1 (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 8 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":"llmfit-web/src/components/StoragePanel.jsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f19c4503f2e3c567df79fb0130991282daf5d67a1d13a76d8c896e6dd926267"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::serve_api::start_download (cognitive 23): llmfit::serve_api::start_download has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (8 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":"llmfit-tui/src/serve_api.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eaf95a72b882056198895751c3585a9b89720261ef95eb631c4d05c9fe80a6"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw (cognitive 23): llmfit::tui_ui::draw has cognitive complexity 23 (threshold 15). Drivers by points: if/else 23. 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7894d8a8ae03e12e30439738da648c8df1c25c2b9c24fef835656c7adea9fa5"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::bench_offer_lines (cognitive 23): llmfit::tui_ui::bench_offer_lines has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3912}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b8349991c3cd487015d542d4b36a30ae763939d401fd6270f99f27f513015b"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::fit::rank_models_by_fit_opts_col_dir (cognitive 22): llmfit_core::fit::rank_models_by_fit_opts_col_dir has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 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":"llmfit-core/src/fit.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"714ad6acfbf1d85c435b9fd05ed4484e081ead8a030eb2620f956d924fe62cda"}},{"ruleId":"D2","level":"warning","message":{"text":"App::with_specs_context_and_config (cognitive 22): App::with_specs_context_and_config has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 3, boolean chains 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c2de6a027d4cca7f8e8611963f3a97fa8c853bbd5ecc5f09930dcfa6729eff"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::run_update (cognitive 22): llmfit::run_update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b2cb6cbaee9c29464d6ab855ea97815fb25bbac9869224286b0f14e8225e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemPanel.SystemPanel (cognitive 22): SystemPanel.SystemPanel has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 14 (17 pts), boolean chains 3, if/else 2 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/SystemPanel.jsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f3e3653a7cafc83f1639a7007fa83577dc67d888f1bff596fb379b2f57a3ba"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::display_routing_matrix_full (cognitive 21): llmfit::display_routing_matrix_full has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 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":"llmfit-tui/src/main.rs"},"region":{"startLine":4106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae5e092bbc384c8efcbeb800bade98aafb9ad3a8ebc17838ab76722067f0c76"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::display::display_model_detail (cognitive 21): llmfit::display::display_model_detail has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (16 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/display.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"50039363249435a63f09b63ce5bd37c0de9346ce95b27b6f82a452312156c93e"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::display::display_model_plan (cognitive 21): llmfit::display::display_model_plan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 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":"llmfit-tui/src/display.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f339a8686e011322bb97d8197c1e8431510b494c018ef943edd06e420528a692"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemSpecs::is_same_gpu_name (cognitive 20): SystemSpecs::is_same_gpu_name has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 9 (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":"llmfit-core/src/hardware.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"536237ee48ba623c05fa92803ef728ad1b7a0f558e8c314e1b3f3c159cca8107"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_app::bench_offer_worker (cognitive 20): llmfit::tui_app::bench_offer_worker has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 6 (8 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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c72509f5ac74057b822235849425d3e22a36fc52928e5c92b112935bed9630"}},{"ruleId":"D2","level":"warning","message":{"text":"ConcurrencyCard.ConcurrencyCard (cognitive 20): ConcurrencyCard.ConcurrencyCard has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 5 (6 pts), boolean chains 1, error handling 1 (nesting depth added 6). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 48, handleSubmit, a function literal at line 152). 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":"llmfit-web/src/components/ConcurrencyCard.jsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bee8fb7bf9d494b142f2cd0fa2131050ffee2d9b58a513fa7a238bc78898049"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::plan::estimate_model_plan_with_config (cognitive 19): llmfit_core::plan::estimate_model_plan_with_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10, boolean chains 7, loops 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/plan.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"93df907f3f2f6c203ad90775b6a993df430d2f5eee07a6bbd5d0662317428372"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::providers::build_gguf_candidates (cognitive 19): llmfit_core::providers::build_gguf_candidates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (18 pts), 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":"llmfit-core/src/providers.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"830a63037220a885e259897782bb15792942ac9b4d55d3799fd282aab3971e29"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::update::update_model_cache (cognitive 19): llmfit_core::update::update_model_cache has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 2 (6 pts), loops 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":"llmfit-core/src/update.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d17b44e2e08c0b111d671e3a383435567e687c51dde72fc3854cf06a2eb512c"}},{"ruleId":"D2","level":"warning","message":{"text":"App::re_sort (cognitive 19): App::re_sort has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":4317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b3fb13a37c6a423e41c5ac3782a132c01b81918365e76e1111b1fb43599e06"}},{"ruleId":"D2","level":"warning","message":{"text":"App::tick_bench (cognitive 19): App::tick_bench has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":5283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1b76e0864e098be564b425da1faa563f59140e6cac78e5300489e6d3d9607c"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_ui::draw_bench_hw_picker (cognitive 19): llmfit::tui_ui::draw_bench_hw_picker has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (3 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67be3f3924c68fe917d246587e33a9e53dd5ee2c8b80189fbbe8acab05f6b02"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::providers::scan_hf_cache_for_mlx_in (cognitive 18): llmfit_core::providers::scan_hf_cache_for_mlx_in has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 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":"llmfit-core/src/providers.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c369cd95ad8470f8de193e249ccad776a5236e373e56f526bfc7c3e45391ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::providers::split_name_and_size (cognitive 18): llmfit_core::providers::split_name_and_size has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (13 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":"llmfit-core/src/providers.rs"},"region":{"startLine":4829}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec3f81f1da945b0b5d64a3f7bd0a80e0d08d0d18681db6eaf3e2726f59a3a02"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::share::share_all_pending (cognitive 18): llmfit_core::share::share_all_pending has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 5 (8 pts), match/switch 1 (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":"llmfit-core/src/share.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5835e1d7a325789b6441421fdc849c4bf2ff43581fdffb9603d6bd46f59ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"Capability::infer (cognitive 17): Capability::infer has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 12, if/else 5. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/models.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b933ff1cb1f56c854287c3f042018c1c5af3c47263aa4b65c4a1ebbbab979fe"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::models::apply_published_moe_active (cognitive 17): llmfit_core::models::apply_published_moe_active has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 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":"llmfit-core/src/models.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a00c9e7ef867fb47c4980bf93f5e477f8454faa98b9c1f3322066612de417fb"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::providers::scan_hf_cache_for_gguf (cognitive 17): llmfit_core::providers::scan_hf_cache_for_gguf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 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":"llmfit-core/src/providers.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86acb2cf2e5a2ff5df4340a1723518c3118500416e73c32cd99b58df6be7d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::quality::run_all_tests (cognitive 17): llmfit_core::quality::run_all_tests has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (3 pts), match/switch 1 (3 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":"llmfit-core/src/quality.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"5835fb4c1be4900f1cce1e9ae8d74339a709640dda9cfcfc7dbfee2e8ef9308c"}},{"ruleId":"D2","level":"warning","message":{"text":"App::merge_local_bench_rows (cognitive 17): App::merge_local_bench_rows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e51815dac2a18a0369ebb2a0033ebda09e5316fbeedabc201d0cffeec65ee70"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::ensure_dashboard_available (cognitive 17): llmfit::ensure_dashboard_available has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 3 (4 pts), 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":"llmfit-tui/src/main.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"0502c1cdbff2afb42a30b858e60d8c6901eca08f307dcc462b834ebd0b23555a"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::run_fit (cognitive 17): llmfit::run_fit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a50b47112f32d4c6508c95277e992d421f2cbc77ff9a9c9969d74693d7f972"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::run_model (cognitive 17): llmfit::run_model has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (6 pts), loops 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":3110}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ad1fb8ad68a7a2c6f1387b88346cbedcb6b0abc9d1539a14b5c6b59223d7c4"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::tui_events::handle_selection_popup_mouse (cognitive 17): llmfit::tui_events::handle_selection_popup_mouse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"807896450055c837b5c401b304c69d97ae121a83c4efcab02a652d9659676a71"}},{"ruleId":"D2","level":"warning","message":{"text":"api.buildModelsQuery (cognitive 17): api.buildModelsQuery has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 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":"llmfit-web/src/api.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ba425f2cf4d8ab68a5baeb74abd549bb37c5dbd9c84250a748297cea118c27"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelTable.ModelTable (cognitive 17): ModelTable.ModelTable has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 4 (nesting depth added 4). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 76). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/ModelTable.jsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"499bbd8cecf54bdbd87d7b76bf7fcd11c7bf15220dbce01c465a915757141f53"}},{"ruleId":"D2","level":"warning","message":{"text":"SystemSpecs::narrowed_pcie_warnings (cognitive 16): SystemSpecs::narrowed_pcie_warnings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 1 (4 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f595eaa07476163d17cb533fdbb8ea6a812389a26848f43c2bf0218575f798"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::bench::discover_all_targets_at (cognitive 16): llmfit_core::bench::discover_all_targets_at has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), boolean chains 4, if/else 4 (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":"llmfit-core/src/bench.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3993cf6240acb77940c0914aad936ffdf2e97c989ab04312a4eb93a88d746c"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::providers::collect_gguf_files (cognitive 16): llmfit_core::providers::collect_gguf_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"a577493724b38a4714a8b724a3bb64b2410b42490039f8fa4cd9a932450fff6a"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit_core::update::map_to_llm_model (cognitive 16): llmfit_core::update::map_to_llm_model has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (16 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/update.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"78165df853c7a2e5b8d57618a5b44d252cece8b6797f0ada709e084ca477a2d5"}},{"ruleId":"D2","level":"warning","message":{"text":"App::plan_input (cognitive 16): App::plan_input has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":3046}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bff8bfff7721c2f146dae7f3a69943b63447bdc78d238d2aea4995a4b68cd84"}},{"ruleId":"D2","level":"warning","message":{"text":"App::available_download_providers (cognitive 16): App::available_download_providers has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, if/else 6. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":4673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b941e0d960039a6d1fa6e57b210c6fe13256747e8865357fab2153dd3a7df5e"}},{"ruleId":"D2","level":"warning","message":{"text":"App::load_bench_cache (cognitive 16): App::load_bench_cache has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":5046}}}],"partialFingerprints":{"codehealthFindingId/v1":"62af13b565bfb66ed1cda0ec0790cacda2003926bc9d5341c10694b13a50fe43"}},{"ruleId":"D2","level":"warning","message":{"text":"llmfit::cluster_cli::run (cognitive 16): llmfit::cluster_cli::run has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 3 (6 pts), loops 1 (3 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/cluster_cli.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4b05b7f387e2a3136d066e604b770be1e39f359dfa1b01ad517413818ba7d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tui_ui.rs: FileTooLong \u2014 4462 significant 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 73 free functions. The bar is 500 significant lines; this is 3962 over it, 8.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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71a39fd43ec627339ebfae0c80bfee5edeec2873feec361f2d193752d6ba03d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 242 methods. The bar is 30 methods; this is 212 over it, 8.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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"5246e0af6890a0e63c2f3c9ef492f9d64c6d7145f5f6c1e435a99e5f07ec57bf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 3120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 242 methods, 2 blocks, lines 868-5349. The bar is 400 significant lines; this is 2720 over it, 7.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"057e6c3f3f0bcf8780d68c84cfda113d188a4f526ffa697da1ff0fbeaecab803"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tui_app.rs: FileTooLong \u2014 3710 significant 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: App (2 blocks, 868-5349). The bar is 500 significant lines; this is 3210 over it, 7.42\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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d7ef1d7171cb68b01b48a377f7eecf9ea80a71e0ca17e4bef2663db974495a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 3195 significant 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 64 free functions. The bar is 500 significant lines; this is 2695 over it, 6.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e6f20f5ac90b1363b767c6a6802a5744e86784abb18f6fd315a348be7194ad"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 181 stored fields beside 242 methods. The bar is 30 stored fields; this is 151 over it, 6.03\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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"20aedd5718a01ced354c2345c37e63c305b68af120ed62ea294a42cc74d33893"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/providers.rs: FileTooLong \u2014 2682 significant 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 123 free functions. The bar is 500 significant lines; this is 2182 over it, 5.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":"llmfit-core/src/providers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db2ef72189e206a30ed9607d8ea88ecf12bb4bcc2b745f62cf64f3ace3f5fee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DetailPanel.DetailPanel: FunctionTooLong \u2014 DetailPanel runs 529 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 429 over it, 5.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":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd28bec82849e096ff02b548baf8ccd71d212bbd4c87edaf84e29685d7ca114c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_bench: FunctionTooLong \u2014 llmfit::tui_ui::draw_bench runs 471 significant 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 371 over it, 4.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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f1d4b3cb449b978cc90779b413cbd18400bcbe11f2e61ccfba4bd7186fa67f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hardware.rs: FileTooLong \u2014 2313 significant 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: SystemSpecs (2 blocks, 106-2958). The bar is 500 significant lines; this is 1813 over it, 4.63\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"763412845ffcf861d71e31784b7cffe00aeb5a0a93b267b25955edd2a95400b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModelFit.analyze_inner: MethodTooLong \u2014 analyze_inner runs 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) in one body. The bar is 100 significant lines; this is 351 over it, 4.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":"llmfit-core/src/fit.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eade1df198c56191c55e48c66e0336a2d25441ff8603c0cbeed92aa16a3cab4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.with_specs_context_and_config: MethodTooLong \u2014 with_specs_context_and_config runs 444 significant 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 344 over it, 4.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5d6ebf84ce3f0202944f7f83195c3c553030c361487c76396ef49811721c24"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SystemSpecs: ClassTooLong \u2014 1631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 83 methods, 2 blocks, lines 106-2958. The bar is 400 significant lines; this is 1231 over it, 4.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":"llmfit-core/src/hardware.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"972572c6af9d00dac01ccb0793492e6e5aec0f98b25ffc36e0f7e75e47b459be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::main: FunctionTooLong \u2014 llmfit::main runs 393 significant 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 293 over it, 3.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":4240}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d2bdd1bcb0de339e98caae492bf0495614790ad4610d5dd8c6ce768279445c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_detail: FunctionTooLong \u2014 llmfit::tui_ui::draw_detail runs 337 significant 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 237 over it, 3.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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7ccae123abae4ec14520664df8da5b5b632bdef4e514e76204796ece142e3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FilterBar.FilterBar: FunctionTooLong \u2014 FilterBar runs 301 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 201 over it, 3.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":"llmfit-web/src/components/FilterBar.jsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b641b9bcfa7b2345e433a3098f422c8bd957682691ec17b8b858f04ca3b26ef3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/models.rs: FileTooLong \u2014 1499 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 999 over it, 3.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":"llmfit-core/src/models.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae71e1b48e2f47f4f2890c7568561ccb32e6e5510cd130b4fbe698f4f478bc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fit.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 38 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":"llmfit-core/src/fit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9d38e5e64ff06c3dd9c02a339b1bed150067173f00409cdcbacce1100400e1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SystemSpecs: TooManyMethods \u2014 83 methods. The bar is 30 methods; this is 53 over it, 2.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":"llmfit-core/src/hardware.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b1242db10289d19cfb9fb8499b542e4e3848f3c6627f5bd20fb46a0113c861"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_multi_compare: FunctionTooLong \u2014 llmfit::tui_ui::draw_multi_compare runs 249 significant 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 149 over it, 2.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2abc87e40ee9b2cd51b4d59fddb1129cf22d7986b80a0095a4f8f504d70c711"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_table: FunctionTooLong \u2014 llmfit::tui_ui::draw_table runs 226 significant 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 126 over it, 2.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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"1251eb048571b0a58fc193b11bea395aa855b574e270ec7d1fa5d4f23dbe416f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tui_events.rs: FileTooLong \u2014 1125 significant 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 36 free functions. The bar is 500 significant lines; this is 625 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2715f2c5b126f9fd560da41d3603a0531afec14e4c9e6a7b7edf8639fd3a7205"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: StoragePanel.StoragePanel: FunctionTooLong \u2014 StoragePanel runs 213 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/StoragePanel.jsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3786d5983ed0a276360ca8f3b2cb87dca82e4161444ff2be1bf13b4a93771a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/serve_api.rs: FileTooLong \u2014 1010 significant 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 510 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/serve_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3d106a428a51f8945b2be05300212d461a2d159cfd94900f19afd8e147b306"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_plan: FunctionTooLong \u2014 llmfit::tui_ui::draw_plan runs 199 significant 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 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c8e23a26329036136cfd495428f9dae11a714c3023cf93c279a74f166acb70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_events::handle_mouse_at: FunctionTooLong \u2014 llmfit::tui_events::handle_mouse_at runs 197 significant 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 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16b0a9c49cc7044c084874d501e51564d81726c8d5be4f36764690d81b95d19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit_core::hardware::gpu_memory_bandwidth_gbps: FunctionTooLong \u2014 llmfit_core::hardware::gpu_memory_bandwidth_gbps runs 194 significant 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 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/hardware.rs"},"region":{"startLine":3357}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1d2dadf4ad64876dd00bbb19507f62e94027ab12380f0c0bbcf57a763ea627"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_search_and_filters: FunctionTooLong \u2014 llmfit::tui_ui::draw_search_and_filters runs 194 significant 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 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"611bb9e198888cc188fb51b16eff8b491c8075c8db0cd70ed9b9352e6a498b48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::run_hardware: FunctionTooLong \u2014 llmfit::run_hardware 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":"llmfit-tui/src/main.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"044d8659d04623c445b143ee8fbc3b0d3da7ca71196647584851e39a31ea70cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.apply_filters: MethodTooLong \u2014 apply_filters 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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cff2b638600be8b9ed294cf73b45abbfd5779a1586f4add5f2cf7d89af76be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::run_download: FunctionTooLong \u2014 llmfit::run_download runs 184 significant 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 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":2742}}}],"partialFingerprints":{"codehealthFindingId/v1":"069d621104d9aef147f6fa4283a765fff7972db7449cf039cf2e089a70c5a873"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_system_bar: FunctionTooLong \u2014 llmfit::tui_ui::draw_system_bar 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61a6cbff336d062d5f79a6b15230715096bca606f0666ee39731d1214ef31f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/display.rs: FileTooLong \u2014 860 significant 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 360 over it, 1.72\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4198127f84d701507765a1ce13171cea222b106c32a3e4ea29de7a70667020d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_benchmarks: FunctionTooLong \u2014 llmfit::tui_ui::draw_benchmarks 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4957}}}],"partialFingerprints":{"codehealthFindingId/v1":"843e184d3d0b522976cdfeac94d430e2c679ee9c7f396dc3c6953ed4fd7bc811"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SystemPanel.SystemPanel: FunctionTooLong \u2014 SystemPanel runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/SystemPanel.jsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac32686b76cec92ee7d4881002dd8861f06c513324d04e5b20a8b5c54abb7a8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_compare: FunctionTooLong \u2014 llmfit::tui_ui::draw_compare 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcd0d2f1728ea153fff31b63ba3fd4d413bf996227571f3d76e562fbeb8f7a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit_core::plan::estimate_model_plan_with_config: FunctionTooLong \u2014 llmfit_core::plan::estimate_model_plan_with_config runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/plan.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba0a0491df787e0d9368fca25a36c76feab17466386956b6af4cdb3f7b8d797"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/share.rs: FileTooLong \u2014 736 significant 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 236 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":"llmfit-core/src/share.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1460c75026da0fae4a60fc409ecf08f9e44127b1e952af47bd83bc4c12e54ec3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_filter_popup: FunctionTooLong \u2014 llmfit::tui_ui::draw_filter_popup 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a45ab17fdf5098aea6a0f57d678c6197c9b6f00a365038fe59dd10f35c298f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/benchmarks.rs: FileTooLong \u2014 715 significant 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 215 over it, 1.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":"llmfit-core/src/benchmarks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01a613d04d2efabd3ba2a0cb99a806c8fe37154aca8119e88e8167103bf8a78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_events::handle_popup_mouse: FunctionTooLong \u2014 llmfit::tui_events::handle_popup_mouse 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1b0b21f345c6bb11d0da8c500d9b8734edf9090e89fa4a2a25b6251d2dfccc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ModelTable.ModelTable: FunctionTooLong \u2014 ModelTable runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"llmfit-web/src/components/ModelTable.jsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3245cfc2ebc8cc96ccf29913e9d98624a04467224e78628586298f40a829f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bench.rs: FileTooLong \u2014 701 significant 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 201 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/bench.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4930f3d107ca6dba219425d9a7ef80df2936bca394bf8721bb81598f2fc7cd23"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LlamaCppProvider.download_gguf_paths: MethodTooLong \u2014 download_gguf_paths 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":"llmfit-core/src/providers.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d2331d666acfe35f15d7d9d5cc6314e1a628ec15c3dacd137774edfcf89cc5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModelFit: ClassTooLong \u2014 541 significant 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 464-1357. The bar is 400 significant lines; this is 141 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/fit.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6ab318ed5847a5e04fabdd197399bf168dec9ce525028ebae7d0f27f93bbc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::status_keys_and_mode: FunctionTooLong \u2014 llmfit::tui_ui::status_keys_and_mode 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0337303c04acbf469fc4cd822c807ae41ac502eba1821b4f9088a1dad492f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit_core::fit::estimate_tps: FunctionTooLong \u2014 llmfit_core::fit::estimate_tps 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":"llmfit-core/src/fit.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ab9f921f862f623442ba09fb73064c28a24e7b98b4ccda3b21c8af52047037"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit_core::update::map_to_llm_model: FunctionTooLong \u2014 llmfit_core::update::map_to_llm_model 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":"llmfit-core/src/update.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b264b1ebdfe73a10122f0a44bfa62f26e86fcf776285aadb4f76d8efc99d271"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::run_recommend: FunctionTooLong \u2014 llmfit::run_recommend 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":"llmfit-tui/src/main.rs"},"region":{"startLine":2554}}}],"partialFingerprints":{"codehealthFindingId/v1":"679edfb0925dad5b5126ad239cf955f46e165dd4101b3bd5c55641be3bbd2394"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DetailPanel: ClassTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 129 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":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3438598b9c2490f2a95b549ec6ecbb764dbfc3ac3ed69114702306a69971be4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::cluster_cli::interactive_init: FunctionTooLong \u2014 llmfit::cluster_cli::interactive_init runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/cluster_cli.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4059de46f7870d447b673d5cbf8d76cff4d6a7d558bbaab532949df9178bdfd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/update.rs: FileTooLong \u2014 643 significant 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 143 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":"llmfit-core/src/update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e93fa291fb73dc4d89f8ff44c643b2c3270ee8a920e7092180db290ed5fc608"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit_core::hardware::estimate_vram_from_name: FunctionTooLong \u2014 llmfit_core::hardware::estimate_vram_from_name 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":"llmfit-core/src/hardware.rs"},"region":{"startLine":3918}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5000077226bd64af65dbae6331668ea7e4a3a38dbdde6fe8c97d15f56c31fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::run_quality_bench: FunctionTooLong \u2014 llmfit::run_quality_bench 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":"llmfit-tui/src/main.rs"},"region":{"startLine":3897}}}],"partialFingerprints":{"codehealthFindingId/v1":"d21afea7a3b0b99df4631930128e5b80c392548eceeafd42dd1d0c6e81c846a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ConcurrencyCard.ConcurrencyCard: FunctionTooLong \u2014 ConcurrencyCard runs 127 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/ConcurrencyCard.jsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"155176d1300f17983440d9566afa09e7006cab85026bac8948443fe54609efdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plan.rs: FileTooLong \u2014 626 significant 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 126 over it, 1.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":"llmfit-core/src/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a8994f36af3fe184f88473702a62296a0d6863097e1f7fb9dd5e3d14f45a0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_events::handle_view_mouse: FunctionTooLong \u2014 llmfit::tui_events::handle_view_mouse 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d152b3e15f1ddd9fccb9aea1c4f9708235cb32992d89722f3e2c42f09b2821"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_app::bench_offer_worker: FunctionTooLong \u2014 llmfit::tui_app::bench_offer_worker 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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb2530681e2e6bc40819922290d12a4d3deb877a04093e7ab95e16205771c78"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Commands: ClassTooLong \u2014 491 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 91 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5330c4b4a308a4aeff2f81c6f9ae2719a208eaca3e93001f951f6982d61a6a02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/DetailPanel.jsx: FileTooLong \u2014 595 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: DetailPanel (81-687). The bar is 500 significant lines; this is 95 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":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb1db0ce1759b79503379db5ad429342fd0645462dbc85e3cacda4094f2f055"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_events::handle_normal_mode: FunctionTooLong \u2014 llmfit::tui_events::handle_normal_mode 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"655b04d7a6ccc2aeee37c496f46e143928597b6aa75a14cf9ffc26be91ba4e33"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.start_bench: MethodTooLong \u2014 start_bench 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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":5133}}}],"partialFingerprints":{"codehealthFindingId/v1":"44faced35fcd11a66c0c4b93fefaf3156d9235eae092a1a53bc2fd41f8b611c9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LlmModel: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/models.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e241c496c0542861905eea3c12785cee478ff7d2183ebf255afd410928ce29d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::tui_ui::draw_provider_popup: FunctionTooLong \u2014 llmfit::tui_ui::draw_provider_popup 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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d701b953dc7f3af297520dee2eff596a186d33a67c1293da2b6229b1b34ed89e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit_core::plan::build_path_estimate: FunctionTooLong \u2014 llmfit_core::plan::build_path_estimate 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":"llmfit-core/src/plan.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27fe7f1b891bffb68329dd00b4f26eb8b6f758ab96896f625e1899ce1b4354c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit_core::doctor::collect_diagnostics: FunctionTooLong \u2014 llmfit_core::doctor::collect_diagnostics 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":"llmfit-core/src/doctor.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4a077de893fac6f422d89b70fbc981a2c121050123a531c02b763417277427"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LmStudioProvider.start_pull: MethodTooLong \u2014 start_pull 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":"llmfit-core/src/providers.rs"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4d6a7ae3fa6c26455a66e13efe84f06128dd780b1fa2abef25b832bde63cec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit::display::display_model_detail: FunctionTooLong \u2014 llmfit::display::display_model_detail 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":"llmfit-tui/src/display.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d299a0a96d9d74e4a85dd761d3ba6f9587f6793ef547c84fb0f1f3f8bb5fc9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HfModelEntry: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\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":"llmfit-core/src/models.rs"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b8c92f5f29bcd7acad67597e87fec7458e6643c6c3610b0cb8aa28d79f0342"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cluster.rs: FileTooLong \u2014 531 significant 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 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/cluster.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bff1cb240a05dbc99e6b2c2bb90830e0ca52274d85278b8bcd19c20ebc1a933"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llmfit_core::providers::hf_name_to_mlx_candidates: FunctionTooLong \u2014 llmfit_core::providers::hf_name_to_mlx_candidates 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":"llmfit-core/src/providers.rs"},"region":{"startLine":4401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f9460797a2cb2248b76294379900f1345b1a4e1d8ff56b80bb6e10cab54ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): llmfit-tui/src/theme.rs:186-221 | llmfit-tui/src/theme.rs:223-258 | llmfit-tui/src/theme.rs:260-295 | llmfit-tui/src/theme.rs:297-332 | llmfit-tui/src/theme.rs:334-369 | llmfit-tui/src/theme.rs:371-407 | llmfit-tui/src/theme.rs:409-445 | llmfit-tui/src/theme.rs:447-483 | llmfit-tui/src/theme.rs:485-521 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/theme.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90ff6aa37abef86c8ac4835b58d0a25c5604f52aeedfcc75958bee2814a4c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): llmfit-tui/src/tui_ui.rs:2978-3135 | llmfit-tui/src/tui_ui.rs:3137-3219 | llmfit-tui/src/tui_ui.rs:3221-3303 | llmfit-tui/src/tui_ui.rs:3683-3753 | llmfit-tui/src/tui_ui.rs:3755-3829 | llmfit-tui/src/tui_ui.rs:3831-3910 | llmfit-tui/src/tui_ui.rs:4194-4267 | llmfit-tui/src/tui_ui.rs:4269-4343 \u2014 These 8 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 8 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 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2978}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dd3f9ec3238bb9768f65c7f519a85b653960824db4700293dba9e751e0ea3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): llmfit-tui/src/tui_ui.rs:3305-3363 | llmfit-tui/src/tui_ui.rs:4052-4076 | llmfit-tui/src/tui_ui.rs:4350-4470 | llmfit-tui/src/tui_ui.rs:4472-4594 | llmfit-tui/src/tui_ui.rs:5188-5265 | llmfit-tui/src/tui_ui.rs:5267-5484 \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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"305989a5146d1cf355da1644ed67e3c22c1debea2c6ad92c7d3a1f0557719a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): llmfit-core/src/providers.rs:60-76 | llmfit-core/src/providers.rs:2323-2338 | llmfit-core/src/providers.rs:2702-2717 | llmfit-core/src/providers.rs:3425-3440 | llmfit-core/src/providers.rs:3648-3663 \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":"llmfit-core/src/providers.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae3e3e5c0617f535a4869a1961711146e32991614d25beb9e3a9f737f3df835"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): llmfit-core/src/providers.rs:2378-2439 | llmfit-core/src/providers.rs:2452-2480 | llmfit-core/src/providers.rs:3480-3531 | llmfit-core/src/providers.rs:3544-3565 | llmfit-core/src/providers.rs:3708-3749 \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":"llmfit-core/src/providers.rs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d75317fbf0a0475980a98f78f29b1cdc6e7ccb4efe029543285f74b35840c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): llmfit-core/src/benchmarks.rs:774-786 | llmfit-core/src/benchmarks.rs:794-807 | llmfit-core/src/benchmarks.rs:814-826 | llmfit-core/src/benchmarks.rs:1021-1040 \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":"llmfit-core/src/benchmarks.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdcff27b047bf3010823004b65bc23cf67351663d3f13331d14cef1609c23a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): llmfit-tui/src/mcp_server.rs:292-340 | llmfit-tui/src/serve_api.rs:804-861 \u2014 These two members are one piece of code written twice and then edited apart: 49 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":"llmfit-tui/src/mcp_server.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69876f3e9d20102a5648018e9cf4c5c99c7952262490d2c6c1dd68b70b4c5b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): llmfit-core/src/bench.rs:347-403 | llmfit-core/src/quality.rs:258-312 \u2014 These two members are one piece of code written twice and then edited apart: 55 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":"llmfit-core/src/bench.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e364c717fe13996ff4df4f33d0bfbbf57388e2196e8948e96580916adcbc92cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): llmfit-core/src/providers.rs:1052-1102 | llmfit-core/src/providers.rs:2487-2526 \u2014 These two members are one piece of code written twice and then edited apart: 40 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":"llmfit-core/src/providers.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd8b936fbc486c884c1d434add037cc2d046aa4191d5776a9c6ef949b902c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): llmfit-core/src/quality.rs:479-510 | llmfit-core/src/quality.rs:513-558 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"llmfit-core/src/quality.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"1984ab9215823586bc4ae0123bdec9093efd699b89902fd2c3d7c02a5d037cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): llmfit-core/src/providers.rs:861-892 | llmfit-core/src/providers.rs:915-948 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"llmfit-core/src/providers.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dd3bce59b1030dd81540c8d646234fea653312ca8f5003502a73e3666ecba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): llmfit-tui/src/serve_api.rs:562-585 | llmfit-tui/src/serve_api.rs:590-613 | llmfit-tui/src/serve_api.rs:619-645 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/serve_api.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"9641c9e80459f8fabf2c38ea5e0afd777038a6bea03fdc17653782f37e4c71c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): llmfit-tui/src/tui_events.rs:1394-1427 | llmfit-tui/src/tui_events.rs:1429-1459 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff17a251f52998317c7330521c80fa4ea7c6c9b4978c34e5f84010b4517fef87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): llmfit-core/src/bench.rs:159-186 | llmfit-core/src/bench.rs:312-339 \u2014 These two members are one piece of code written twice and then edited apart: 28 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":"llmfit-core/src/bench.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec81bf9b076988c7ed4ad68c5acdf770f3a405777600ba7b2e08b6181b18804"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): llmfit-core/src/bench.rs:867-887 | llmfit-core/src/bench.rs:994-1023 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/bench.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"45231957a4c70cc24e075c8b4e589f25e5de2c49e9f485948f254163c8804455"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): llmfit-tui/src/tui_app.rs:4487-4504 | llmfit-tui/src/tui_app.rs:4535-4552 | llmfit-tui/src/tui_app.rs:4554-4571 | llmfit-tui/src/tui_app.rs:4573-4590 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":4487}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee853421c2a59e570bd08ae4291eb4c907e8e2da6699d1ff030a6e5a8194fc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): llmfit-core/src/hardware.rs:1498-1522 | llmfit-core/src/hardware.rs:1629-1649 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/hardware.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5718de268871d37ab4ef988951c0b607f0af5593c239dacdcdb9e48117fa27f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): llmfit-core/src/cluster.rs:393-403 | llmfit-core/src/update.rs:99-112 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/cluster.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dadd67a0f868fed643b61a1d6593e0ada3e8ab2d7b103cf830a420dfecbda0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): llmfit-tui/src/tui_events.rs:1264-1277 | llmfit-tui/src/tui_events.rs:1279-1292 | llmfit-tui/src/tui_events.rs:1349-1362 | llmfit-tui/src/tui_events.rs:1364-1377 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb10a35351e31c132a00ac26cfc786d142eaf1138050a59a685a7fb185fc7e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): llmfit-core/src/benchmarks.rs:315-327 | llmfit-core/src/share.rs:129-141 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/benchmarks.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a247f63a681b4825e285457901fef7fe2cce66655097f973069d978e71a9595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): llmfit-core/src/providers.rs:790-808 | llmfit-core/src/providers.rs:1033-1050 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85432f6524c0f40bd28f4345b9ea243ed5e167c41ce762a43e73486ba6b5137"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): llmfit-core/src/providers.rs:595-609 | llmfit-core/src/providers.rs:686-700 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"llmfit-core/src/providers.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8288cd1075c698eac2bdcb94f242182811cc50bab06e7abe95e79ae848113d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): llmfit-tui/src/cluster_cli.rs:267-281 | llmfit-tui/src/cluster_cli.rs:287-303 \u2014 These two members are one piece of code written twice and then edited apart: 15 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":"llmfit-tui/src/cluster_cli.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fd978b3dfd90fbc20a6161a873fc98fd68346ff322d500c283464d567ffefe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): llmfit-core/src/providers.rs:814-824 | llmfit-core/src/providers.rs:2149-2158 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"27851e5aa713b095d09c2629ffed67ac8695198d2775a51cde51a7e35b85b5de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): llmfit-core/src/hardware.rs:530-543 | llmfit-core/src/hardware.rs:2065-2078 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/hardware.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65a2b7a036e50785bf746d51f8a068c40c37bd3efe76a9ca2f8ff77dd9bbf27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): llmfit-core/src/share.rs:716-725 | llmfit-tui/src/cluster_cli.rs:252-261 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/share.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"170f4f1eb9588b9721790d7a4be76d78023320c99516bfdebc4ba102e5290cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): llmfit-core/src/share.rs:1093-1104 | llmfit-core/src/share.rs:1149-1156 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/share.rs"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b9a6b8bbd6722fc22213f0e01fe74b0b5aaed84e28d25b8d3e70256e88711f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): llmfit-core/src/models.rs:2091-2104 | llmfit-core/src/models.rs:2106-2117 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/models.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad16cb76ed20b83ccb441d3deef8e6fe81f320d978b11bb3d6ba4455f3741a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): llmfit-tui/src/main.rs:3530-3537 | llmfit-tui/src/tui_ui.rs:2002-2009 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":3530}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f24d04195c99ba56f006730466c1a81d77a5734b8dfd4bbbc7190c03549dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): llmfit-tui/src/tui_app.rs:2301-2308 | llmfit-tui/src/tui_app.rs:2310-2316 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"407f8d2f5c2fe1e045863c9943f8870998e75227f435283b6674a1e454424f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 9): llmfit-tui/src/theme.rs:188-221 | llmfit-tui/src/theme.rs:225-258 | llmfit-tui/src/theme.rs:262-295 | llmfit-tui/src/theme.rs:299-332 | llmfit-tui/src/theme.rs:336-369 | llmfit-tui/src/theme.rs:374-407 | llmfit-tui/src/theme.rs:412-445 | llmfit-tui/src/theme.rs:450-483 | llmfit-tui/src/theme.rs:488-521 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/theme.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fad227d7c04bed0e8379266d2b67e5b0422ce4a6e9257d6d736f51cf96fb47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): llmfit-tui/src/mcp_server.rs:293-321 | llmfit-tui/src/serve_api.rs:805-834 \u2014 before extracting anything, compare \u0060llmfit-tui/src/mcp_server.rs\u0060 and \u0060llmfit-tui/src/serve_api.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"llmfit-tui/src/mcp_server.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"922d2238ffdb66a1557bad39d0f8002ad49501f0cbb3fc1384b967509a4641f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): llmfit-core/src/fit.rs:1475-1497 | llmfit-core/src/fit.rs:1502-1524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/fit.rs:1475\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":"llmfit-core/src/fit.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"5441eb30b27e24da5598dd1f27985d6a412f5991099965de6e2ffd7eedc0787d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): llmfit-core/src/providers.rs:3250-3269 | llmfit-core/src/providers.rs:3587-3606 | llmfit-core/src/providers.rs:3919-3938 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":3250}}}],"partialFingerprints":{"codehealthFindingId/v1":"6125b64387698d660b0de133e10344a13b5440fbf10ed7f673439fffdc5741a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): llmfit-core/src/plan.rs:502-521 | llmfit-core/src/plan.rs:544-561 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/plan.rs:502\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":"llmfit-core/src/plan.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e148bc0208cb2e76da7e9aeb45098ae85d74a93b8514fed4a0a24f1b809b3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:4394-4412 | llmfit-tui/src/tui_ui.rs:4546-4563 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:4394\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7082e01533f01642f78168a4b49ed7b357dc7431a6b4bffae99f9e35d3551b62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:5559-5577 | llmfit-tui/src/tui_ui.rs:6037-6055 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5559}}}],"partialFingerprints":{"codehealthFindingId/v1":"4747b291b72f1ca3f064c5fdb4060803475442d1c271acf6d922994303e78451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): llmfit-core/src/providers.rs:2808-2823 | llmfit-core/src/providers.rs:3515-3531 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/providers.rs:2808\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":2808}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a90936156926d9cbe575e763f91846a1f42c5d1f1acf0d2c4d89e2b613db7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 5): llmfit-core/src/providers.rs:61-76 | llmfit-core/src/providers.rs:2324-2338 | llmfit-core/src/providers.rs:2703-2717 | llmfit-core/src/providers.rs:3426-3440 | llmfit-core/src/providers.rs:3649-3663 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"537066179de3c69609c5527b93851a33a73c7000d27063601407293a74d0a3cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): llmfit-tui/src/tui_ui.rs:631-646 | llmfit-tui/src/tui_ui.rs:660-675 | llmfit-tui/src/tui_ui.rs:689-704 \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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3eb15eef5d0ffc76587cd9ea04c0c3fb9767507e07db7e2d775d5b3e821310d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): llmfit-core/src/bench.rs:352-367 | llmfit-core/src/quality.rs:264-276 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060llmfit-core/src/bench.rs:352\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":"llmfit-core/src/bench.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9aea02863100069f7bb8653f16d38496d2fbd987ed0570efa9a7b28cb1f8a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): llmfit-core/src/providers.rs:2453-2468 | llmfit-core/src/providers.rs:3545-3560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ff81c7051e0ada74f2a4fd18943b21039d81c04372fa3a97dbd0f6a22830e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): llmfit-core/src/providers.rs:865-879 | llmfit-core/src/providers.rs:920-934 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/providers.rs:865\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad100b486515deb4789a5e892e49c2e52194cfe0ce925400c991b39d386e43ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): llmfit-core/src/providers.rs:2386-2400 | llmfit-core/src/providers.rs:3481-3495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060llmfit-core/src/providers.rs:2382\u0060 calls \u0060is_docker_desktop_running\u0060 and \u0060llmfit-core/src/providers.rs:3480\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f020fec3a9bdc0670f30d285fe1c7695bdecc775fa54c34906f7bb15ed8781a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): llmfit-tui/src/tui_ui.rs:3206-3219 | llmfit-tui/src/tui_ui.rs:3290-3303 | llmfit-tui/src/tui_ui.rs:3740-3753 | llmfit-tui/src/tui_ui.rs:3816-3829 | llmfit-tui/src/tui_ui.rs:3897-3910 | llmfit-tui/src/tui_ui.rs:4330-4343 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:3206\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3206}}}],"partialFingerprints":{"codehealthFindingId/v1":"570c9e8048665af0ffaff3aa64d66c174ccec099af22d5957b7bf3867b7e5696"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): llmfit-core/src/hardware.rs:1274-1287 | llmfit-core/src/hardware.rs:1309-1319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/hardware.rs:1274\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15b2dc7a0aaa8e74b377c391537fa530c03ebca4be027aa7bb69581c0c6d172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): llmfit-core/src/hardware.rs:687-699 | llmfit-core/src/hardware.rs:1013-1025 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/hardware.rs:687\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32b3953958e780ddaaf54b6ca85dc4185059b65689fccda5dbe4d20facbadcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): llmfit-core/src/providers.rs:1387-1397 | llmfit-core/src/providers.rs:1417-1429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/providers.rs:1417\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"3168a62d4c58233ccc199426d44188cdb6f6bc79ca9d80c25e94f57aa1d0add5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): llmfit-core/src/quality.rs:480-494 | llmfit-core/src/quality.rs:514-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/quality.rs:480\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/quality.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2a9b56d5915647b43c3b96a9523c2178bf7f0d0a072da44b7222b8794771f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): llmfit-tui/src/display.rs:90-116 | llmfit-tui/src/display.rs:520-544 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/display.rs:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060models\u0060 to \u0060\u0026[LlmModel]\u0060 in one and \u0060\u0026[\u0026LlmModel]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/display.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f22e71a64564b83b3e398a0350b3a063f67a4eae5d1838f1c745c83ddefe7aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): llmfit-core/src/providers.rs:2422-2432 | llmfit-core/src/providers.rs:2810-2820 | llmfit-core/src/providers.rs:3517-3528 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/providers.rs:2422\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060llmfit-core/src/providers.rs:2434\u0060 calls \u0060Some\u0060, \u0060split\u0060, \u0060next\u0060 and \u0060llmfit-core/src/providers.rs:2821\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":2422}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e5f2ff5813ebed77897219070c96d01f6e26bc27fa387e1c7434d2e7045b67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): llmfit-tui/src/serve_api.rs:568-579 | llmfit-tui/src/serve_api.rs:596-607 | llmfit-tui/src/serve_api.rs:628-639 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/serve_api.rs:568\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/serve_api.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dbdbcbe1896140208226bf79974fb25b9aed8ddc9159de04c4d6cc3abb5f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): llmfit-tui/src/display.rs:1040-1051 | llmfit-tui/src/tui_ui.rs:2931-2941 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060llmfit-tui/src/display.rs:1040\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":"llmfit-tui/src/display.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19cacf850db769739d83a756d405f2b4f214b1c9573e97c8cef7ae9f155b9da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): llmfit-tui/src/main.rs:2103-2114 | llmfit-tui/src/main.rs:3246-3257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":2103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d258588d7557e43d85b56d2683eb94e4fe7c4aa76e4a34231cb0e6cbc69ed73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): llmfit-core/src/models.rs:2549-2559 | llmfit-core/src/models.rs:2564-2574 | llmfit-core/src/models.rs:2579-2589 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/models.rs:2549\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":"llmfit-core/src/models.rs"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca110e88fecbb94195ba58c7148b0c81572eeb48a629c595495573f6e0c632fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): llmfit-core/src/benchmarks.rs:317-327 | llmfit-core/src/share.rs:131-141 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060llmfit-core/src/benchmarks.rs:317\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/benchmarks.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53265abdfc799984ad9a4c3a20a5e68912e62cbe902691d8a5af1828110606f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): llmfit-core/src/providers.rs:1076-1086 | llmfit-core/src/providers.rs:2501-2511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/providers.rs:1076\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060llmfit-core/src/providers.rs:1088\u0060 calls \u0060code\u0060, \u0060unwrap_or\u0060 and \u0060llmfit-core/src/providers.rs:2513\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"7793a1ec22d0d8571ced4b5dbddf9dc58e6977ed37755d39e60012531ad8ad89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): llmfit-core/src/update.rs:247-257 | llmfit-core/src/update.rs:696-706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/update.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea32d839b618a0d0a2ecb39b95f7b89845c3bcd77bb5126e28f1d57e736f2fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): llmfit-tui/src/main.rs:2360-2370 | llmfit-tui/src/main.rs:2371-2381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29bc630d3ad180a13f5cfc65f94cd8a5b517861404f48091d437cd1c3d9cf43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:3191-3201 | llmfit-tui/src/tui_ui.rs:3275-3285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:3191\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce26d0a31c0d28b91083efdbccafc7cdae3ffdf81a3ed4de22a65ab6008e8f8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): llmfit-tui/src/tui_ui.rs:3059-3068 | llmfit-tui/src/tui_ui.rs:3180-3189 | llmfit-tui/src/tui_ui.rs:3264-3273 | llmfit-tui/src/tui_ui.rs:3717-3726 | llmfit-tui/src/tui_ui.rs:3793-3802 | llmfit-tui/src/tui_ui.rs:3874-3883 | llmfit-tui/src/tui_ui.rs:4232-4241 | llmfit-tui/src/tui_ui.rs:4307-4316 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:3059\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e61a18f4830c6a6c5677cd802ac36f4c69aae7f8db41b0ae401b865104eb28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): llmfit-core/src/hardware.rs:450-459 | llmfit-core/src/hardware.rs:812-820 | llmfit-core/src/hardware.rs:1598-1607 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/hardware.rs:450\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc17a38d20a8528ceb5d47f3159c8d93747dc98275bda4438c2a1639fb62433a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): llmfit-core/src/providers.rs:2211-2220 | llmfit-core/src/providers.rs:2234-2241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":2211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4736cc11864b60b5427cec495d261184d9480dfb227f378018db57bf4de912ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): llmfit-core/src/providers.rs:2929-2938 | llmfit-core/src/providers.rs:2992-3001 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/providers.rs:2929\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"905dc3efc1595927f0aa9bacd16d3ad63cf220a8a615a9ebb02fcbd87f1c8180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): llmfit-tui/src/main.rs:1546-1555 | llmfit-tui/src/serve_shared.rs:5-14 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060llmfit-tui/src/main.rs:1546\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060llmfit-tui/src/serve_shared.rs:16\u0060 calls \u0060gpu_memory_bandwidth_gbps\u0060 and \u0060llmfit-tui/src/main.rs:1556\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"583a5ef1a20dc9bf2dbc2642aaae58ac2548912df3b58c7dad39bd4207e82fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): llmfit-tui/src/mcp_server.rs:175-184 | llmfit-tui/src/serve_api.rs:1288-1297 \u2014 before extracting anything, compare \u0060llmfit-tui/src/mcp_server.rs\u0060 and \u0060llmfit-tui/src/serve_api.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"llmfit-tui/src/mcp_server.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66683b5427e88fa1235bb9488d8e997a7ff89557b40ab6da25fce9cf9f6b707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:5333-5342 | llmfit-tui/src/tui_ui.rs:5367-5376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:5333\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5333}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3d2056395c3301b058ee36ad0676888eeaf7d2efe740c8cba0434cf52e651b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): llmfit-core/src/benchmarks.rs:510-518 | llmfit-core/src/benchmarks.rs:733-741 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/benchmarks.rs:510\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/benchmarks.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d49b7f4001049e28fe9a0071a425951de297d4adaf7c0809d3217c37ffcf25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): llmfit-core/src/benchmarks.rs:778-786 | llmfit-core/src/benchmarks.rs:799-807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/benchmarks.rs:778\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060llmfit-core/src/benchmarks.rs:796\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060llmfit-core/src/benchmarks.rs:775\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/benchmarks.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"98646a52b9b52ea8f766916f9893bde87939f9946d731c324f99cb0ceca88182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): llmfit-core/src/benchmarks.rs:818-826 | llmfit-core/src/benchmarks.rs:1032-1040 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/benchmarks.rs:818\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/benchmarks.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"8784acf6e0e1c8fef18ee9a2be8bb2d093d1578c9c7fdca716d1047d24952d62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): llmfit-core/src/hardware.rs:1503-1511 | llmfit-core/src/hardware.rs:1630-1638 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/hardware.rs:1503\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060llmfit-core/src/hardware.rs:1512\u0060 calls \u0060trim\u0060 and \u0060llmfit-core/src/hardware.rs:1639\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/hardware.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb224939f9a6fa492598519d4ce6eeafe29cc35a58940dba2be7de18f4cbcac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): llmfit-tui/src/download_history.rs:49-57 | llmfit-tui/src/filter_config.rs:58-66 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/download_history.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e23e8b0481617da843fe3eeb77cfb80f59658ae1d34bc0a58d2e2acce8e6fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): llmfit-tui/src/tui_ui.rs:3728-3735 | llmfit-tui/src/tui_ui.rs:3804-3811 | llmfit-tui/src/tui_ui.rs:3885-3892 | llmfit-tui/src/tui_ui.rs:4243-4250 | llmfit-tui/src/tui_ui.rs:4318-4325 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:3728\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3728}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bf5c6cff2a08058494c2ebdf6c45ddd23df5c648649282a10d0ed735777223"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): llmfit-tui/src/tui_ui.rs:648-655 | llmfit-tui/src/tui_ui.rs:677-684 | llmfit-tui/src/tui_ui.rs:706-713 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:648\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b3921f488850aadfb3e6c13f102630c93460b03800ac7527e32a985e9433d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): llmfit-tui/src/tui_ui.rs:4357-4373 | llmfit-tui/src/tui_ui.rs:4479-4495 | llmfit-tui/src/tui_ui.rs:5275-5291 \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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4357}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb32aa55812c9d2fdf939fdc7da1d6c951e697ea53a1016884f54e21257c568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): llmfit-core/src/hardware.rs:1265-1272 | llmfit-core/src/hardware.rs:1300-1307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/hardware.rs:1265\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/hardware.rs"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"57270e800d0cfb1c4a7bbae96492673048c5e6a4a474944659593b15e4b591c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): llmfit-core/src/providers.rs:597-604 | llmfit-core/src/providers.rs:688-695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4b2716cc3607333a9b95f4114bfccd6a5a5f15525ddbe419e72360e6bc671d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): llmfit-core/src/share.rs:1005-1012 | llmfit-core/src/share.rs:1014-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/share.rs:1005\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":"llmfit-core/src/share.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7280f21bb695df84c7d21b462ba3c480fa47a59f6edb5bfe44c4f92f7a88aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): llmfit-core/src/update.rs:471-478 | llmfit-core/src/update.rs:619-624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/update.rs:471\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060llmfit-core/src/update.rs:625\u0060 calls \u0060call\u0060 and \u0060llmfit-core/src/update.rs:479\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/update.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"45da4eb09b1ba31cbcbd87bbd5d467040f401f95ed8ff6d99889a999f87bd8e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): llmfit-tui/src/main.rs:2687-2693 | llmfit-tui/src/main.rs:3930-3937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/main.rs:2687\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":2687}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d84778bcdff9b2e9ab69f69c7efcc941b42e07e207bfa758fee891d972ef571"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): llmfit-tui/src/serve_api.rs:1287-1294 | llmfit-tui/src/serve_api.rs:1304-1311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/serve_api.rs:1287\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060llmfit-tui/src/serve_api.rs:1295\u0060 calls \u0060to_lowercase\u0060, \u0060contains\u0060, \u0060label\u0060 and \u0060llmfit-tui/src/serve_api.rs:1312\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/serve_api.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cd655eb65e40ed538d3e6d387397513b7162b8d163bbf14ff6318038fc2b77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:4450-4457 | llmfit-tui/src/tui_ui.rs:4569-4576 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4450}}}],"partialFingerprints":{"codehealthFindingId/v1":"933dc5db8cdddce28c983ffd2e7da29d0a5a88cdcffba63796c8b7ebd11d7074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): llmfit-tui/src/tui_ui.rs:3094-3100 | llmfit-tui/src/tui_ui.rs:3206-3212 | llmfit-tui/src/tui_ui.rs:3290-3296 | llmfit-tui/src/tui_ui.rs:3740-3746 | llmfit-tui/src/tui_ui.rs:3816-3822 | llmfit-tui/src/tui_ui.rs:3897-3903 | llmfit-tui/src/tui_ui.rs:4330-4336 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:3094\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3094}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba57eac92dc4a23e38fe45760f24e970b6b7bd99cbdc88ab6ad14fead00b2e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): llmfit-core/src/providers.rs:2394-2401 | llmfit-core/src/providers.rs:2460-2466 | llmfit-core/src/providers.rs:3489-3496 | llmfit-core/src/providers.rs:3552-3558 | llmfit-core/src/providers.rs:3720-3727 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/providers.rs:2394\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060llmfit-core/src/providers.rs:3497\u0060 calls \u0060endpoint_has_omlx_status\u0060, \u0060from_millis\u0060 and \u0060llmfit-core/src/providers.rs:2402\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb86b9f629fb0e2ae895f3e2da21417283b10d46570bdff8a06db84de9cd6d9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): llmfit-core/src/benchmarks.rs:776-782 | llmfit-core/src/benchmarks.rs:797-803 | llmfit-core/src/benchmarks.rs:816-822 | llmfit-core/src/benchmarks.rs:1030-1036 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060llmfit-core/src/benchmarks.rs:796\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060llmfit-core/src/benchmarks.rs:775\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/benchmarks.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e60a1fde91fa8091b6b0cb2ac69642a1f671cf8d73102dec5ba3f561b800c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 6): llmfit-tui/src/tui_ui.rs:3308-3311 | llmfit-tui/src/tui_ui.rs:4056-4058 | llmfit-tui/src/tui_ui.rs:4356-4362 | llmfit-tui/src/tui_ui.rs:4478-4484 | llmfit-tui/src/tui_ui.rs:5200-5206 | llmfit-tui/src/tui_ui.rs:5274-5280 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060llmfit-tui/src/tui_ui.rs:4355\u0060 calls \u0060saturating_sub\u0060 and \u0060llmfit-tui/src/tui_ui.rs:3308\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3308}}}],"partialFingerprints":{"codehealthFindingId/v1":"576cd3a77fb995869e36f176fd26848019ce99fe249786260b9b1440e188b72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-core/src/bench.rs:203-209 | llmfit-core/src/quality.rs:208-214 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060llmfit-core/src/quality.rs:216\u0060 calls \u0060elapsed\u0060 and \u0060llmfit-core/src/bench.rs:211\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/bench.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"be789431e43dc11dddcd3422624538d96551d0d09954969d0e9fc33eea52afbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-core/src/claim.rs:120-126 | llmfit-core/src/share.rs:250-256 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/claim.rs:120\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":"llmfit-core/src/claim.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1f9a72aed14bf5d60db1738d06e4bae84b6ff5fc7c5f08409c27503c0a9eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-tui/src/mcp_server.rs:144-150 | llmfit-tui/src/serve_api.rs:1230-1236 \u2014 before extracting anything, compare \u0060llmfit-tui/src/mcp_server.rs\u0060 and \u0060llmfit-tui/src/serve_api.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"llmfit-tui/src/mcp_server.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d10bf35a2b21c583ff400dc3d919115b320ce47ca3cf0fa7dadbc5ff3bf5cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): llmfit-tui/src/mcp_server.rs:388-393 | llmfit-tui/src/serve_api.rs:328-334 \u2014 before extracting anything, compare \u0060llmfit-tui/src/mcp_server.rs\u0060 and \u0060llmfit-tui/src/serve_api.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"llmfit-tui/src/mcp_server.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a06506e0666c971ccfda3d73d19b5b4d17f3d82d05f8a9acd0e9960b37701ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:1079-1085 | llmfit-tui/src/tui_ui.rs:1868-1874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f06b13c2c37ef42f48de496aea27acb47dd784ec8a629a7fca63a6fc8b247fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:3648-3654 | llmfit-tui/src/tui_ui.rs:3672-3678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3648}}}],"partialFingerprints":{"codehealthFindingId/v1":"89abba04fca0a28135056b645564b3bda077496acf15ec0ecd93df16f325632f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 8): llmfit-tui/src/tui_ui.rs:2992-2999 | llmfit-tui/src/tui_ui.rs:3149-3155 | llmfit-tui/src/tui_ui.rs:3233-3239 | llmfit-tui/src/tui_ui.rs:3690-3696 | llmfit-tui/src/tui_ui.rs:3762-3768 | llmfit-tui/src/tui_ui.rs:3843-3849 | llmfit-tui/src/tui_ui.rs:4201-4207 | llmfit-tui/src/tui_ui.rs:4276-4282 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2992}}}],"partialFingerprints":{"codehealthFindingId/v1":"4440da9868f88cdcb5438c8b8434a1af999e88970a89fd583fba9758659b53ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): llmfit-core/src/hardware.rs:1273-1278 | llmfit-core/src/hardware.rs:1288-1293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/hardware.rs:1273\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f895d5fc51be25a027c0e8e0b7076ab5d5515a2db74901a1bfde060e2b295ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): llmfit-tui/src/tui_app.rs:1422-1427 | llmfit-tui/src/tui_app.rs:1429-1434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_app.rs:1422\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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fa345bdcac5ee273126fb562176fd3611779609a1f028a4d6a98dbedde7684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:1415-1424 | llmfit-tui/src/tui_ui.rs:1430-1435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1415}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1270f481fce280ae108ddfdcc74d0a6a82f14a262f16ae47fa056e573445d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:2654-2662 | llmfit-tui/src/tui_ui.rs:2683-2691 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2654}}}],"partialFingerprints":{"codehealthFindingId/v1":"5138aad143ad7fee95c992f01dd21378a4e934de77441bfe6453bc0d9fd34f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): llmfit-tui/src/tui_ui.rs:1315-1319 | llmfit-tui/src/tui_ui.rs:1665-1669 | llmfit-tui/src/tui_ui.rs:1682-1686 \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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f42cb01cce358d21667a16990f5bdaf2e7d5c62e9e2e572b692810c1d780e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): llmfit-core/src/hardware.rs:2302-2307 | llmfit-core/src/hardware.rs:2317-2322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/hardware.rs:2302\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/hardware.rs"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d3399e48791d8907e246dd28672a267ce834fb6ec8d33ae7e9fe8686cde242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): llmfit-core/src/providers.rs:1823-1827 | llmfit-core/src/providers.rs:1830-1834 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18573b121a4a97b559427514c59da5fbb66ec6fa2736be1eb9250ccba4eb6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): llmfit-tui/src/download_history.rs:41-46 | llmfit-tui/src/filter_config.rs:49-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"llmfit-tui/src/download_history.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ab4fb100f5d80a666b26f23de86dac18c33a3547cb6979adde71710348130b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): llmfit-tui/src/mcp_server.rs:461-469 | llmfit-tui/src/serve_api.rs:1457-1465 \u2014 before extracting anything, compare \u0060llmfit-tui/src/mcp_server.rs\u0060 and \u0060llmfit-tui/src/serve_api.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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":"llmfit-tui/src/mcp_server.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"4428eb420985745170bbb8c57e532d81af7c759c48ec16e7d54a56e180ccd9b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): llmfit-core/src/models.rs:2569-2581 | llmfit-core/src/models.rs:2595-2607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/models.rs:2569\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/models.rs"},"region":{"startLine":2569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe2bb45c20936a2a6e86e59298b32aad1a8f966dd747eb7297fee3e7373555d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): llmfit-tui/src/main.rs:3171-3178 | llmfit-tui/src/main.rs:3203-3211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/main.rs:3171\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/main.rs"},"region":{"startLine":3171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0923b4e53c90691097b90e1b2748aefff253f4aed3fa2272ba013b00f8075a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): llmfit-tui/src/tui_ui.rs:5337-5345 | llmfit-tui/src/tui_ui.rs:5371-5379 | llmfit-tui/src/tui_ui.rs:5395-5403 | llmfit-tui/src/tui_ui.rs:5421-5429 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:5337\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5337}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db6031a2442d59bff008c15d2789d7134c23b64b614420c017287a80205af36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:711-719 | llmfit-tui/src/tui_ui.rs:808-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:711\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"1938134907ee4a796b132f42ff59dce2c0dcd6f3d205d08bf1ac32505e26de27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): llmfit-core/src/bench.rs:870-877 | llmfit-core/src/bench.rs:997-1004 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/bench.rs:870\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":"llmfit-core/src/bench.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8cf0ec06ebfabafacaf775939f7a3e965450ab718b428003b5c01dc420eeba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:4665-4672 | llmfit-tui/src/tui_ui.rs:4716-4723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4665}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab24d391c3dd815d1763cc432464c2dc9b2bd86590d9de2b58eaf9b43c93ea1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:4703-4710 | llmfit-tui/src/tui_ui.rs:4773-4780 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4703}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bf029b80a732f2aafc6defc0e9abc6944146e15d31fab5939200c80181a09f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:4026-4032 | llmfit-tui/src/tui_ui.rs:4447-4454 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:4026\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4026}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bfd14fbd1c021c48201f97dea713c41ec7f586b19a434316509e5427abd0da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:5412-5418 | llmfit-tui/src/tui_ui.rs:5436-5442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:5412\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5412}}}],"partialFingerprints":{"codehealthFindingId/v1":"842014f74097b55c73a7a476c02ce69aebfcc8584c034c988085139125227790"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): llmfit-tui/src/tui_ui.rs:3353-3359 | llmfit-tui/src/tui_ui.rs:4364-4370 | llmfit-tui/src/tui_ui.rs:4486-4492 | llmfit-tui/src/tui_ui.rs:5282-5288 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:3353\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3353}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d2b0312b0f2636b64b8b08b8ed7f07562542c07e4e951e4f5d65da68b877d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): llmfit-tui/src/tui_ui.rs:642-648 | llmfit-tui/src/tui_ui.rs:671-677 | llmfit-tui/src/tui_ui.rs:700-706 | llmfit-tui/src/tui_ui.rs:780-786 | llmfit-tui/src/tui_ui.rs:800-806 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:642\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"e701f410f00d7287f8b4141c08209e26ec44c1f5cf6c65357a7598b5af3b6c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): llmfit-tui/src/tui_ui.rs:4451-4457 | llmfit-tui/src/tui_ui.rs:4570-4576 | llmfit-tui/src/tui_ui.rs:5452-5458 \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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4451}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd292e8eaab4f2d03a08d45130dbdd4b0e45d7512d3329d29b898fe1df62cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:2836-2842 | llmfit-tui/src/tui_ui.rs:2861-2867 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:2836\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fac79bc95f313a0f93a6b10c4037a35bfc2fb97b9447cec366c33fcccf0bc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:2812-2818 | llmfit-tui/src/tui_ui.rs:2837-2843 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:2812\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2812}}}],"partialFingerprints":{"codehealthFindingId/v1":"de25b5ebddab004d678af0af945386e3251cde56c9f0c08e0b37a37fe262e8a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:2102-2107 | llmfit-tui/src/tui_ui.rs:2109-2114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:2102\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"9346b03483881cee3801a0de07d23388c6fcce24243b8a1d57424c6c0dcfa9d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): llmfit-tui/src/tui_ui.rs:4960-4964 | llmfit-tui/src/tui_ui.rs:5207-5211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-tui/src/tui_ui.rs:4960\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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":4960}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b33f79b143134d42016150096ed196d4febd1655a4322f353ca4dded0b132e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): llmfit-tui/src/tui_ui.rs:3204-3208 | llmfit-tui/src/tui_ui.rs:3288-3292 | llmfit-tui/src/tui_ui.rs:3738-3742 | llmfit-tui/src/tui_ui.rs:3814-3818 | llmfit-tui/src/tui_ui.rs:3895-3899 | llmfit-tui/src/tui_ui.rs:4253-4257 | llmfit-tui/src/tui_ui.rs:4328-4332 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060llmfit-tui/src/tui_ui.rs:3209\u0060 calls \u0060style\u0060, \u0060default\u0060, \u0060bg\u0060 and \u0060llmfit-tui/src/tui_ui.rs:4258\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":3204}}}],"partialFingerprints":{"codehealthFindingId/v1":"88049d0ab0ec28764e29ed5545b85c44c196b1ddc6b77a468b4b198e0d4d8d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): llmfit-tui/src/tui_ui.rs:433-437 | llmfit-tui/src/tui_ui.rs:1315-1319 | llmfit-tui/src/tui_ui.rs:1665-1669 | llmfit-tui/src/tui_ui.rs:1682-1686 \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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"074509fd617cebd1fa50084ff07f5de31b155a24ab15a1aa31ff6d26fe02a5f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): llmfit-core/src/providers.rs:1504-1508 | llmfit-core/src/providers.rs:2200-2204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060llmfit-core/src/providers.rs:1504\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-core/src/providers.rs"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"5139daf230ecc31e3ffe1dad91d108cdc5084b80226f1f1be7d4028ebf7c8c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): llmfit-tui/src/tui_events.rs:1010-1016 | llmfit-tui/src/tui_events.rs:1125-1131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d6a5d59acc79d99e5ab36eca010df7348a583c952c03781c430ee7a9ab939"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): scripts/scrape_hf_models.py:1499-1584 | scripts/scrape_hf_models.py:2753-2829 \u2014 These two members are one piece of code written twice and then edited apart: 77 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":"scripts/scrape_hf_models.py"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d6cda315b96878bde2b46e47fa5fee92bd611bd63aab473b3d39215eca363f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): scripts/validate_generation_scoring.py:189-220 | scripts/validate_generation_scoring.py:224-257 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"scripts/validate_generation_scoring.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a822a9e908dd761bbe4fbd97770dcb497bf0e909231349900cad7ca5d028c2a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201357 lines \u00D7 2): scripts/scrape_hf_models.py:1523-1579 | scripts/scrape_hf_models.py:2773-2797 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/scrape_hf_models.py:2773\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/scrape_hf_models.py"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"53344067bd729d448aafbd82e859d34d93c3d81b42ab6bec618c8189e23e29ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): scripts/validate_generation_scoring.py:189-218 | scripts/validate_generation_scoring.py:224-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":"scripts/validate_generation_scoring.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d05a725451aa7fa49806d0812c57a2806fcfe9d0ff79c3ce7e05d6b20e1bf6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/validate_generation_scoring.py:59-71 | scripts/validate_generation_scoring.py:77-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/validate_generation_scoring.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"095e72fb22660be986b9655bf59fc763a00885e734150cafa4f564fae6229ad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/scrape_hf_models.py:2138-2143 | scripts/scrape_hf_models.py:2155-2160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/scrape_hf_models.py"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db49a3da2e9f127b53a581ed7648166b4632aae1030e509fa7d907a928c109c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: llmfit-core: llmfit-core: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e60b3148e545272eaded530c354c79276b66fc29235749038eca93d57d082190"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ModelFit (LCOM4 4): ModelFit\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":"llmfit-core/src/fit.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3b55dfbadf1591b495844626b765892cccc34c0eefb9aee9e86aa3193d0138"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 llmfit-web/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-tui/src/main.rs: llmfit-tui/src/main.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in llmfit::main at line 4240. 26 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-tui/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":"llmfit-tui/src/main.rs"},"region":{"startLine":4240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2343909d1b350be576f03c33f47483f3232681781280e5608436978fb1c84667"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-core/src/fit.rs: llmfit-core/src/fit.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in ModelFit::analyze_inner at line 566. 27 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-core/src/fit.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":"llmfit-core/src/fit.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"99939d789cf8166c781365ed09b5f17eb4c4e45e0f6f1b88cf4157fe13700eec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-tui/src/tui_app.rs: llmfit-tui/src/tui_app.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in App::apply_filters at line 1795. 9 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-tui/src/tui_app.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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"903bdb1c3634f66b4fc2cf544329ad664c7076f0b49917bf087cec251b0d2910"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/scrape_hf_models.py: scripts/scrape_hf_models.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in scrape_hf_models.main at line 2862. 12 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- scripts/scrape_hf_models.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/scrape_hf_models.py"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46f690e16849b281c5265c26cf160f09ecd08351f01f4ec84495384d6c3b176"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-core/src/hardware.rs: llmfit-core/src/hardware.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SystemSpecs::detect_all_gpus at line 250. 16 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-core/src/hardware.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":"llmfit-core/src/hardware.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1611c8b5465ec3d83cb95eff864c93e3dcaece962e4d6c6ed3f12a54563bfa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-tui/src/tui_ui.rs: llmfit-tui/src/tui_ui.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in llmfit::tui_ui::draw_bench at line 5531. 7 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-tui/src/tui_ui.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":"llmfit-tui/src/tui_ui.rs"},"region":{"startLine":5531}}}],"partialFingerprints":{"codehealthFindingId/v1":"b422d77cfb1470ff9dbbeb29b7c4fa8e6297bed3db5ec8312feff88b2b073b1c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-tui/src/tui_events.rs: llmfit-tui/src/tui_events.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in llmfit::tui_events::handle_view_mouse at line 765. 4 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-tui/src/tui_events.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":"llmfit-tui/src/tui_events.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db3fa40707d39c8f817d82938058aafeeed91f1a37eedb91c33e2dc26c83930"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-tui/src/display.rs: llmfit-tui/src/display.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in llmfit::display::display_model_detail at line 192. 7 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-tui/src/display.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":"llmfit-tui/src/display.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"764f230ad4bcc959b654ac35174ac75593d4b40d1c6590eea243f00959a79d45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-tui/src/serve_api.rs: llmfit-tui/src/serve_api.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in llmfit::serve_api::start_download at line 863. 4 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-tui/src/serve_api.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":"llmfit-tui/src/serve_api.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4e02a8a109f5f88d63f978009e97b71930d58fde2c24af3c92e22f44376ffc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-core/src/plan.rs: llmfit-core/src/plan.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in llmfit_core::plan::estimate_model_plan_with_config at line 609. 7 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-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-core/src/plan.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":"llmfit-core/src/plan.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cbac08cc27f9657868bf24191622278e702023520073d93e7ebb68cdf3ba52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-tui/src/cluster_cli.rs: llmfit-tui/src/cluster_cli.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in llmfit::cluster_cli::interactive_init at line 357. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-tui/src/cluster_cli.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":"llmfit-tui/src/cluster_cli.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc3c26ca1dd1bd8a83e512c7b9887878b2365a2c7f78a47703f2012d59b82a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: llmfit-web/src/components/DetailPanel.jsx: llmfit-web/src/components/DetailPanel.jsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in DetailPanel.DetailPanel at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-web/src/components/DetailPanel.jsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e016b1dae852aafc9d6f69f94d4cef5cc610d69de668a82f054e5ee92efcdf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: llmfit-core/src/cluster.rs: llmfit-core/src/cluster.rs changed 22 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is RayEndpoint::parse at line 524), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: v1.1.19 Framework/ROCm findings: NVFP4 routing, head backfill, cluster diff/banner/Ray backend (#1230)\u201D; \u201Cfix(cluster): structured refusal reason, tp_size, KV replication, TP=1 and Ray discovery follow-ups (#1225)\u201D; \u201Cfix(cluster): skip dead Ray nodes; default https:// to port 443\u201D; \u201Cfix(cluster): name a mixed Ray node by its oldest GPU\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-core/src/cluster.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":"llmfit-core/src/cluster.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"e693539a095032356c88709528ed55fbed0066974778cbdf32c91fd5f042f69f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: llmfit-core/src/bench.rs: llmfit-core/src/bench.rs changed 7 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 llmfit_core::bench::discover_all_targets_at at line 762), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bench): read OLLAMA_HOST like the Ollama provider does (#1171)\u201D; \u201Cfix(bench): error when the requested model is not available (#1041)\u201D; \u201Cfix(bench): ignore implausible tok/s from degenerate Ollama timings (#1042)\u201D; \u201Cfix(bench): stop wall timer after body read in OpenAI and Ollama paths (#1037)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-core/src/bench.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":"llmfit-core/src/bench.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"53da28af6c9f99a84d7638f25471cba851a7e390b58fb59159b7753291337d1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: llmfit-core/src/update.rs: llmfit-core/src/update.rs changed 5 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 llmfit_core::update::extract_model_params at line 188), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(scraper): keep the stated context window for llama3 rope scaling (#1167)\u201D; \u201Cfix(update): detect MoE models from config.json expert counts (#1142)\u201D; \u201Cfix(update): read the context window from config.json (#1054)\u201D; \u201Cfix(update): request every mapped field in the HuggingFace list expand[] (#1048)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-core/src/update.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":"llmfit-core/src/update.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d0f4d0e40ca2c38c55c7bbed64c5100c037a070135a14936de6b9b6ef1e1a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: llmfit-core/src/analysis.rs: llmfit-core/src/analysis.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 9 (its worst body is InstalledIndex::installed_providers at line 144), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(cluster): structured refusal reason, tp_size, KV replication, TP=1 and Ray discovery follow-ups (#1225)\u201D; \u201Cfix: match benchmark calibration by PCIe link width (#1202)\u201D; \u201Cfix(providers): find LM Studio models on disk, not just loaded ones (#902)\u201D; \u201Cfix(ollama): stop a size-less family tag claiming a much larger model (#899)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-core/src/analysis.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":"llmfit-core/src/analysis.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"228f29ce50944f08eb8d9dfc7fe6f432ae77779eec359c1f284ffdaa200e286a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: llmfit-core/src/share.rs: llmfit-core/src/share.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 11 (its worst body is llmfit_core::share::share_all_pending at line 519), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: match benchmark calibration by PCIe link width (#1202)\u201D; \u201Cfix(bench): ignore implausible tok/s from degenerate Ollama timings (#1042)\u201D; \u201Cfix(bench): identify Ferrum and vLLM by endpoint owner (#994)\u201D; \u201Cfix(share): explain a refused write to the user\u0027s own fork (#865)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-core/src/share.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":"llmfit-core/src/share.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75f98b19f5932ac6b8cee5cc68cbb43c0db239501789aa5f153e2349289ae6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: llmfit-core/src/benchmarks.rs: llmfit-core/src/benchmarks.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 12 (its worst body is llmfit_core::benchmarks::hardware_payload_match_grade at line 612), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: match benchmark GPU counts (#1237)\u201D; \u201Cfix: match benchmark calibration by PCIe link width (#1202)\u201D; \u201Cfix(bench): ignore implausible tok/s from degenerate Ollama timings (#1042)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-14..2026-11-12, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-14 07:19:06 \u002B00:00\u0027 --until=\u00272026-11-12 07:19:06 \u002B00:00\u0027 --full-history --no-merges -- llmfit-core/src/benchmarks.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":"llmfit-core/src/benchmarks.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"9791e8693955c38edf289d29935e59510f4371edfa9c20ee8cb93abe8990ba8e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 5 significant file(s) lose their only recent owner: scripts/validate_generation_scoring.py, scripts/scrape_benchmarks.py, scripts/validate_community_benchmarks.py, scripts/verify_models.py, llmfit-core/src/task_bench.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c7ffd29f23bc3dee882d67eea9205aba7d0ebbcfb1dc236f363fd259d11e31f4"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (6 single-owned of 39 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; 39 of the 43 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: llmfit-core/src/concurrency.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060llmfit-tui/Cargo.toml\u0060 makes this repository a deployable product (line 15)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-tui/Cargo.toml"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf9a7c2a6e8eeb0098ab1484227a62f4396b27fcd1c417ef21fd2b4fdbd32b8"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 6 project(s) overshoot their size bounds, lowering Project Cohesion to 6.7/10. The most over is \u0060llmfit-core\u0060 (40817 LoC, 132 module-visible types across 1 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b2dfa68cfc8df03b4984a7629a2be2fde7a439baba670e296be09747a4eaf80"},"properties":{"commitSha":"c68d7aad0c0a00cbf12ae49c7325d74bf0142fce"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0063c758847f616c2c3e785572b6a1fc100eeb5784b319de72c4dbd9d1efdce9"},"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":"26c73a49ad359f50855a886978c89ac53bb96ccb656fd0c68acb716c27f6ca9c"},"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":"9545660e6add0322e3f7b23092a9bdb2b9ecacff6395f93e694cf9dc97bdaaa2"},"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":"fb954bf28acba2f9531ea60fbb4a975457958c1ea72f6bdedbdff3276eea4ea5"},"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":"5bf66f5e7d68d560e31890595924148a2f29517a30395ef5653442821cb20e6d"},"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":"e0cbba4a3f80f3f47b4ed948033644e392e24f9c9fa3b5a19ac4ca5e45b79ae9"},"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":"2cf3dfe872f6f701a845c11d6ea2bb07a23d827d78e344c2a7532710c00df06c"},"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":"2b1a32f8fab612afdf3ad441888a3b38e66f1c1832902eb741f35ad5afa48465"},"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":"460ea520c863361268934439fb1381743c964506c4a429e1f3af12e70ba5cec9"},"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":"ee6da1b051ddff31eece62e737e90827fa671274985f5a26bd0f59d7c044006f"},"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":"42228a79e7c87e4e1e0e7afff07f1e9be01390a447a83fe455e983934006fa69"},"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":"ce120f6f96218c9fa39188d288428d0a6f8115ea2224f42d1ab66a6133ced829"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c5aef8c36eb1c844de0199525b0a8120a1791b8ec2fe043e32bd80dafc16548"},"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":"d46dd366dda4dedb282c9d2e461a14364a45adfd816be4138d189e4bf3cf18a5"},"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":"0192a50b92fc4ce0130b513dd908947f5b6f4096d5171edc3cec015f8f92ac3d"},"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":"d8b6b524b6ddb0c9e58ac5d75e7355299dbbed823fa4a6b7e495a0f793d71c5e"},"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":"ef08d611598d46ef68d55d82c352deccfd495cd020dd203f5ff7ee068e66ad8d"},"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":"762687584e895e0e6874bfe628ad7f7749e377848524c279a6792f732cb1b03c"},"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":"57d94ecf1e4e1b67a0a20e1126764020d74cc51d3a14b0d8b3faf921de4f9ffd"},"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":"bbcebaedf0fd4b5770eccc91d20c8ac8d32778656af4c1e84f5fe53e060be535"},"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":"98084a64f46cf727b430c9dbf2209ae61911d64e0fb0707f0b84bb363f727999"},"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":"f0c18c25343ecc5756cbbd33f580cf1e3b084292b7d6f95b00fc4576bc57ab9c"},"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":"a79daa86224e22345cc8a417dc0612109e1cbc5ed61dc16d593f8316461d5a47"},"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":"0f70fd7a68965ccca8fd85dad18f2a6fd9cca5da698d98a6a85c4e2bdf9348c1"},"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":"b16bffdc99635063ef6fb3f4028a5a64a332579b035c638fe7a764baaa17cde1"},"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":"f474b4632d1789a269eaac2a6e07d9a5cf27cae0c8829f741227d126d0537d3f"},"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":"e3a3c5093ba8638bbf7a2c60c65f6a4e60c0dc5c47eaca61621c018b76c30197"},"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":"e53468fc14aae86fe16fcd7258d2c116521e79102453ef4c4fd14a041350421c"},"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":"c5d8a56b8d1ed3c94f6a1089b91c17fea9d362e6b2b0b35ffeeeac8f84ea5eb4"},"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":"3697f1522e19a638b7ef88b7aaf49350d5b9b08b7c831fcbc85b3c68f84dd986"},"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":"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":"cf28b701620bcea8db2dee69d33f0b41cab06b6920fa2d3c98cae2696025a047"},"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":"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":"4bda812c6b03d94788109086d67e26865661d94fb0d23a16e1fa3a87b20d3c0d"},"properties":{"dependency":{"package":"tinypool","version":"1.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"8caaa15b665fb5f47b2b28ffce8e56a6a03870f62a2f82d07e4cce39315d187c"},"properties":{"dependency":{"package":"vitest","version":"2.1.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"llmfit-web/package.json"}}}},{"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":"2121e9ca8707753a9412a1ff7d511e3b57ec2fbfcaba38f1a1e1de7d0b388a32"},"properties":{"dependency":{"package":"browserslist","version":"4.28.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"032f106d0559036d7e1dbf898f30de2bf9c8b35bbaab205c6b855757e27ea6e7"},"properties":{"dependency":{"package":"nanoid","version":"3.3.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"9bd0575d96038226bbc131f567977779509b47943520ee6be9256cfc336cbc88"},"properties":{"dependency":{"package":"postcss","version":"8.5.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"346af18672e395feb65052bb80f3b136f993c2906b3d3eec4cd7a3eaa79d1791"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"4a2075677742fe67d949244b634a92671784a3d1f93f6a2d265a77a9df57f7f5"},"properties":{"dependency":{"package":"vite","version":"5.4.21","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"llmfit-web/vite.config.js","line":1}}}},{"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":"eb55bceb756de335edf1cb6ef8b0c22d872417cb1ea702069a10f44759f897e8"},"properties":{"dependency":{"package":"ws","version":"8.19.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","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":"02807c2340c313bd085553cef2aa54725b58db377d04241d3195bea3a23b7783"},"properties":{"dependency":{"package":"glib","version":"0.18.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2024-0429"],"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":"422864efbc32ee020d94634a443edac9d818b90faf02ac96d91c4d66ffa4da37"},"properties":{"dependency":{"package":"lru","version":"0.18.0","advisory":"RUSTSEC-2026-0253","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":"95686d8e64236c3c2c566e482859faf67a5bbd9dbeebb6f4df8aab56c3496281"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.38.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"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":"0ba8fd7f254f7c15aa4089f3a77a0a35e422a015dfbee76650a6684830993a1c"},"properties":{"dependency":{"package":"rmcp","version":"3.7.0","advisory":"RUSTSEC-2026-0462","aliases":["[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":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[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":"a7ac1525ee21f8396482ed6caafb5092cc4f1f938990a606ace871da2f8aa6f6"},"properties":{"dependency":{"package":"serde_with","version":"3.18.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":"c34bbaafb8f7ac6ddf4229e2a98f26cead27089727923a4bcd3e69ac02e92c7d"},"properties":{"dependency":{"package":"pygments","version":"2.19.2","advisory":"PYSEC-2026-2987","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"de541f5fe5fa81747d5ea54429e687724a189e9ee85d7ae4233561410ea0217f"},"properties":{"dependency":{"package":"pytest","version":"8.3.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1845"],"reachability":{"kind":"test-or-tooling","file":"llmfit-python/tests/test_llmfit.py","line":9}}}},{"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":"1ce115566d50644ae537f7c37a9754f171e1688c6475a5b8e0ccb053f159dd52"},"properties":{"dependency":{"package":"pytest","version":"8.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1845"],"reachability":{"kind":"test-or-tooling","file":"llmfit-python/tests/test_llmfit.py","line":9}}}},{"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":"68de72fc30918fde33110858577d1fc8b75f0da5e64965beda84f346e2077552"},"properties":{"dependency":{"package":"@vitest/mocker","version":"2.1.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"95503149094fba846077edfb83f965bd6d2e88e0c9d5e87ec45430a90a043e80"},"properties":{"dependency":{"package":"baseline-browser-mapping","version":"2.10.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"4dfe115fe3ebd1a8fe5bb300bc2158a5e705ac4c60929ba8479d2fe40e848421"},"properties":{"dependency":{"package":"esbuild","version":"0.21.5","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","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":"15a63cf436f00ca54878db13289231a1b95b6b1a199611811d123f96cc644a1e"},"properties":{"dependency":{"package":"@babel/core","version":"7.29.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"d40c1002bb306da83ff98ddf2f81632edf3497c2696e22f62bb9ea31384d55e4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6436042135f6b167ba917eaeffeda9ff2746b5119992f2561f10ac645eb9925"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f3de5ef0b48ca1917c9f9f2286bd0eae7c590636bcadbe579e0347bfdcbbb38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"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":"1f51a163f26d94ce6b6f473117dde579d091c8cbf9e59810475c94d9fc921120"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19d4cbb252a3e4997007fe629a8fde65a6a24e745494155b47ed43cbf523f1eb"},"taxa":[{"id":"CICD-SEC-4","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":"9b751280978b10ef0ea28cf6e6ded3b4604b01558bb8eb5c5c974eb0a1ab1812"},"taxa":[{"id":"CICD-SEC-5","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":"d22daa3c0142b2577729e9d60b135c41dc9a81a791c89edb17e6b6fbaea2749f"},"taxa":[{"id":"CICD-SEC-5","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":"c6eb5a94052c328a9f9d4f3228923a5f2d4d56700f96d3ddbb1b358415402983"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-desktop/ui/index.html"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d444aa1b9f6727a3518016c1013897895a9a00c673963447da1fee2ab9591acc"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-desktop/ui/index.html"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0949118a7ebb9ef81f81e5f9f6375c3b00dac4cde258d734b655c690b3c8b0af"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c03112092084821eb10323780c41f92cd64c7f4713debc46d9031ab90eaa76"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"732c4587b5831e9d9da4b05f6bb12d9a8a817ddcc0ff07809f91bca0b3a52697"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-desktop/ui/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ec0ceca1a7443084afc677ca0b678ce5a1b61cc27ba70a50904071de4672dc"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv id=\u0022root\u0022\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"976b5fb63527afc5ce025ae14d0291952bf9e8728afe69f80207af68dbeefd4b"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A script attaches a click listener to this \u003Cdiv\u003E, but it has no role, no tabindex and no key handler, so it can only be operated with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-desktop/ui/index.html"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b497e22f865d94f0c5572d7ebd93bd5de59295d6d12afe2178dc20e43d4e2b3c"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/ModelTable.jsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b49ca74c1bcf67bb8897569c6cf7d1d9d645ddd48989756796e8ae400b61bd5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.1:1): \u0060.btn-accent\u0060 sets color: #fff on background-color: #ff9c66 \u2014 2.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/styles.css"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35a7029104d665f78b7bac5a12fb5b7f12657bb888786d9283ab04262e486a5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.orb\u0060 moves (\u0060animation: float 8s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/styles.css"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e95db3cb9d8f9fadc526c2c8803f7dbd7838fc36bdbcdfa3ac13fd7752a04ff"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.hero-shell\u0060 moves (\u0060animation: rise 520ms var(--ease-out) both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/styles.css"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9ffbde7ebd23f2e138be3cc770cc2ec0388a6820bf08292e9f76c6bf74b469"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.panel\u0060 moves (\u0060animation: rise 560ms var(--ease-out) both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/styles.css"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"72028fb6bfae28382333934f97c47f0f953bef98057c58719acd0dbfbb51d8e9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.compare-panel\u0060 moves (\u0060animation: rise 400ms var(--ease-out) both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/styles.css"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af00decaf55d8b62c66388c833a073d0c9382a53dd8598216c2b331d3f69e18"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.modal-overlay\u0060 moves (\u0060animation: rise 200ms var(--ease-out) both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/styles.css"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"9995191ca06c20c5aa481adb3813ff005b984f1f357778806e804e396c62897a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.progress-fill\u0060 moves (\u0060transition: width 300ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/styles.css"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9204ce82410fe2aeac11b9627027929bbdde50997000add1ce6ce075aac193d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.mem-bar-fill\u0060 moves (\u0060transition: width 0.3s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-desktop/ui/styles.css"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"982a2478a2656b6a6be09df6e9084b801919d59cb08cc72d6b9f8180cb48c837"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.pull-bar-fill\u0060 moves (\u0060transition: width 0.3s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-desktop/ui/styles.css"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65d2ace119e4ecfc441b042f5087cadb3dfccfff4717e8875150fa34ad0bd47"}},{"ruleId":"C2","level":"note","message":{"text":"No named authorization policies: Authorization IS enforced here (by route guards, auth middleware or checks that refuse a caller) \u2014 this is NOT a claim that endpoints are unprotected. What\u0027s missing is a NAMED rule set: who may do what is encoded inline where it is checked, so the rules can\u0027t be listed, reviewed or tested apart from the code that applies them. Recommendation, not a defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b048fdf3fa524ac68c7874fdfcdb4c49d5f010013f2cb22a0bd84cb12ceb951f"}},{"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":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 59 JavaScript/TypeScript, Rust, Python production file(s) this check read across 6 module(s). Each was searched for its ecosystem\u0027s logging libraries (Python: logging, structlog, loguru; JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger; Rust: the log and tracing crates (info!/warn!/error!, #[instrument]), slog, env_logger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm/uv: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, \u0060uv\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9815db4f3f6c05533e8c3a5ad9a41500a5649db4c006fbc8834553bb4735b2c8"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::post(\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":"llmfit-core/src/share.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"159cfc3fe8ee8af13d75e83949ff6cc933a0505a24642fecb7cab0aacb063cb3"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::post(\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":"llmfit-core/src/share.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb6e7fdd08eb6d73f820e9fb0ec3daec8af91d17012d53298d78b7bfa244103"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::get(\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":"llmfit-core/src/share.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c1f7b24cfb54aee3c4db44e168fa234453cd93227b4d28b62e62124ff1394a"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::post(\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":"llmfit-core/src/share.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccca3da8e91c48e28e02f2ad02023fe2ac3f448132007b7cfec91633cee5643e"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::put(\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":"llmfit-core/src/share.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b3d7b6fda125be83e1403d9e08777d81191721c4a6a7eec9eff6652fee2b5f"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 25 plain JS \u2014 the untyped files are llmfit-desktop/ui/app.js, llmfit-desktop/ui/i18n.js, llmfit-web/src/App.jsx, llmfit-web/src/App.test.jsx, llmfit-web/src/api.js, llmfit-web/src/api.test.js (\u002B19 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (57 matched lines \u00D7 2 locations): llmfit-web/src/components/ConcurrencyCard.jsx:49 \u00B7 llmfit-web/src/components/StoragePanel.jsx:59 \u2014 the two spans are one implementation copied and then locally edited \u2014 385 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/ConcurrencyCard.jsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edd380c45487917d98fcd5b3dfb1bf54f979961136bf3553dc481b6f70386e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (36 matched lines \u00D7 2 locations): llmfit-web/src/components/DetailPanel.jsx:286 \u00B7 llmfit-web/src/components/SystemPanel.jsx:141 \u2014 the two spans are one implementation copied and then locally edited \u2014 206 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57929da83bbe96d1d124fccc91682a013ae3d632f106128fc2bd27378094394"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (36 matched lines \u00D7 2 locations): llmfit-web/src/hooks/useModels.js:14 \u00B7 llmfit-web/src/hooks/useSystem.js:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 139 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/hooks/useModels.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a5cde031766f91e0a4220972936a8d167d11ded730a11ca44037992d12ade0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): llmfit-web/src/components/FilterBar.jsx:366 \u00B7 llmfit-web/src/components/FilterBar.jsx:388 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/FilterBar.jsx"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc102a97a0325440194ae86e124ea082a0c42297875f244ae4b5a085ce4d2089"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): llmfit-web/src/components/DetailPanel.jsx:396 \u00B7 llmfit-web/src/components/DetailPanel.jsx:439 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2c52921881e3ffadc66df3d2768338e1029bd67086b98ee5705998bffab91e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): llmfit-web/src/components/Header.jsx:76 \u00B7 llmfit-web/src/components/Header.jsx:88 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/Header.jsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6873b827aaaf7bf7dde0f76198fda65569cb36da5ee47c3fcf8de47fc609c521"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5 locations): llmfit-web/src/components/DetailPanel.jsx:302 \u00B7 llmfit-web/src/components/DetailPanel.jsx:334 \u00B7 llmfit-web/src/components/SystemPanel.jsx:170 \u00B7 llmfit-web/src/components/SystemPanel.jsx:182 \u00B7 \u002B1 more site(s) not listed \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e47f6680fd371c78005e9e678fed30b86df6229b4325fcc41f2c8b6a02c70f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): llmfit-desktop/ui/i18n.js:261 \u00B7 llmfit-web/src/utils.js:32 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-desktop/ui/i18n.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289722b0467b84aa266c29c536e6a308372443c9e08780c16f8a5d20303c0b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): llmfit-web/src/components/StoragePanel.jsx:129 \u00B7 llmfit-web/src/components/StoragePanel.jsx:138 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/StoragePanel.jsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c809a79d3456e480c700d9053dc5cbdf818c257d4176fd2db58263d0bd2466"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): llmfit-web/src/components/DetailPanel.jsx:450 \u00B7 llmfit-web/src/components/DetailPanel.jsx:464 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18a292fab7bc299e4edb6e9dc1c2d0c4a9313883d972c057037aeb41839dcdc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DetailPanel (cyclomatic 39, cognitive 37): DetailPanel has cyclomatic complexity 39 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"124d557b0ef016732161411970e9b732aaa58daf1fa927f299007d39c37cfe76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SystemPanel (cyclomatic 19, cognitive 18): SystemPanel has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/SystemPanel.jsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"832012ed6604da25431e837dd74dcdd0ac84aef641c79f1985b3cd24c795731c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FilterBar (cyclomatic 17, cognitive 16): FilterBar has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/FilterBar.jsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c84996652cce9a5d0dba104e3aa734be2f95118babe7d7c5b2d42e40ed5a56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildModelsQuery (cyclomatic 16, cognitive 17): buildModelsQuery has cyclomatic complexity 16 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/api.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e1d5a653944f56eb58f4f5896b09f36cbb6172d9e6dff255e043a3950ee000"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyClientFilters (cyclomatic 15, cognitive 15): applyClientFilters has cyclomatic complexity 15 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/utils.js"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2880de3ea60699556cc776414163f644dbf299de6dd69a538defda22c3da60f7"}},{"ruleId":"R3","level":"warning","message":{"text":"llmfit-web/src/components/DetailPanel.jsx: 649 lines of code: llmfit-web/src/components/DetailPanel.jsx has 649 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/components/DetailPanel.jsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f676dfb0d64cd5127bbf3e256b1596ae52cd0d6c0dba659a9481f97860628b0f"}},{"ruleId":"R3","level":"warning","message":{"text":"llmfit-web/src/i18n/locales/en.js: 434 lines of code: llmfit-web/src/i18n/locales/en.js has 434 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/i18n/locales/en.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4021838b8887d889354f1c8918802de4ad057948b70585d6af272884a4f6f8d1"}},{"ruleId":"R3","level":"warning","message":{"text":"llmfit-web/src/i18n/locales/zh-CN.js: 431 lines of code: llmfit-web/src/i18n/locales/zh-CN.js has 431 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/i18n/locales/zh-CN.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a4c33a2dc116766af9a2c55ac5bad3ed70ff141738b9f8d460ca24331c89ac"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-desktop/ui/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8289eadbae5ba5863041e35a731c240a66a85cfb04a0ee146ccc268103d46368"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-desktop/ui/i18n.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af9b3961d6db6a9bb04d178e8b96a6f4db805f7669a0786838d9a77f2bbd5aa"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/main.jsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc6965293178b572822ef915698b8533b4b1eee55ec21410599816ce2f278fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DEFAULT_FILTERS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/api.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55532b5374ad08a0ae5d86acfc8f6e88d137bc471fe7e1992d2255b30fd61e0f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027fetchRuntimes\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/api.js"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6909abcef31198e3e01897cbc03264246e85a664737d2e3624a4ca4e04d177"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027fetchInstalled\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/api.js"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5b2eb42d51d07ca6a3a3ff914fa96d98bf7d889687b816f42f3b99208860ca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027startDownload\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/api.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f7ce2372c568a49a1ea43f959addae5c51bb82b923f1f6ec53ff50dd0069e4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027fetchDownloadStatus\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/api.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5b2320c51d661216bc6523e8b0a26a29bcc89d96fb7f9ced5d5ff6131a348a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027translateUseCase\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"llmfit-web/src/utils.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4430cf607f542fb755d4c6605de6566883087f570e17bd319e4706ad063874e"}},{"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 (llmfit-tui/src/serve_api.rs:386)."},"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 (llmfit-tui/src/serve_api.rs:386)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060controller.signal.aborted || err?.name === \u0027AbortError\u0027\u0060 appears character-identically in 2 files \u2014 llmfit-web/src/components/ConcurrencyCard.jsx, llmfit-web/src/components/StoragePanel.jsx. 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":"llmfit-web/src/components/ConcurrencyCard.jsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9406a00af09c8d997e0280813a85127accb3c8632ffc14ea1195a47c6141183"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060arch.starts_with(\u0022gpt_oss\u0022) || arch.starts_with(\u0022gptoss\u0022)\u0060 appears character-identically in 2 files \u2014 llmfit-core/src/fit.rs, llmfit-core/src/models.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":"llmfit-core/src/fit.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"2357a3f60329261e03595304f6401e36505cd76c114c91dfa9153abff3f64db1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003E 0 \u0026\u0026 !value.is_char_boundary(index)\u0060 appears character-identically in 2 files \u2014 llmfit-tui/src/tui_app.rs, llmfit-tui/src/tui_ui.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":"llmfit-tui/src/tui_app.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c0633500ce7418016779991434347c770845684f32d8a6cb525e8a684b3793"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name_lower.contains(\u0022mistral\u0022) || name_lower.contains(\u0022mixtral\u0022)\u0060 appears character-identically in 2 files \u2014 llmfit-core/src/fit.rs, llmfit-core/src/models.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":"llmfit-core/src/fit.rs"},"region":{"startLine":2566}}}],"partialFingerprints":{"codehealthFindingId/v1":"b958ceaad5ae00d93f7503473306715527dc50f439cdda29874975991fefd9b4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load_gguf_cache\u0060 returns \u0060{}\u0060 when \u0060(FileNotFoundError, json.JSONDecodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/scrape_hf_models.py"},"region":{"startLine":1859}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0d2c537f3a9a7fc7610c269bfa52a4f7c5069c345e61b65824c1d3cd49c52b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060check_gguf_repo_exists\u0060 swallows every exception into \u0060return False\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. 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 handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/scrape_hf_models.py"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee9b2c86374dd3a1bc4bad45586af3415613ac772b94654f976629143f8f362"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_load_release_date_cache\u0060 returns \u0060{}\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/scrape_hf_models.py"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8382056553b5368bacc1a0f26ed60c27e645c487767b59e5ebcae2e1f1a79ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect_nvidia_gpus_by_memory\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c91de0719b853d27d67198508890daa1e2d469db9efccb5ec3b3e5f294edf0f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect_amd_gpu_rocm_info\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a70e9c5fe1850f30f885500e1eefff6e922d06c41783ff5fca88a55ff7281b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan_amd_sysfs_cards\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"54594929987d7e246123a20ac46ba9d9ffb3d3bcfbfd16a59e441a137afc624d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect_gpu_windows_wmic_list\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88cbbb828663b61cb7cecdc3f3174ee2911f1d9f0762ba41411de3a59d0d456"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect_macos_metal_gpus\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccbc25a86f577099dc9ea2eec8bd02666ffc5b2feaf6790fca093d3bc93ee5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_macos_metal_gpus_from_system_profiler_json\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a424f9205878b8f6f2331a725ea233f24c173ca6f992e5edc47e0419c8eab737"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060search_hf_gguf\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":"llmfit-core/src/providers.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3620357cc345ff31122f9a6b12764dc28b8e6c4d7ff58746126ea21e45680041"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_repo_gguf_files\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":"llmfit-core/src/providers.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e19cb973cd1ed16174ee8c9d4f8622bd138c855ee407f7978f356b4f4bebce2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sysfs_drm_summary\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":"llmfit-core/src/doctor.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f616d9815f481f64357b47169b13d0cd6197e5e577875ede1b70010ee3eb71fe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060detect_windows_registry_vram\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":"llmfit-core/src/hardware.rs"},"region":{"startLine":3231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0064a402f38ecfe6fd447916f2c6e4718f46adf4b2b8b81b6b04df234e32096f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060docker_mr_catalog\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":"llmfit-core/src/providers.rs"},"region":{"startLine":3988}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e17f4778fe417f53db681bafc51f3cf0b36bf3754a560a4daf215a9dbace7b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_store\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":"llmfit-core/src/share.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e05ea0667dfeaec72baed876b315ce06b62c88f2608ba693e026bd9c5f958c"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060use_case.contains(\u0022text-to-speech\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060use_case.contains(\u0022text-to-speech\u0022)\u0060 also satisfies \u0060use_case.contains(\u0022speech\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":"llmfit-core/src/models.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"749819563fbc41e46234ace5ac444b86b34e6b2a3452b4057b13f33470eb42f0"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022starcoder\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022starcoder\u0022)\u0060 also satisfies \u0060lower.contains(\u0022code\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":"llmfit-core/src/update.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e7b78c8a77db2cad368cdd80ea6808b514a62d6c3179bcc5bf702d48c89722"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022coder\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022coder\u0022)\u0060 also satisfies \u0060lower.contains(\u0022code\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":"llmfit-core/src/update.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee69327a47cb179bfa767b1baf6fa195abd70c183a6b542c04e7cffa82a4a0f3"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060s.contains(\u00221.5\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060s.contains(\u00221.5\u0022)\u0060 also satisfies \u0060s.contains(\u00221\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":"llmfit-core/src/update.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0ccc83ba0a5b1d50c29408f5a893f5922c7e474b0c63dc5a479ce5abd4d1e3"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"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":67,"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."]}]}