{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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":"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":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"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":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"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":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"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":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"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":"App::move_widget_selection_logic (cyclomatic 77): App::move_widget_selection_logic has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/app.rs holds 3 of the 31 functions over the threshold \u2014 including the worst \u2014 and 161 of the 549 points over it (29%), 3.1\u00D7 the next-largest file (src/app/layout_manager.rs at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b667a7571b2c26983aec8ab7ea74c176ebe13a826d8b4137be5e144b90a23e"}},{"ruleId":"D1","level":"warning","message":{"text":"App::handle_char (cyclomatic 69): App::handle_char has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/app.rs holds 3 of the 31 functions over the threshold \u2014 including the worst \u2014 and 161 of the 549 points over it (29%), 3.1\u00D7 the next-largest file (src/app/layout_manager.rs at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"6172e75d97c47315edc200704085cebc519864f2b05f38be3c14e119b4d14c4e"}},{"ruleId":"D1","level":"warning","message":{"text":"BottomLayout::get_movement_mappings (cyclomatic 67): BottomLayout::get_movement_mappings has cyclomatic complexity 67 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 7 belong to 2 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":"src/app/layout_manager.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d736e1c152b7e9f292da0f471cb245cc4bf98b26d5df7f49c3100a0e2d982ff"}},{"ruleId":"D1","level":"warning","message":{"text":"App::on_left_mouse_up (cyclomatic 60): App::on_left_mouse_up has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/app.rs holds 3 of the 31 functions over the threshold \u2014 including the worst \u2014 and 161 of the 549 points over it (29%), 3.1\u00D7 the next-largest file (src/app/layout_manager.rs at 52). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"0198770e13581089da315fcffd60bc94ffbb323b3f293d528b5c265045bc3439"}},{"ruleId":"D1","level":"warning","message":{"text":"Painter::draw_data (cyclomatic 59): Painter::draw_data has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e4e345f66883ca91c01739deabca0704df1a59d22b82792d774fb4ee1a0665"}},{"ruleId":"D1","level":"warning","message":{"text":"Prefix::process (cyclomatic 56): Prefix::process has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7e35f58141dbb7a91656321735f2369a53b277517850dc29715876a6f28041"}},{"ruleId":"D1","level":"warning","message":{"text":"bottom::event::handle_key_event_or_break (cyclomatic 52): bottom::event::handle_key_event_or_break has cyclomatic complexity 52 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/event.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1ccceb7634d9d091c138fcc48686ce6709b2e7845e6e57ff4e773c2ce06944"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcWidgetState::new (cyclomatic 49): ProcWidgetState::new 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":"src/widgets/process_table.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c16969ebbb080623e1c3343b5ab2a82cf9790e34a1af26edcc97572c5cd2a5"}},{"ruleId":"D1","level":"warning","message":{"text":"bottom::options::init_app (cyclomatic 44): bottom::options::init_app has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ad503878cfeba60286fec483389098a14b5f0f72733adfd8f6e4e599c8f3d4"}},{"ruleId":"D1","level":"warning","message":{"text":"bottom::collection::gpu::nvidia::get_nvidia_gpu_data (cyclomatic 31): bottom::collection::gpu::nvidia::get_nvidia_gpu_data has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/nvidia.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"982cb9f13549c52a41ae3edd73bc4e75f1440ebe080de4bb87e842f1b2a98337"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcWidgetState::get_tree_data (cyclomatic 29): ProcWidgetState::get_tree_data has cyclomatic complexity 29 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf0b5bd859808fcff6a7a4fda14ed685a8942b1b3c812c6e34bd1379b73677c"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeSeriesData::add (cyclomatic 28): TimeSeriesData::add has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/data/time_series.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"50a051d25759f99fc682343ef2aef5ee8a9f747baa702effd31b28c1701822a7"}},{"ruleId":"D1","level":"warning","message":{"text":"DataTable::draw (cyclomatic 28): DataTable::draw has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/data_table/draw.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"08df27b628a1c6b904e40f91bec64e61eb79e5cf55f7dfa08986645c726e1bb2"}},{"ruleId":"D1","level":"warning","message":{"text":"Painter::draw_battery (cyclomatic 27): Painter::draw_battery has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/battery_display.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7261442c02acb2826b72fe4057fedd01449e80fad8f5498e1b0d0f19613616a6"}},{"ruleId":"D1","level":"warning","message":{"text":"bottom::start_bottom (cyclomatic 26): bottom::start_bottom has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7463fe75b16f9b65701f26ea21de57b6b8a307b8d8a62a764bb26553b4dfcb9c"}},{"ruleId":"D1","level":"warning","message":{"text":"Painter::draw_disk_io_graph (cyclomatic 25): Painter::draw_disk_io_graph has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cdb01f424108dbd2f7fbe1cb33099ebaf1c1b3e91aff9f0958f996771e5ab6"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeChart::layout (cyclomatic 22): TimeChart::layout has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/time_series/vendored.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebdeb2cc91115bec82fbc79032c1f0935d8790c040ac626a9f31ed95ceb4e1b"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeChart::render (cyclomatic 22): TimeChart::render has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/time_series/vendored.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25cdd3c96e8738b03941d5c1e271a547319239fc217227cf372aa35a569c3c2"}},{"ruleId":"D1","level":"warning","message":{"text":"LegendPosition::layout (cyclomatic 21): LegendPosition::layout has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/time_series/vendored.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f54f3a93e5206ffa11d412ac47bbf898bda13dd1ab0101945eec52e4997705"}},{"ruleId":"D1","level":"warning","message":{"text":"FileSystem::from_str (cyclomatic 21): FileSystem::from_str has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/unix/file_systems.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5cff2c040369af6865cea32656c4644a1b59d35a56fca57eb8097e9babfcfc"}},{"ruleId":"D1","level":"warning","message":{"text":"Row::convert_row_to_bottom_row (cyclomatic 21): Row::convert_row_to_bottom_row has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/layout.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8837462d599199a7054df6c5534f642293e61d04ad213f6df7cbe2766d85562"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcColumn::sort_data (cyclomatic 21): ProcColumn::sort_data has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/process_columns.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a19df36557067a59fdd25c6690867e2b0686e7d97e70cccd25f0e2fd590a33"}},{"ruleId":"D1","level":"warning","message":{"text":"bottom::create_input_thread (cyclomatic 21): bottom::create_input_thread has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"821d6d3fc7982abdb7a62e524a106f4a34de571abbfa611e86d3ced4a986204f"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessKillDialog::on_char (cyclomatic 20): ProcessKillDialog::on_char has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0525b5142acbbd0ff3175705b2cdea147e052b53062593fe298ece6f773f2e4"}},{"ruleId":"D1","level":"warning","message":{"text":"bottom::canvas::widgets::network_graph::adjust_network_data_point (cyclomatic 19): bottom::canvas::widgets::network_graph::adjust_network_data_point has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaef916643b7b3adf4dc9444ba15134a141182da9256827bef3968c3696e244f"}},{"ruleId":"D1","level":"warning","message":{"text":"bottom::collection::gpu::intel::get_intel_gpu_data (cyclomatic 18): bottom::collection::gpu::intel::get_intel_gpu_data has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/intel.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"db8aff63667a06350be9086b8c04ef88fce46ef608ce423a5eb8ea5f1f3bf13f"}},{"ruleId":"D1","level":"warning","message":{"text":"PrefixType::from_str (cyclomatic 17): PrefixType::from_str has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"22329ae5fb35d247581288daf4402ec94087058e5f8bdd655c8737347561c2e4"}},{"ruleId":"D1","level":"warning","message":{"text":"PipeGauge::render (cyclomatic 16): PipeGauge::render has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/pipe_gauge.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe1937e4da65a58f6346a7e8bc917bf82a6cbb7374f74df48eb95b2378a8710"}},{"ruleId":"D1","level":"warning","message":{"text":"UnixProcessExt::sysinfo_process_data (cyclomatic 16): UnixProcessExt::sysinfo_process_data has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/unix/process_ext.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d165c5835845348cce948377a0f202524aaf49b95d011f44044847c7ea2c76d"}},{"ruleId":"D1","level":"warning","message":{"text":"bottom::collection::disks::zfs_io_counters::zfs_io_stats (cyclomatic 16): bottom::collection::disks::zfs_io_counters::zfs_io_stats has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/zfs_io_counters.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5233ec5e42887b3611a7791cd6e010795bdba38f1b5de1d7cca8c23ceaa71acf"}},{"ruleId":"D1","level":"warning","message":{"text":"bottom::collection::temperature::linux::hwmon_temperatures (cyclomatic 16): bottom::collection::temperature::linux::hwmon_temperatures has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/temperature/linux.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"417587c9de7af26db03659e07198669271a302baef15955c9b23e91d8c42e553"}},{"ruleId":"D2","level":"warning","message":{"text":"BottomLayout::get_movement_mappings (cognitive 409): BottomLayout::get_movement_mappings has cognitive complexity 409 (threshold 15). Drivers by points: if/else 42 (288 pts), loops 18 (106 pts), boolean chains 10, match/switch 1 (5 pts) (nesting depth added 338). Of this number, 401 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"68898a5da1780bdd9c92d0a1d6dd370865f50413c3b40fbc859c49e55846a5fe"}},{"ruleId":"D2","level":"warning","message":{"text":"App::move_widget_selection_logic (cognitive 304): App::move_widget_selection_logic has cognitive complexity 304 (threshold 15). Drivers by points: if/else 44 (224 pts), match/switch 14 (68 pts), boolean chains 12 (nesting depth added 234). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfd96abce4be03cc3d26cfac1eb7d08fb4e9104d3c434845bbe2c82f10fc79f"}},{"ruleId":"D2","level":"warning","message":{"text":"Prefix::process (cognitive 235): Prefix::process has cognitive complexity 235 (threshold 15). Drivers by points: if/else 63 (206 pts), match/switch 3 (13 pts), loops 2 (11 pts), boolean chains 5 (nesting depth added 162). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"19550df97810650bcc534fc861a7f87ba369664506e23dd530793d408fe03a17"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_left_mouse_up (cognitive 159): App::on_left_mouse_up has cognitive complexity 159 (threshold 15). Drivers by points: if/else 30 (118 pts), boolean chains 18, match/switch 4 (17 pts), loops 2 (6 pts) (nesting depth added 105). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"db86bc6ac5ef0f7a4294d45dba312ec7dbeb27c58bb6fb19fa0bfbef74217593"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw_data (cognitive 93): Painter::draw_data has cognitive complexity 93 (threshold 15). Drivers by points: if/else 36 (58 pts), loops 7 (18 pts), match/switch 4 (14 pts), boolean chains 3 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2ed5eb6f6161152a14d59746328d31de803e4b7c93fc060740a3c0086b4f08"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::options::init_app (cognitive 87): bottom::options::init_app has cognitive complexity 87 (threshold 15). Drivers by points: if/else 17 (50 pts), match/switch 9 (19 pts), loops 4 (10 pts), boolean chains 8 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee192a9a273ea6b1834d85f65d464de44480eca9782e9a7d3d9df52a07af7092"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::gpu::nvidia::get_nvidia_gpu_data (cognitive 86): bottom::collection::gpu::nvidia::get_nvidia_gpu_data has cognitive complexity 86 (threshold 15). Drivers by points: if/else 25 (58 pts), loops 5 (17 pts), match/switch 3 (7 pts), boolean chains 4 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/nvidia.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb08b7cf20e9514ea451b6d35d2e83b654b021693b20224f324734522c7bc1e"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcWidgetState::get_tree_data (cognitive 80): ProcWidgetState::get_tree_data has cognitive complexity 80 (threshold 15). Drivers by points: if/else 34 (69 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 39). Of this number, 74 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ef28669607b2180817815792a9872a59db6cc2abb4ba0057811f0e12a14b45"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTable::draw (cognitive 77): DataTable::draw has cognitive complexity 77 (threshold 15). Drivers by points: if/else 26 (66 pts), boolean chains 7, loops 1 (4 pts) (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/data_table/draw.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0aaf25051bf03e589c4a25146b26234d7f380c350652cc02c97907036ea1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw_battery (cognitive 77): Painter::draw_battery has cognitive complexity 77 (threshold 15). Drivers by points: if/else 26 (63 pts), loops 2 (8 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/battery_display.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7ea61add3949cf6af0d702181411cd444d587eac31059a50bd7558997eab4f"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::start_bottom (cognitive 71): bottom::start_bottom has cognitive complexity 71 (threshold 15). Drivers by points: if/else 14 (42 pts), loops 6 (26 pts), match/switch 1 (3 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6db7bf7894013369ed72c5e12dc645977c02029bd155c78eef992547a5cadc"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeSeriesData::add (cognitive 68): TimeSeriesData::add has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (41 pts), loops 10 (25 pts), match/switch 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/data/time_series.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcea7c2ceafa7e7321dfc56ee50b7da3a1bdf4fa240b3fb3b9e9fa61ae7699b"}},{"ruleId":"D2","level":"warning","message":{"text":"Row::convert_row_to_bottom_row (cognitive 65): Row::convert_row_to_bottom_row has cognitive complexity 65 (threshold 15). Drivers by points: if/else 11 (47 pts), match/switch 3 (8 pts), loops 2 (6 pts), boolean chains 4 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/layout.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"022b929e011d7bbb0bf75427aae75f138f9543fea4c09ceb2f621c7639127dff"}},{"ruleId":"D2","level":"warning","message":{"text":"App::handle_char (cognitive 64): App::handle_char has cognitive complexity 64 (threshold 15). Drivers by points: if/else 29 (55 pts), boolean chains 8, match/switch 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"211f27de095fbc86f28806413ca1895e73e51ae2b0e88a8e82ea6e42a386f92b"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw_disk_io_graph (cognitive 63): Painter::draw_disk_io_graph has cognitive complexity 63 (threshold 15). Drivers by points: if/else 20 (41 pts), match/switch 5 (14 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c189b05123d5d388f2db7cc670a777829eab5e909e35ad7c893058b4c4c9bff1"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::disks::zfs_io_counters::zfs_io_stats (cognitive 46): bottom::collection::disks::zfs_io_counters::zfs_io_stats has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (38 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/zfs_io_counters.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a96d57ccdb826f5a288a254d14228fe3ba85155525de140ab3cfdd61803364"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::canvas::widgets::network_graph::adjust_network_data_point (cognitive 45): bottom::canvas::widgets::network_graph::adjust_network_data_point has cognitive complexity 45 (threshold 15). Drivers by points: if/else 27 (43 pts), match/switch 2 (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":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"965d07345e8bc0c99e28e007931221fe30472a4c85924c46b364b2ede6cd7bac"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::temperature::linux::hwmon_temperatures (cognitive 44): bottom::collection::temperature::linux::hwmon_temperatures has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (36 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/temperature/linux.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f945b446ac42346e0563b1bfd843d15c80a8071fab16d89f4f6c097dd0388cab"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::create_input_thread (cognitive 43): bottom::create_input_thread has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (32 pts), match/switch 2 (7 pts), boolean chains 3, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd515e13c430a3f60d0db0410128ceeb24c247870568b696a680cf5eb6b67be"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessKillDialog::on_char (cognitive 42): ProcessKillDialog::on_char has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (38 pts), boolean chains 3, match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a686aea8502cf8f5eeb3cd892566f32c3cf1a187a3ff822975d345d77d5d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcWidgetState::new (cognitive 40): ProcWidgetState::new has cognitive complexity 40 (threshold 15). Drivers by points: if/else 24 (36 pts), match/switch 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b10b9886ac37628f464cfe8a6dac5ce5f1c1097f8a52ccb5104be10c73a4d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::temperature::linux::get_hwmon_candidates (cognitive 39): bottom::collection::temperature::linux::get_hwmon_candidates has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/temperature/linux.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb79cdd1aeaf35f5793f024029dd22c7d22f0c7a5c7fa922241b0755a6e65ea"}},{"ruleId":"D2","level":"warning","message":{"text":"UnixProcessExt::sysinfo_process_data (cognitive 37): UnixProcessExt::sysinfo_process_data has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 3, 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":"src/collection/processes/unix/process_ext.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24439a4f138417ba48f168bd4d79ca54d1385920c3ca74407896ca9f035d4f1"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::linux::drm::collect_drm_fdinfo (cognitive 36): bottom::collection::linux::drm::collect_drm_fdinfo has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 3 (6 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/linux/drm.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"32169d27e38fb1e9b620380b9385c8f10f163acd0d34252a7bb22c0518f86027"}},{"ruleId":"D2","level":"warning","message":{"text":"InputFieldState::get_start_position (cognitive 35): InputFieldState::get_start_position has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/input.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"42010177fbbba6924d414e84e2a1a75ceae1e000abb9e88eac17dbe9f552a540"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeChart::render (cognitive 34): TimeChart::render has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (22 pts), loops 4 (8 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/time_series/vendored.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0224c8aedf8cc2010f2320475b84c050df7a83aca99987db33cef58c7205e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::gpu::intel::get_intel_gpu_data (cognitive 34): bottom::collection::gpu::intel::get_intel_gpu_data has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/intel.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91e30be732e5e71b38ec9e1001c7568ef7fba61fa3f0ab36480a1e4e1be53a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::help_text_lines (cognitive 33): Painter::help_text_lines has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/help_dialog.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c20807705b47097d5584578ec37c412b4f425f14d7d8672502740105b1b1f6"}},{"ruleId":"D2","level":"warning","message":{"text":"DataCollector::update_gpus (cognitive 33): DataCollector::update_gpus has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (33 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e2347cffdf9ccbdb938259c19071fe8c1aca62cfc25078358f4f592e1f2a40"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::processes::windows::sysinfo_process_data (cognitive 32): bottom::collection::processes::windows::sysinfo_process_data has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/windows.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3270b6dd4b65f2aaa7d2c1a0b9788e3fdcf590f68221f1cffbbeb1f3f13ee5a"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcWidgetState::get_normal_data (cognitive 31): ProcWidgetState::get_normal_data has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 3 (12 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb6fdb9bf8389e56d2a3e6780bb5e9b4f13388d1d9756cb62b8654e2c6746fa"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::processes::linux::linux_process_data (cognitive 31): bottom::collection::processes::linux::linux_process_data has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6ba17233e4a16d4d47b5d462747f38a58897f5ecf7f8e62c8fded2d06ccd04"}},{"ruleId":"D2","level":"warning","message":{"text":"LegendPosition::layout (cognitive 30): LegendPosition::layout has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (29 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":"src/canvas/components/time_series/vendored.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6b2f11647c0dbd8a402c0e7a003d780ada9ccc490457c789967d37c554725a"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::gpu::amd::get_amd_gpu_data (cognitive 30): bottom::collection::gpu::amd::get_amd_gpu_data has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/amd.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b61f7d362abc48de1b88d506960e4257c71e5ee1675adbf1cd08b588001288"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeChart::layout (cognitive 29): TimeChart::layout has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/time_series/vendored.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aca9f5901fe15a189aef293211c1391e41560c77991623608ee203c3ac87f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw_memory_graph (cognitive 29): Painter::draw_memory_graph has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 1 (2 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/mem_graph.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4127fce72043439260888a722658505317058e52ae4a367844ed25ae622930"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw_search_field (cognitive 28): Painter::draw_search_field has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/process_table.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd324d5654a4b5e1bff4f9c0dea1b177ea64ed165f25a560ad7e4a71b70fafb"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_char_key (cognitive 27): App::on_char_key has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"696275e45e4287bc954128f5ca1afb5fcb570d651fcd1cc3f120658171edb8bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Io::from_file (cognitive 26): Io::from_file has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (9 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/process.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3b7707612dd2a9c85aa4cd2fdd55e4d1f26e1cabf83d20cfd836b4d4397412"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw_cpu (cognitive 24): Painter::draw_cpu has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/cpu_graph.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea49c8be84c799aa04375229a5aea22b312161fb6e0e561688ac445e855ef220"}},{"ruleId":"D2","level":"warning","message":{"text":"CpuWidgetTableData::to_cell_text (cognitive 24): CpuWidgetTableData::to_cell_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (10 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/cpu_graph.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22538d52c46ab747b620f163aa79316a33cec0b8b44d1ba07f21e2f2d47b318"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_esc (cognitive 23): App::on_esc has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32ff581bb7eccc8180daa0db51e09995c97cdaac77d48139eb4d82b8aa4ea78"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::disks::zfs_io_counters::zfs_io_stats (cognitive 23): bottom::collection::disks::zfs_io_counters::zfs_io_stats has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/zfs_io_counters.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc0c7154478622b3a94d1a8961ca66ad6c3049aa261534cec1a0dbc22739cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw_basic_cpu (cognitive 22): Painter::draw_basic_cpu has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/cpu_basic.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56e1d15b62104119e104e3851b0e64f44ac7f949a3770e6c9d3f495980274e2"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::processes::linux::read_proc (cognitive 22): bottom::collection::processes::linux::read_proc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b2b8694f195c1d4585460a3fdf737e53b4986c0510a776f5f1eb6fedd28a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::temperature::linux::add_thermal_zone_temperatures (cognitive 22): bottom::collection::temperature::linux::add_thermal_zone_temperatures has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/temperature/linux.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"506464df0a5b5bc87f949ae68535ae3f5db39012102939d4d5a74c13562ebc79"}},{"ruleId":"D2","level":"warning","message":{"text":"App::skip_to_last (cognitive 21): App::skip_to_last has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1774}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4935ff3490cfc751c9bae549eee473adead13e4ee28bc78e153af31144f95d"}},{"ruleId":"D2","level":"warning","message":{"text":"FileSystem::from_str (cognitive 21): FileSystem::from_str has cognitive complexity 21 (threshold 15). Drivers by points: if/else 21. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/unix/file_systems.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fa7b311e9a69dde366a3a4d09aa131b47e031c2b331ef2b31c5362144aa9fc"}},{"ruleId":"D2","level":"warning","message":{"text":"DataCollector::update_batteries (cognitive 21): DataCollector::update_batteries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"8164e675e9306ab98718e4b5792433caf548e884d8feca77ef1a6a346edd455e"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::temperature::linux::finalize_name (cognitive 21): bottom::collection::temperature::linux::finalize_name has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 5 (10 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/temperature/linux.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"8529c1031b29fa982a15e124027588247e3796aafa971de87469955113d20066"}},{"ruleId":"D2","level":"warning","message":{"text":"App::skip_to_first (cognitive 20): App::skip_to_first has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c3cbbc6e2b1ab16d39bb752b263b998214f99d73c8bef2abc4511dacee6477"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw_network_graph (cognitive 20): Painter::draw_network_graph has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"df632dcedab25b87752a815375c23d0faecf09e9283164245fecf61b65b2a32e"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::event::handle_key_event_or_break (cognitive 20): bottom::event::handle_key_event_or_break has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 6 (9 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/event.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6e76d071b8d4283cf8efc3da4ec5c723766e79f48b1befe7f2f58230a497e2"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessKillDialog::on_enter (cognitive 19): ProcessKillDialog::on_enter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 1 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e27b7ee2b2c9ea72775d780b7aed0a851563551c89abd1f5d7d8e8134f648f"}},{"ruleId":"D2","level":"warning","message":{"text":"DataCollector::refresh_sysinfo_data (cognitive 19): DataCollector::refresh_sysinfo_data has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"691ffbcb09231e9265cec8d2f6d0b5f0e1314c29cab08b5e3f7a295d8107f8da"}},{"ruleId":"D2","level":"warning","message":{"text":"DataCollector::update_memory_usage (cognitive 19): DataCollector::update_memory_usage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (19 pts) (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4121edc5539454f7c62f3ce7985f9bef05824e7f55c3ff23a1a35aa23e6c8e4"}},{"ruleId":"D2","level":"warning","message":{"text":"PipeGauge::render (cognitive 18): PipeGauge::render has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 4 (5 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/pipe_gauge.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5a897a87d65e25e0bac23efbead9e3a9249cb203d9d8602cc7cef2bde6acd5"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessKillDialog::draw_selecting (cognitive 18): ProcessKillDialog::draw_selecting has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (2 pts), match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc7223444025c11f117026e08aaf3cc1abe3f5c5d066b5ff17f38f35402e138"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw_basic_table_arrows (cognitive 18): Painter::draw_basic_table_arrows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (18 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/widget_carousel.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"094a2d3b5d9c37fac76ec5f585bc34e62cb372d850a17eea77f051eb13ff6be0"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw_help_dialog (cognitive 18): Painter::draw_help_dialog has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/help_dialog.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b68f84738c672fe4a65af7cd3edd43f6b3095e3ead4eae174c251398bbd13c"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::create_collection_thread (cognitive 17): bottom::create_collection_thread has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"866f43e16ddafc558a000d98c223f5bcf8a1214deb41aa101100bc59609b74e3"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::canvas::widgets::battery_display::long_time (cognitive 17): bottom::canvas::widgets::battery_display::long_time has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (17 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/battery_display.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"a550dfd80fa88aaed182899721dce08aa673c74a41723f15c9cefb11281896eb"}},{"ruleId":"D2","level":"warning","message":{"text":"InnerData::eat_disks (cognitive 16): InnerData::eat_disks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/data/store.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"98674f7ce3f65bb571fe2141ea3261372ea4bf1fea8f22e86ea2314a983e1410"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_left_key (cognitive 16): App::on_left_key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (App::on_right_key) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5723b1a699618aabdb8db3a9595dd3540c92573e6cb844dc6ea6bf7f9bff2b"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_right_key (cognitive 16): App::on_right_key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (App::on_left_key) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e807c4a113dcceb1890a5c69968eab6cc43717d3e9b389c723b94e9be35be9"}},{"ruleId":"D2","level":"warning","message":{"text":"PrefixType::from_str (cognitive 16): PrefixType::from_str has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f78f292d9bd7cc4b235c88c0dd1c86c4113dea24a3b402db8dbe7f5d5f74258"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::collection::disks::unix::get_disk_usage (cognitive 16): bottom::collection::disks::unix::get_disk_usage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/unix.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0882a39fab13a7ed2ec6436ba65fcb2cd1720b132762d03277d4d4054fc8e817"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::options::get_default_widget_and_count (cognitive 16): bottom::options::get_default_widget_and_count has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4a79af3e5822f01a1998786980383fb7042b3aca040c3807820e1e8e3e564e"}},{"ruleId":"D2","level":"warning","message":{"text":"bottom::widgets::process_table::query::parse_query (cognitive 16): bottom::widgets::process_table::query::parse_query has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3, boolean chains 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"065c4869484b1d95baf372c54cc212b3ad0848a53ac86cf3ddf469ff113ee6db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bottom::options::init_app: FunctionTooLong \u2014 bottom::options::init_app runs 443 significant 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 343 over it, 4.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"38651cea9986a708d14a1b34b99d6f81f278f40a3330cfbab05eac48361f2a4e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 1506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 70 methods, 2 blocks, lines 106-2391. The bar is 400 significant lines; this is 1106 over it, 3.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fe97cf8e0a9914df6c22382f66c4cefbddf617eae0e4214e14896143b33ba2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BottomLayout.get_movement_mappings: MethodTooLong \u2014 get_movement_mappings runs 328 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 228 over it, 3.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e693ad6f880861105e9f848ad229de1c75928f3e7af645a0aad9c030665f86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 1592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: App (2 blocks, 106-2391). The bar is 500 significant lines; this is 1092 over it, 3.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c754c8bbeb53a8a563bd91426dec0339aaa4fa0a965a2eaafe8f2c58777e0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Painter.draw_data: MethodTooLong \u2014 draw_data runs 255 significant 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 155 over it, 2.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d153f92e35f9abb6a4363ad9f2bfa369bdce7be697cf5dea43828c73eb75ae02"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd02129916eafd53227758b70cc4135e52b4ccabe7574217004568a79b42d819"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.move_widget_selection_logic: MethodTooLong \u2014 move_widget_selection_logic runs 218 significant 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 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d966cdc37f207e49a1aa2e7e952b327237e466158e399dabdafdf8d02428af7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/options.rs: FileTooLong \u2014 1005 significant 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 505 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb50c811e029f36383333faca969a9321a9d9574cdeb0e10cb507955096895a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Prefix.process: MethodTooLong \u2014 process 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":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8945dec9a09196592761e1836831e36986d7fc615b38aa5ea3277c6dd3ddf491"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Painter.draw_basic_network: MethodTooLong \u2014 draw_basic_network runs 192 significant 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 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_basic.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d44d6e179686cb4cfef981d18389cc9c09595865a51e9a5a9a62f1918693fba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProcWidgetState.get_tree_data: MethodTooLong \u2014 get_tree_data runs 185 significant 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 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9cab616e54373e6e09d96f90f1925b1d0028bc8a0c9987917f5ea54d1cfd16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.handle_char: MethodTooLong \u2014 handle_char runs 174 significant 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 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f0bbedfdb34714adbf1cb0884c17031210466f77763ef9b5950f0b8917f4ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.on_left_mouse_up: MethodTooLong \u2014 on_left_mouse_up runs 174 significant 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 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"624104eb1302e7e8b0c9b2c5d831133f487f3903833373640cb8ec2428feb498"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Painter.draw_battery: MethodTooLong \u2014 draw_battery 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":"src/canvas/widgets/battery_display.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb523f82c566f7c9e15ab06caad7a3ddc2c48b5bef5d7e546d51ecebb71cdcc8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AppConfigFields: TooManyFields \u2014 47 stored fields. The bar is 30 stored fields; this is 17 over it, 1.57\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d11fc7a38e99cf6757fa0fab81b1d50ab322c4379142c4c8a178fd39c39821"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProcWidgetState: ClassTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 27 methods, 2 blocks, lines 209-1165. The bar is 400 significant lines; this is 212 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfeff103279c224a4c52dede7bde5d65fe8aa5cb5cf2f5b3c6dd7f9f84b8acc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/process_table.rs: FileTooLong \u2014 760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: ProcWidgetState (2 blocks, 209-1165). The bar is 500 significant lines; this is 260 over it, 1.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5bfc977d57f298eec1f4f642400b0001082d1512b932297b2c316793863d28"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GeneralConfig: TooManyFields \u2014 44 stored fields. The bar is 30 stored fields; this is 14 over it, 1.47\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/flags.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b629f6715a9809a1c61c8550cef8084c98f4fbd807734e507c32d7a1897246"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/layout_manager.rs: FileTooLong \u2014 725 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 63% of them inside a single declaration: BottomLayout (2 blocks, 19-707). The bar is 500 significant lines; this is 225 over it, 1.45\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdc7b6ab62722456fea359e8ce5eb83c07d6f42cf5604a64f52c95946f89f8a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Painter.draw_disk_io_graph: MethodTooLong \u2014 draw_disk_io_graph runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96a2d2d87b66dfb8b194dfcab6e110f2aed6b425b63b1ca66897b667572872e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProcWidgetState.new: MethodTooLong \u2014 new runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"329bf917186c34129d8037bf0a3067b65c157177ab57d8bec4de7e18cc8a9cdf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTable.draw: MethodTooLong \u2014 draw runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/data_table/draw.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"202ab1b4bbcc9329c3b929d66d68b958e41b9fed8e4483ae7f8d9984ee026fed"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: extern_proc: TooManyFields \u2014 41 stored fields. The bar is 30 stored fields; this is 11 over it, 1.37\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/macos/sysctl_bindings.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1398054ff0c1a5d40c231fbb0366a19232380e2bd49aef82d48ab03e8e7d9ecc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bottom::canvas::widgets::network_graph::adjust_network_data_point: FunctionTooLong \u2014 bottom::canvas::widgets::network_graph::adjust_network_data_point runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f665213639c3610af7d86730e0dbdfd314a05cd9ba042395e3e9d236a7ad6a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BottomLayout.init_basic_default: MethodTooLong \u2014 init_basic_default 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":"src/app/layout_manager.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"20afe396f6e8276d50f35bad0904a78827cb974084d2a67f1cd0f68d45e18cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Painter.draw_network_graph: MethodTooLong \u2014 draw_network_graph 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":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1c784c58d7451f18e606a357c0b0fcba09d23c0a36fca39a911606704a0f8c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProcessKillDialog.draw_selecting: MethodTooLong \u2014 draw_selecting runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef6e6c044d2ad9934d92b4bac0d3196d3972ec1e14fce0c43b616e952ca7b20"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bottom::collection::gpu::nvidia::get_nvidia_gpu_data: FunctionTooLong \u2014 bottom::collection::gpu::nvidia::get_nvidia_gpu_data runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/nvidia.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab931e385b2f25521e65b887993e527a8bcbc8df0fb973ac1e14526b804be6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: bottom::collection::processes::linux::read_proc: FunctionTooLong \u2014 bottom::collection::processes::linux::read_proc runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3344c650b1874844a5ba81d5cd28d3b31d96eb2f9c179fc96274ae083a0451"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BottomLayout: ClassTooLong \u2014 456 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods, 2 blocks, lines 19-707. The bar is 400 significant lines; this is 56 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ab2f3f1af5950a2281fe4e22adbb329e90a69ec5578f8df5b5598fc9d88fb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dialogs/process_kill_dialog.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: ProcessKillDialog (2 blocks, 213-915). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d90452701bc6dd51f780e282515f7909362eb545f325520fa7e6254f8d5e61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: time_series/vendored.rs: FileTooLong \u2014 547 significant 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 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/time_series/vendored.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c361d75720d3b56d2594447b31f17351f95440b629fcca25ceb8e3b94b937461"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProcessKillDialog: ClassTooLong \u2014 428 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 2 blocks, lines 213-915. The bar is 400 significant lines; this is 28 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dc4c2342b71adeace183b5b866c358613611683f47c4f8ddff34130a2173f7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Styles: TooManyFields \u2014 32 stored fields beside 9 methods. 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":"src/options/config/style.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9235471edc84a0bc50a01a793aad5ba1cba7fb83fb97f2f204d77ed36e95e89c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Painter.draw_help_dialog: MethodTooLong \u2014 draw_help_dialog runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/help_dialog.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8af660028d35f4ba622a8b0db769ad3f249805e9a3752b889f8bf7e5f56006"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Painter.draw_memory_graph: MethodTooLong \u2014 draw_memory_graph runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/mem_graph.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"398eb56ea62eba07f8bcf88d75302f0cdda2ea9e53a9e6293c99ff49ef4d309f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: options/args.rs: FileTooLong \u2014 529 significant 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 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64ed30d7ee48b5763ab276662a7b0a71be3f460de0e75017ffd5a627d4c93a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Row.convert_row_to_bottom_row: MethodTooLong \u2014 convert_row_to_bottom_row runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/layout.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"143e644a2234435aa86b577e16a676d7cd4d1233f56adc80697a99be1ad2c4e5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Painter.draw_basic_memory: MethodTooLong \u2014 draw_basic_memory runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/mem_basic.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc541d3d24743f7a60d1a802a24364a99b28804b3996fc1de401b8b74fca1a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PipeGauge.render: MethodTooLong \u2014 render runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/pipe_gauge.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"270fb2b3744cee7c8e8fcce685b79cd2cd6dcd471ce11cc71f78618504d295d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (36 shared lines): src/collection/gpu/amd.rs:151-263 | src/collection/gpu/intel.rs:174-290 \u2014 These two members are variants of one another: 36 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/amd.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af272cfe12fd03578b8d95cf2acddfa243424a7f4194dfe9ccda5fedef956c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/canvas/widgets/disk_io_graph.rs:29-244 | src/canvas/widgets/mem_basic.rs:46-194 | src/canvas/widgets/mem_graph.rs:59-217 | src/canvas/widgets/network_graph.rs:28-56 | src/canvas/widgets/temperature_graph.rs:21-108 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"62556a37fc174345e63c1c2a319c302611aac226d682ad4b10caeb05bab1abce"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/app.rs:737-755 | src/app.rs:757-776 | src/app.rs:778-795 | src/app.rs:797-814 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b022be89000ffe91a9359bee491113d79ec2314b7993b33199c2317456ee29"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/canvas/widgets/disk_io_graph.rs:29-244 | src/canvas/widgets/mem_graph.rs:59-217 | src/canvas/widgets/network_graph.rs:60-230 | src/canvas/widgets/temperature_graph.rs:21-108 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b625d2abaf0baadd97d199c9c21040ff8cbcc2f024ab1e78070a9e0b3fdf58d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): src/app/layout_manager.rs:387-421 | src/app/layout_manager.rs:502-536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67307759bb14d37f61bfccd7abef2afd991ccccc9ef7039141a51bdfcca08cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/app/layout_manager.rs:360-384 | src/app/layout_manager.rs:474-499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"240f9669130e6e33ba46d262d68c4b9d0a7043e21eec8f9b979e7a7e4978f73e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/app/layout_manager.rs:322-346 | src/app/layout_manager.rs:440-464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"66771f2929ce41dcc1ffcfd107d9432b03fa54007195656e9388f64deb09df72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201325 lines \u00D7 2): src/collection/processes/unix/process_ext.rs:89-113 | src/collection/processes/windows.rs:62-82 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/unix/process_ext.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ce1620aca31559f0eb1f3785bd02f73e75ceb137c134aba400a7d643c77ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/app/layout_manager.rs:225-248 | src/app/layout_manager.rs:268-291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"00418f0c0a98b9e85e255ddc5d7eb0a4c96eb4304b7d777ae6e2df7ff16e896f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): src/app.rs:1432-1452 | src/app.rs:1505-1523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9438b3071a6d5c56513b6a29f396e04cf61c4ae20c979a98a0c4d4b448f08fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/app.rs:1474-1490 | src/app.rs:1542-1559 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c84650802a54014d874ef21aa3e180a52f4fa398fff33cb84f1ed38073c22e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): src/canvas/dialogs/process_kill_dialog.rs:725-741 | src/canvas/dialogs/process_kill_dialog.rs:801-813 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5ea7a72a2be6b3d687fda906df491e74499595e6ed41eaba1d2efe90e86fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/options/config/layout.rs:79-94 | src/options/config/layout.rs:136-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/layout.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e663d242cd1cc0b0bf9eae0afd30ce0f29fb9ce038530b24c298d65d03e6519"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/app.rs:821-836 | src/app.rs:845-860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"75676c5b18ecde94584b58ce2fbfe22c22ba934914456c6191ff9528d7ae1b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/canvas/components/time_series/vendored.rs:867-881 | src/canvas/components/time_series/vendored.rs:886-900 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/time_series/vendored.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac6abddd18337b2c1dd3d9542639c193516ecbb5a108a459345b324b0dd4b30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/collection/disks/other.rs:7-21 | src/collection/disks/windows.rs:29-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/other.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00fe5b0a93f192b13e8a7d1f79234119eb707160380ed7b48145af7355bbc91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/collection/gpu/amd.rs:243-257 | src/collection/gpu/intel.rs:270-284 \u2014 before extracting anything, compare \u0060src/collection/gpu/amd.rs\u0060 and \u0060src/collection/gpu/intel.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/amd.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"44587f593c411b0dd88e2adc8fab41bc96a5d578def89fa03f41c56c4531aca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/collection/gpu/amd.rs:227-240 | src/collection/gpu/intel.rs:254-267 \u2014 before extracting anything, compare \u0060src/collection/gpu/amd.rs\u0060 and \u0060src/collection/gpu/intel.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/amd.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"95de555f0f0289d1f4a361c18694cb69293b95534f506d14b10dd52b5ed26a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/collection/gpu/nvidia.rs:262-274 | src/collection/gpu/nvidia.rs:278-290 | src/collection/gpu/nvidia.rs:293-305 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/nvidia.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7014e1a12741541c83a46d696103ab2979fff2854eed0e9d467dd6326c5285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/app/layout_manager.rs:581-593 | src/app/layout_manager.rs:638-650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2d09fb2134f0d93987b3179ac5a0abe1953b06b17972026e68b7de5925d4e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/canvas/dialogs/process_kill_dialog.rs:526-538 | src/canvas/dialogs/process_kill_dialog.rs:545-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2067fd7d508c7184cc3bd038f951badb9be9d734849a8fdb311aa4c1b9d743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/app/layout_manager.rs:558-569 | src/app/layout_manager.rs:617-628 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"f524f7827a204cb931c5ea0bcabf1d5c9ab48504474d6f5f2581e7e79972d7e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/canvas/components/data_table/draw.rs:329-338 | src/canvas/widgets/battery_display.rs:253-264 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/data_table/draw.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"537456368bcc438b4446dec86fe8ec6340010d8e7398a7ff6a2e01c6d169e559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/canvas/widgets/mem_graph.rs:206-217 | src/canvas/widgets/network_graph.rs:46-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/mem_graph.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be6d0bea0c38b21dd6183ae4bcadcd49af74b3dca0377c0e83c53a41fd1e000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/canvas/widgets/network_graph.rs:68-79 | src/canvas/widgets/temperature_graph.rs:29-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6841608bd90df108229ca63554300680c1a50193d931f74ecb29b8feb237fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/canvas/widgets/disk_io_graph.rs:267-277 | src/canvas/widgets/disk_io_graph.rs:288-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"78807389775cbf38cf08f67bfaaa010fed29a664687c571026a219237feec7b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/collection/disks/unix/linux/partition.rs:158-167 | src/collection/disks/unix/linux/partition.rs:184-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/unix/linux/partition.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fd35753a334d9b3aa41155bd127ce7c8074abfbb2e802ac77edaa70d21fb9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/collection/temperature/linux.rs:278-288 | src/collection/temperature/linux.rs:293-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/temperature/linux.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa890ef4bc000d54346b22be6e9faec65bfc6f8aa47f5f42743eb680ad480ac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/app.rs:261-270 | src/app.rs:503-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"77eaf15e04225bf5eee322fbc5dfe23111c74e965c71ada6322db9297b1e077d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/app.rs:743-752 | src/app.rs:783-792 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"101f73fed9686a00e2d730f8b6633645640f2514dec4dba9a4f5790457e8eacd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/app.rs:764-773 | src/app.rs:802-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"d353c7dc66b08db9e7f1f08698999494752f2894f809118a2eddfe9136b5dcfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/app.rs:744-752 | src/app.rs:765-773 | src/app.rs:784-792 | src/app.rs:803-811 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0aa0157d3980803827b924bf775818674654c3e4ad990d122553455ad9d3332"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/canvas/widgets/disk_io_graph.rs:233-241 | src/canvas/widgets/temperature_graph.rs:96-105 \u2014 before extracting anything, compare \u0060src/canvas/widgets/disk_io_graph.rs\u0060 and \u0060src/canvas/widgets/temperature_graph.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec7116c7ce810365db759578979db83c2f4e64b1dad728bb5bda9d4d4777590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/canvas/widgets/network_graph.rs:104-112 | src/canvas/widgets/network_graph.rs:236-244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccaf8030972698705441a324f8db7841ec0d0fa0e79d898d460035a02890ab6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/app/layout_manager.rs:571-578 | src/app/layout_manager.rs:629-635 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"8605f3413fb046d025c2493a91f38579f1251b3792f842285a4847e1411ac3fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): src/canvas/components/data_table/draw.rs:320-325 | src/canvas/widgets/battery_display.rs:242-249 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/data_table/draw.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"36647dfe13bb42fc67d64f312accdb27c3534346a5e0f185009c65b30149130a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/canvas/dialogs/process_kill_dialog.rs:563-570 | src/canvas/dialogs/process_kill_dialog.rs:576-583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadb662962e037b30aed74f60eca64803efc65c4de3ef5d43d45bc15c24a2da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/collection.rs:460-467 | src/collection.rs:473-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1225eeec61cd6365491396303ecd5a77048128f5a5eb9a703eff5712882634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/collection/processes/unix/process_ext.rs:79-86 | src/collection/processes/windows.rs:52-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/unix/process_ext.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e39972e43cd14b44d194a658004897fb04345116bdca73fadfde5fd014a76a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/canvas/widgets/disk_io_graph.rs:237-243 | src/canvas/widgets/mem_basic.rs:187-193 | src/canvas/widgets/temperature_graph.rs:101-107 \u2014 before extracting anything, compare \u0060src/canvas/widgets/disk_io_graph.rs\u0060 and \u0060src/canvas/widgets/temperature_graph.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdc85f01873b36d12e6f1374981a1e313cdadca05f3673fb8e6437e1fa9c0b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/app.rs:1663-1670 | src/app.rs:1701-1707 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f82d0e36f3a314eff572277e28dbeb3e11d9ce33e1c2903883d8ac84e29080b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/app/layout_manager.rs:599-605 | src/app/layout_manager.rs:650-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"518f692fc7a842eb7d4c518a9c7e57bc16ec8304e23e26a8cecf69c868b660a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/collection/gpu/amd.rs:188-194 | src/collection/gpu/intel.rs:240-246 \u2014 before extracting anything, compare \u0060src/collection/gpu/amd.rs\u0060 and \u0060src/collection/gpu/intel.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/amd.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e281940d914e0fddb2c93475c3def80a6ed531d48f2268b45ba32ef92c354377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/canvas/widgets/disk_io_graph.rs:240-244 | src/canvas/widgets/mem_basic.rs:190-194 | src/canvas/widgets/mem_graph.rs:212-216 | src/canvas/widgets/network_graph.rs:51-55 | src/canvas/widgets/temperature_graph.rs:104-108 \u2014 before extracting anything, compare \u0060src/canvas/widgets/disk_io_graph.rs\u0060 and \u0060src/canvas/widgets/temperature_graph.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58b97534ff08bf10e46002902111539bfc69aab5ab78c92249dd0ab39519da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/canvas/widgets/network_graph.rs:267-271 | src/canvas/widgets/network_graph.rs:278-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc1d797cc08755d576309616319b88288ea00dc82b054c138f222d370659750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/canvas/widgets/disk_io_graph.rs:213-224 | src/canvas/widgets/mem_graph.rs:185-196 | src/canvas/widgets/network_graph.rs:207-218 | src/canvas/widgets/temperature_graph.rs:76-87 \u2014 before extracting anything, compare \u0060src/canvas/widgets/disk_io_graph.rs\u0060 and \u0060src/canvas/widgets/temperature_graph.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da393b6d45ed3931102cb61990923ac16f7ad4ae40b3c3d2918d6f79d39e99a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/canvas/widgets/disk_io_graph.rs:176-186 | src/canvas/widgets/disk_io_graph.rs:191-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab600853ad901414a4fd237b240b9a6de0fd66feecc3aa1ccc0cedb1a4da63bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/canvas/widgets/mem_basic.rs:105-114 | src/canvas/widgets/mem_basic.rs:124-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/mem_basic.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"309bbc07b23837d0e98cddf36d49e747134656169cc4959bd1317d71b27d40bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/canvas/widgets/network_graph.rs:166-174 | src/canvas/widgets/network_graph.rs:179-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"977243131043d899bf4404c4eacb01de15b7662e83276b1c5d3fcb02242b0684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/canvas/widgets/mem_basic.rs:88-96 | src/canvas/widgets/mem_basic.rs:105-114 | src/canvas/widgets/mem_basic.rs:124-133 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/mem_basic.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d1a1e8a77d0e48e63841105c9a8cc47e211425b01fa076ef24b03e21369d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/canvas/widgets/battery_display.rs:181-187 | src/canvas/widgets/battery_display.rs:193-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/battery_display.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d1a8c0afdc1ed8e25eee5bae49ec81ccc0fc4d952d41c30698af7c6bb604e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/collection/linux/cgroups.rs:135-139 | src/collection/linux/cgroups.rs:149-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/linux/cgroups.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"992cc348b2050c6bff31d5a04a4ed6a47bdc86c5ecc70ac35f5e0d5f605a23c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/options/config/style/utils.rs:25-29 | src/options/config/style/utils.rs:32-36 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/style/utils.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"92522267a124a239458873f7104cd9e15ffcd82ac05b8ff2015b0fb279fb241d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/options.rs: src/options.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in bottom::options::init_app at line 282. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-05..2026-10-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-05 18:48:43 \u002B09:00\u0027 --until=\u00272026-10-03 18:48:43 \u002B09:00\u0027 --full-history --no-merges -- src/options.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85d64d73dba3dc42467a7e77a6e96f4317073e64393faaad3831a248fb43d5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/widgets/process_table.rs: src/widgets/process_table.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ProcWidgetState::new at line 282. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-05..2026-10-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-05 18:48:43 \u002B09:00\u0027 --until=\u00272026-10-03 18:48:43 \u002B09:00\u0027 --full-history --no-merges -- src/widgets/process_table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85ed4f4877e0e8ff5b4a8aca6d4d272f5b267d53dd93393dd23f28ed81b5e7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/collection/gpu/nvidia.rs: src/collection/gpu/nvidia.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in bottom::collection::gpu::nvidia::get_nvidia_gpu_data at line 146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-05..2026-10-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-05 18:48:43 \u002B09:00\u0027 --until=\u00272026-10-03 18:48:43 \u002B09:00\u0027 --full-history --no-merges -- src/collection/gpu/nvidia.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/nvidia.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba08e9441cef975dafb2c478a88ff591ae65d004fbe85b8ad991fa685810820"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/widgets/process_table/process_columns.rs: src/widgets/process_table/process_columns.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ProcColumn::sort_data at line 129. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-05..2026-10-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-05 18:48:43 \u002B09:00\u0027 --until=\u00272026-10-03 18:48:43 \u002B09:00\u0027 --full-history --no-merges -- src/widgets/process_table/process_columns.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/process_columns.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a877c35b34dcaf2b231324a4f4c1bd4e0f299c54a25ac61f470d839146bfd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/widgets/process_table/process_data.rs: src/widgets/process_table/process_data.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ProcWidgetData::to_cell_text at line 361. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-05..2026-10-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-05 18:48:43 \u002B09:00\u0027 --until=\u00272026-10-03 18:48:43 \u002B09:00\u0027 --full-history --no-merges -- src/widgets/process_table/process_data.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/process_data.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8126a198c02b07584d89a49f464c5c5f349e5ad823e2e4d65e731b475179b34c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/canvas/widgets/battery_display.rs: src/canvas/widgets/battery_display.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in Painter::draw_battery at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-05..2026-10-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-05 18:48:43 \u002B09:00\u0027 --until=\u00272026-10-03 18:48:43 \u002B09:00\u0027 --full-history --no-merges -- src/canvas/widgets/battery_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":"src/canvas/widgets/battery_display.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaff22dd59b6f840fa5fd6fda88c9df28c9a785babbec2c4a4c000153e395b8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/canvas/components/pipe_gauge.rs: src/canvas/components/pipe_gauge.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in PipeGauge::render at line 138. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-05..2026-10-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-05 18:48:43 \u002B09:00\u0027 --until=\u00272026-10-03 18:48:43 \u002B09:00\u0027 --full-history --no-merges -- src/canvas/components/pipe_gauge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/pipe_gauge.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b3a35fd78af7baec5a2bce6cf4034e2368fa7fbbb9de3a5f23de1ca6e178c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/collection/temperature/linux.rs: src/collection/temperature/linux.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in bottom::collection::temperature::linux::hwmon_temperatures at line 206. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-07-05..2026-10-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-05 18:48:43 \u002B09:00\u0027 --until=\u00272026-10-03 18:48:43 \u002B09:00\u0027 --full-history --no-merges -- src/collection/temperature/linux.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/temperature/linux.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2850358be250e75d90698f0f947cc4ca37621bc61d412761ad0a53c9181f67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test basic mode \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/layout_movement_tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd199db9ee548cce9edc22feead3c07838597ed2e6f57e307111da9fddc97d85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test moving around with procs and their hidden children. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/layout_movement_tests.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c20d0fadc163c37da2b6f961e0d2819d0fe6761daaa6475f7f300978367bba1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test moving around with cpus if they get hidden. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/layout_movement_tests.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb603181a163384a8d2854e81d3f798367cd090bf129470e51832a35c60e0ac7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Clean this up, we probably don\u0027t need to have this duplicated. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67c1df5c32dee825cf856864a9fdcf4f2e5de28717cecd1667ff854b0f6f84d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Unify this in CPU options \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b39e6e1ea6910dd9241f977d2eaac007b9af9985deda4f35a235aa439bae300"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove these, move network details state-side. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b08cbcbd27b28c3fc3b24fa09fc1403d622c1e5a8f8f2d625c302592fb3d2e3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: (points_rework_v1) maybe separate PR but would it make more \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b46a8875f15c166c00c16f3b2ec221f016df07812d8dd7b2b463e5b2bb13086d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this suck less... should just make it so that calling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"26936181f0fdee2cc282a397140b0ac63b8a304aa00f87c9b153c0fb6653ac7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is really hacky, but is fine until we do some smarter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"498188b21030168c299abe82a8357266b755af489faf0a0df2f2c112b55e4aa0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This ideally gets abstracted out into a separate widget. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c2dfba0271349c58517c24f96c9bac9f4d31acf9c3b6815807e9f108c674a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I don\u0027t think most of this is needed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12851905b5420e3921a46e41ae123f746fd38e79e20f8b8732f4e7e14047095"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Refactor this system... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2f27ace098b9f97829b282c4af6798984f12ca52153892f852d65103766903"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [BASIC] Expansion in basic mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeb4fc4cc084fa628dc17eb6944d6780f2e69fd0f80c8d4e65efdec9669aff0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could I remove this clone w/ static references? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b48191280a8003c65f5c9cb17959d17aebf2366b1e962469629ac25f638327b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [REFACTOR] might want to refactor this, it\u0027s really ugly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa29be34ec6ce98ddb1c5b7b8e397736b48bcdb2ff097335670d9073f7d02963"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [REFACTOR] Might wanna refactor ALL state things in general, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc835e94efe849c7e2fdea46736a81666a16cf5547485d7ff1cbaa4148c23e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [MOUSE] double click functionality...?  We would do this above \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"da50243a5e703567ec98c313d385d834bfcd83cb20ebc6e06c3831b99ea913cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [Feature] This could sort if you \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":2221}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c9dd842273e944f43ed786c13648926403bb8804b31e7bdb08aea84798d233"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove built-in cache? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"33df4178561f895732d3427427d668c054efa897ba41d84f83440f881eaf8669"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should probably remove this or make it done elsewhere, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"214f050b13cd5c051789eb0e61808395831e3bb6b1afdd222d34f766772c0b64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make drawing dialog generic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae96d0603f19cee0f4a2f399d648df1a999a1ff0841f8c714c2006015b564ad"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: For width, just limit to a max size or full width. For \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacedf06425fee306263ff180ed1e6ed85da6df4e5bea03acfd3a042bb84de33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Rename this to intake? Collection? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a145a730228e727c5e46de5ec7132b367d39c1fc466fc50af8bcbba301769a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We can possibly reuse an internal buffer for this to reduce allocs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2d95e77826bdc4454e7f9b777b73f31e14d4faf8e5a65eee0fcef7d262420b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: separate refresh steps and update steps \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"6053ccd8e4d5319e9849465294a61ebf50d41a0cc474f535bd0068f90beb991f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //! FIXME: Move these to where it makes more sense. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/constants.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cb608825b76a29bd4c52f8217d88316e3bce024688db8ce96a4fc5a6340a30"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO [Help]: Move to using tables for easier formatting? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/constants.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a9e4e584ffa0948a51768280020eacf1049eb7b2f1e5dd2d9605130ede5045"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add temp graph help section. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/constants.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"30483272d24ffc95acb5add97d4a6b8b90b0a59560336d0c152e0e51505f5f88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually deprecate this, or grab from a file. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/constants.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"447675e5de42d771facbcd8406f27d3b3409018a79a07aae4462ce318158edbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/constants.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"db32044a40f7ff71a7b66dd4ffd4cb5933bc5472221815a8feb4ad7ccd1c169a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Might be cleaner in the future to use a cancellation token, but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f991f1ef26e867ab6a2bf59c23e4bd43ca8d093b7d57b8ce4bb5c3979e8e01c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Might want to debounce this in the future, or \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"43eb7c58a2b2326218d0f4a392d264d08804f704221cd26a91469fd68c9306e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider using signal-hook (https://github.com/vorner/signal-hook) to handle"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cb7d3677ab6d96981df18827440146ec27ff07281d789b743071ec0716fd08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe move the cancellation token to the ctrl-c handler? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb08165a216ff6eecc2d146ff99c082f948af493a3a99caffbc55a686c182402"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Break this apart or do something a bit smarter. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"06062265ae875177470ce2d791803766fbd7551599bd793947540e7ae7031e2e"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: /// XXX: For macOS, we additionally will manually check \u0060$XDG_CONFIG_HOME\u0060 as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e30ea90eaee82645d4ff3347907473d804080a186b3c336720bc8e01309169"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: For now, just print a message to stderr indicating this. In \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"681f2515abdb4f69048b91dd03d9caac0c2c3d540442c998c7f95af5e0237369"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we be using an indexmap? Or maybe allow dupes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb6807bf2dfd07bc2b473afb02aa4a12fa0b3fb956b43f849e48b3fd9543842"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can probably just reuse the options struct. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc9faa62f1bbc1dc768079a58de2c4ef0b85a609b1d5785059060a0a0254457"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is kind of a hack that we have these cases at all. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5ab667568b290f8e64740b049ca0398d147875a2de0c0572968281871b1705"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Move this so it\u0027s dynamic in the app itself and automatically hide \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"968f4677e74f240308f08b089be5b7a4b20371f1e77903ea6e23bdd2f8ed0fb4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There\u0027s probably a better way to create clap options AND unify \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"68148e6186c91e1eadf4d8c75cc96065bb2752f83e64f91ed88d057a830e5e68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should this be possible? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/cpu_graph.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"35186e73cea48f96dd528a95b51e03368ededd0a61e4d2863810b36a936c94f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove this field, carry it through the widget configuration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/disk_table.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56a40fa5d42c0d4049ddc7cb515f8d266f099345b0bb3567401a1a90dea250b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: (points_rework_v1) Can we change the return type to \u0027a instead of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/disk_table.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"39598268cb615a1a1a3e07615740b122e58db553038754bf3fa04886197bdb09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Flatten AppSearchState as it\u0027s been generalized further. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb769090698334770caca24e81acc17db115f3dcc80d3633654f27d6b9e7155"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Maybe debounce this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3596c0c27689545dcd6c63af1879beee6b95a22997466a3e61eac8200428c96e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Change this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/process_columns.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7931c3e97877327fbbb926edeec038760855b6734ce8d6af2106804db3e627"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Change this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/process_columns.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b776a3347b3d5bd740bc3291a37fba6385ef3dd34f14aba28a56d06a4c8e8a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Is there a better way here to keep the to_lowercase? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/process_columns.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c77149bcd0b56cf52025110066fc600849556a38aeb693a07c343174d26f84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Optimize the string allocations here... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/process_data.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"84697197775723a6fe091e82b9483264784f2c7d00a025f74400c7ce5f9a9454"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Also maybe just pull in the to_string call but add a variable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/process_data.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"837962640c56e892bfc99ef148aa3c2405c0be10792cc9d280f00800e382a282"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Push this into a struct so I don\u0027t have to throw the options around so \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a44e83c2fe86c36184bc1d74e68d4f7fd4e890dbf5ac784c7906fd09db4616f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Didn\u0027t add mem_bytes, total_read, and total_write \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c03697962e81506017a55a6ef1ed37d6680b60e3c768a9714e79a332640529"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add a \u0060name\u0060 keyword alias so something like \u0060name = blah\u0060 is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfd9a1d171b6bac1443ed1b35a1f2306328f9c3dfe3e61f5eb941a226fe971c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add this after fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaf96a02392e537f106efc27de45962aaad235d3cd29b9a19fd089b0c178756"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // /// TODO: Should these be invalid...? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb848657fea36a07c102b46e3e22b83d804f255750a0570991d9ad906c73689"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test all attribute keywords (e.g. cpu, mem, etc.) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa545ad4ab8a3152a301f4121cdbd6db67083613b6c3010650f881d800d39efa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support \u0027bytes\u0027 or similar \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"808fd21654119cca963711fae3e90ef05a51339a06ceb7b27ef8a38aa4bb9e99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe don\u0027t need to box rhs? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/and.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a165ee33f5709d1cf22d181d57e18d155a5f7e52a999ad4c8e0e04aae5b53b00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe don\u0027t need to box rhs? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/or.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed60d87407ca5e7928cf406291e89b707fc3eb5a7aaf763566ae7e54a8efebd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It\u0027s a bit silly for some of these, like nice/priority, where it\u0027s casted to an \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/attribute.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"91174991fccda2dbba12a3b08d896a6e0ad3d2ed2e8b8c29e98a15dc1cbc56e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Also support reading with \u0022not\u0022. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6162cab56b1ebd8bf7793f7722d0d42bcb7ccdd4e810c985241a458cefb4622c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I think this should consume the quote...? Might need to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fad0d83cf8cdacffdb110ced50c8df7801ca16810cbd2b1d329f10f2c96a44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is there a better way to do this than converting it? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a12b5e4d5295b4b3c8440a82f64b39c4cd92b6e93ce3ae206440cb09624c470"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Separate these cases here and below. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a193b1acb55593c59d9e2f8f2f9f2d245a8e57a3c208530782a9c40a8e298b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [Query] Need to consider the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"078b8c265f8dc9f14a1449370d747380a1652bac6d8f6831fe0cb0c65e343552"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Jeez, what the heck did I write here... add \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faf601acfe83282d17d93815691e4ff695d9267506a7dcbb1b92c2a3b286b48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support this without spaces? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"453bd12c2a5264cbc8d0e90ed8ac63598e0c967d3cfb0ce449dfddb9a8f97190"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Give more information here (e.g. closest query?), though this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/query/prefix.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bca68706cfeb6312dea4d408ddb8e9a741da578e62abb9c4c354c2637495cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This is kinda weird, we might want to decouple this in some way \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/input.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"62903540eaedc90693f82bbe7f214a0381358e6894f61a29d4b9778f46b487d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This might be a bit expensive, maybe we could update this a bit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/input.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c388b3850a2a3d30261a613e2b9fbdad3a8f8b69b034f6160c2202d2ba42415c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Maybe cache results from this function for some cases? e.g. columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/utils/strings.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43401ee056efaadf49a0a8a0d43983796690a38ed47b2e503d416c29737afe4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: New sections are misaligned! See if we can get that fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/args.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b27b0f53c5481605ad7f984703a4f5d87c5394cecfab16471c12d29b5172168"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Charts are broken in the manpage \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/args.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"465d617c59122f50d1e48b9f8a4daf66e57d61d3268734b49f42471330728346"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Change this to accept a string with the type of marker. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/args.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad400a2df47397b653f534d542645271747340116e28c9e19e625a662330a54e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rename this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/args.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5bab5f3cda80c753989213ab5dc118cd3ef43b1a72a40a3ff8f8457fb5933c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe rename this or fix this? Should this apply to all \u0022left legends\u0022? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/args.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"532b66b7b1dcc86886a6c2902cd0f79378341bad8b9bf63f970e63ba9926e056"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Rename some of these to remove the network prefix for serde. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/args.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"7717c2db2a01faf83f2417f45870ae12a677af55e49cef5bc0679335a7d10dfb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this more composable(?) in the future, we might need to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/disk.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e02767c0499837a375e9a087a76c877974d0a991426844b823729b25bbab9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Break this up. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/flags.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fedb5990541c24482bc7221fbd81e2dcb55111242d95d0dcc60864b7658ab2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Deprecate these in the future. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/flags.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ca47de674f22580012884fba9b7502e06ba08eb152de3aa698afed76b3927e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deprecate and/or rename, current name sounds awful. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/ignore_list.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d999b9eb2548bd9623caf700aaf4f30c9583ba84d296123f68ab6a8f1c617876"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In the future we want to also add percentages. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/layout.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed709b05ea366b5f0c078e67bd93e063614bb9aad94fa7a04ddfa42ff06dfe0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We probably want to make this an enum...? If we want to also support external legends \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/memory_graph.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"701c16ac09820dcb4b73001fffacf17da357232b6988848c87dd1cf7547777bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We probably want to make this an enum...? If we want to also support external legends \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/config/network_graph.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"7112ffa191a88db2fafd6b2e0318c9b33e75e4df28745296bb0e9cf588300e2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe unify all these? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b334ae97195c3a0ceba949acd6d0025e6baf19d2fd871f0ba33c505d908746"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe rewrite this to not do a result of vec of result... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5671e69dc08b02a4023500afef0d972cb89c4f1834ba5b30692f246de8eda499"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Maybe calculate this on usage? Store the total mem along with the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"278445fd1504875f4310d2e1cd8137efaf0884abaf579583c713534cb2ecb8a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Maybe calculate this on usage? Store the total GPU mem along with \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbc94d16e6766b762039dc136edb7dcf4ae99c058bbf9a0099f7bcc3e777a3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Additional fields \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad2eb2b643d0a980bc0a4ac067757227176e8487888dd194603a333d7b276a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It\u0027s possible we may want to move the filter check \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/temperature/linux.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05eee8a148708215fcc3d456d271f24ad8847ae73aaa9d833c0c7626745615d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we instead use a hashmap -\u003E vec to skip dupes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/temperature/sysinfo.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"098f37ffb38554ef5c592048b8bd9ba09152283b3cbbdaf5291779520ba7a301"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: There\u0027s a lot of shared code with this and the unix impl. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/windows.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9edbcf5e62047c0f16719a2f0ffea737e56a75df2c6df5270ac42ec43dad820"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe return an option instead? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/windows.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3345c21dc7510625ede79aff807ba7ca84fb75bbec7838e2a08354edc0ed416"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Translate this to Windows priority names? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/windows.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b8c215670e224605b84ea749b27ddf9e1dfe5a836c4254599def6188d6619"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Based on https://github.com/GuillaumeGomez/sysinfo/blob/baa46efb46d82f21b773088603720262f4a34646/src/unix/freebsd/process.rs#L13?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/unix/process_ext.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51eab076686298b101075966078f59bb2e82e861e369430de95942556c8a80c"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: /// Exit information. XXX \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/macos/sysctl_bindings.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f779613ae572848166a6ef28e8f7c6cb11fb6a033632ca114faeaf9b4b565d89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should these return errors instead? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"33349d49e2606cf2dedd1c2c1d2a4d5795cc02edb8e5ae52c55a30c3bade3ff1"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: This can fail if permission is denied. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"628808e2c2768dcaccd011d644aab91265f8a8912369e54aa8be13b1eda654b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We might want to re-evaluate if we want to do it like \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9062a091050bc4061484feb8e62589083830c09b9c71a49e77c04ec1e37bad0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [PROC THREADS] Add threads \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53c25be70a0bf3eb80410aaf60ed959e09bdaed9deb9992fab44b66cf88ca91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could maybe use a double buffer hashmap to avoid allocating this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9dc9dfa9e99a0a078eeaa3e2b6c2d88e42b1ec6579b12ec7c74bcca61fb2fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe pre-allocate these buffers in the future w/ routine cleanup. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1424d18326f342e18d7b028bcff8179f2c45887cc7541cd4bbeb811891a02e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This might be more efficient to just separate threads into their \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6674586016774ad6cd1fa1fb5b4d561f2f8076ab017db0d571906133869558"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is this needed? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/process.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f24e4fcb65ab0f9c1e068a805086764d4e2b23813ffd64274b439d6fbd15610"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Eventually make it so that this thing also takes individual usage into \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/network/sysinfo.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"766ec4c289e49f73f52c94fb9aa0ab70d288e8fb1b1883fa28949bbd217c0721"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [OPT] is this efficient? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/memory/arc.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7793a85bc2d70b13b65d5158d8e0aa0661450d2ad7312c6fea2919b37c9c4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe check if this is worth it for the files we read. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/linux/cgroups.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f40c874f0f61f0e4ecf5c5357ebc14946b0c2420df9afada663d318c4a2b73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: May be able to clean up some of these, Option\u003CVec\u003E for example is a bit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/amd.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"200cd555b3e6b41a2ac30ca628a4f6bd51f4f5418a2d34a934b7cf006e613413"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: May be able to clean up some of these, Option\u003CVec\u003E for example is a bit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/intel.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f5f9db195d0b92e843c97b530fad5670d2581946b3441fee828c268210a2e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is kind of a hack. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/amd.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"013eae5b009c040d6d5eca475a6a2ee223599f42d786ce9beff8b7d7e487a046"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is kind of a hack. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/intel.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad5ff1962a831a09dffa948ad5e8dcb0b198fc48ce2d98205ca6f54f37dfd30"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add caching for this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/amd.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdd54ff27de27c3649996638ad70a8d0407e32b3fb3cbb1cff6ab40a22c8d9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add caching for this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/intel.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fb279af37cf7df7530a3bfb07962518df61224e6ea8378a293f754def61a5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Investigate this properly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/intel.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee371d44fd4d484d10c7c64b5e6eea03ad7bfe12de1eb7c57d9b012ecaa022c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not yet implemented. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/intel.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc15d5efb2ffa51c2e50ccbd495cdae6c6dd751607e962ecac589b04a7240237"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally we don\u0027t have to shell out to a new program. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/freebsd.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"590be0fe5b76ebadbf6ba1d6d676c0d6d6a70b13afbe9ae8bbb6c419dbf121a6"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: // XXX: Re: Conform check being disabled. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/unix/macos/counters.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0541989c39809b08bda2d41b264738fae9e84b4e82de0a06e23179a600a27a59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This might be unoptimal. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/unix/linux/partition.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"73985aa7fd21b2d9bb6297b16715b2583cf7a4429e4d7c023be6436f1d9a72fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Switch to pipe_gauge. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/battery_display.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bfd7e23ea505aa752e63a2054092526eb798d45a7cafc0266973f9a0c15067"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is pretty ugly. Is there a better way of doing it? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/cpu_basic.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc321202f9dfc236a4725e9b85d947d005b43d0a131ebeb47cd0d0b2f5afe670"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // the all entry. TODO: Do this a bit better (e.g. we \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/cpu_graph.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932bb83e9a8aa1ec279bec6aec63bea5db132477e8680021946283f126065e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe hide load avg if too long? Or maybe the CPU part. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/cpu_graph.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8d4b7e7330be03255f508e5c4d04cb66848be597816be7d94f6f83a70b52b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This line (and the one above, see caller) is pretty dumb \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/cpu_graph.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4177eb3fab26d4a334034c8d92aefad2e31eda3cd9ee8d1a3d0c31d18a865d32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Bug with this, shouldn\u0027t be selected on expand! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/cpu_graph.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"820d3f653e1f7e4fcba4e4b694f114effddf228766f2000999460eb23bc44b65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe should make it so the colour is based on entry name? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa20c6b0c3e56b09af3fe8eae96c9dc1866f228d4b9c16357f3131e08bdaeed8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Combine into one line; probably need to add some kind \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/disk_io_graph.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9372467ac0d8f7802a464c5068f93e1d33d561cf72633153999db16ee16d52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: is this optimization really needed...? This just \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/mem_graph.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadf2f71d929954768e7432c0117ad7232efa913fce90a865780861c0ec2e784"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add a \u0022no data\u0022 option here/to time graph if there is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/mem_graph.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"647dcc56ade00c7f0e6ed1ad744eaaf59f0371026f2bbe7292159854e76e4998"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Figure out how to line this up better \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/mem_graph.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"768a5e162f6cd4bdc25955bb26756c4b9905dfa48f933c08125c385fe1decfd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Stylize packet stuff later with something else? Or maybe \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_basic.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcf7af620844e7f19b203bf620a17f63383419ef083a3373047859d0187a9d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add support for clicking on legend to only show that value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f4505bb284476de40e490870d3163ba9ce630d5d9110c7bf3bbba78f32b592"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: I\u0027m not really a huge fan of this - I think it may be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f4ebcade2ce0ac4fad8cfe5d635094433363a501d8e16444a16b953a1650c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I might change this behaviour later. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"272fa223b922b61556496ad08f760285abc722ab57670f2e50b7e18e04978498"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: This is _really_ ugly... also there might be a bug with certain \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/network_graph.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"72227d1a96e3bed62ccf0ae769c16475d1377798a0e1b7eeffdb34ed005da331"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [CURSOR] blinking cursor? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/process_table.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3e7b4f60fa6baa7f3024fe0bb607eef1fdeb2c7b7f6031aacdc2c6be6b039f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [MOUSE] Mouse support for these in search \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/process_table.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d902083820be36f7edbf3c6ef35ff2a7964d0578be21f66eaac6afc986632ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [MOVEMENT] Movement support for these in search \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/process_table.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fd2907af7688db3a7f05bed9a04a9a8fadad53d6d9fb319246ca75c1e44084"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe align the value later. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/widgets/temperature_graph.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb4f779d9b26a6dbf113406e763c8dbad84369100cecba1b4143db749a77742"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: [REFACTOR] Make generic dialog boxes to build off of instead? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/help_dialog.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c613d7d51d3c229e4dc3b05caea2a1c07b3148c2f4bb12259453d858dd15964"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We can reduce lines processed based on the known height. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/help_dialog.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f4da7f026e954d6291f4d5bb61ecdb11522b86be8e0d0b376e4cf9be42e08c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Not sure if we need this. We can probably handle this better \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"8102296ecc611c8ddb799c45c43db4ef2b0e63a7eb79377bbc085c8a5438df65"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add some colour to this! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac70c1e61386cd0edc1b69f5c6dcfb1ff026d933ac9e52458b88c1bcd9387f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add some colour to this! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/dialogs/process_kill_dialog.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4b588b8df40a6c5059a091673ec5af83d8d5227881143279ae7bfc9404853b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: We already do all the text width checks - can we skip the underlying \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/data_table.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fb43e9dd8e2641251de0f39835eed4dbdef5847e918c4871cc6348f322bf22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0022[\u0022 and \u0022]\u0022 don\u0027t look that great with block bars. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/pipe_gauge.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f191f296762a4edb6d53cf30bc8c0a608e2e9c00514f08baee3228fd071bc50c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I can do this text effect as just a border now! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/widget_carousel.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9149a7619620d1f187b9249318a024234669b0b5e28897a7115d562fa47e68a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: We may be able to get rid of this intermediary data structure. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/time_series/base.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"332fe9de3fae0e9c9d9f0fe3fc0bad5c59ab451128afdcca694df0fa0b937e36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: (points_rework_v1) can we reduce allocations in the underlying \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/time_series/base.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"34af2f6b22b0005442350222aed86a26660cb218478f2532f0c60b0439062981"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Control how many y-axis labels are rendered based on height. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/time_series/vendored.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1696d47f44c59062d2203a3a48b91228ccd89def264a239797f2a9e63395fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Doing it this way is fine, but it could be done \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/data_table/draw.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa9d858da1a5022375e19e33aee6ebe8a08419218efe0978ca48e539fccf992"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: I think I can get away with removing the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/data_table/sortable.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b817ec87c305ed55d297ab8b8168a49af0b15fc2e56f129f9b6506cd2ddd397b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // size... TODO: Or should we instead truncate but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/canvas/components/data_table/sortable.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2228f1537e659d8166ab669da501492e4471d254b549ba6a05157b85abfaf6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Move this out maybe? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/filter.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d93b15ab8e3cd8a13413e577fe3e69354fc07814915e5128d4f789469f5f30"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe change to \u0022ignore_matches\u0022? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/filter.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9a4ca8238596c6215a1e6bc801ce9dd65336037eb84985c9fc6649e8751180"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: This is kinda gross. Ideally optimize out the hard-coded stuff. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"03700457b74afd856672ca41576fce17b4867876e1d81201a5c5a2b9edb046c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Replace this with just an Option\u003CRect\u003E for top \u002B bottom. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e8c257dee8661f6d92ba8e2941132e035ebd92520ea4337338a11cb26ec22f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: REMOVE THIS LATER. This is temporary code to bridge the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a3e246b4b47d02705a8b199cb49ea9113d480775b3c6921c701832c8b8e9ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: REMOVE THIS LATER. This is temporary code to bridge the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/layout_manager.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc70a2d5ef9e814096b70bf63321c346a0b14dc9664565b8d14d2ce4a5a48486"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// The query. TODO: Merge this as one enum. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/states.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff7b8eff7c9a9078d867526554d384cab56df64ab5440f3a7dbed47acb3c7a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Maybe reduce visibility of internal data, make it only accessible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/data/store.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c58927488d3ecf6622433abe301331050b189b6d472fe353e240b58c1187a0a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: (points_rework_v1) we could be able to remove this with some more refactoring. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/data/store.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"723c55593afbc52ed527dcadf39a5d1324bd62cbe42f69b0e27cb702aae607fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: (points_rework_v1) Might be a better way to do this without having \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/data/store.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"01537acac3b0ecdfc6f6c149469b72ba33fb5a208333364b5ce73e7df46be6d6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Can remove this later once https://github.com/rust-lang/rust-clippy/pull/17681 lands in stable?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/data/store.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4c36e03b30998e3fc5df9a462ef4259acdb81adee83eee2fe7d591dbef4f1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We probably want to also add some cleanup after a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/data/store.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e50cc305b460f6cc4b73cae9c6e02cbc91012024295565305d49dc2ead57c7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: (points_rework_v1) Either store millisecond-level only or offsets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/data/time_series.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a22683b55aa9fcba2ec25a1dc643c828d12d743ed2b2ad290369427f45efc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Maybe make this use TypedTemperature? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/data/time_series.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3474d76e26999955f216bc55d2605aecf7c11aaa187a3a5627d9b2deda1b433"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove newlines in descriptions? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/schema_gen/src/main.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"97353bffbe08589bf34f23e000d2695afea1e8d02bb2d7426b15664d371ccf4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Maybe make this case insensitive? See https://stackoverflow.com/a/68639341"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/schema_gen/src/main.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4261d1ab3054283d1296abb4e5a615b20ebb1c8211a9146505dc41f44f0dac91"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 4 project(s) overshoot their size bounds, lowering Project Cohesion to 5.0/10. The most over is \u0060(repository root)\u0060 (33907 LoC, 240 module-visible types across 38 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e60ea02a74371a23d96d938f68febc54d0c01801159e9d8d4662f1ad8d0e410d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"d0f0afa75776579c96701538ac429bfb31755e301f38b92cd901b54799ba72c2"},"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":"1bbc311300c85340f558c40059b73f208fcc4e0fd1e18bcfc9bdbf6558a59945"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"caba2108b34c574a07be39946bf23d4354c593757ae9414ecf152a624f0dc6ac"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bd809db854703f47076cbf521e9e8f676733596aa99acc767b7000f52f9a1e46"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"068adc4ac3868ff66a1673926166761cd9f2ee71eb363c3c9a8ab19bb4a34432"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ee2c00a0474a6dda953ae756e6c7916b032800ade6578fc273a32bc94289899"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"257c550793eb08300021172f852a7f566cf10990fa13ef9fdd2ade403ac2245e"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"63bea608fd98974a5a312ed989a52706c988bfdbb0e401f0928bf7ee4f23d1b9"},"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":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 97 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (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; 97 of the 168 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: src/collection/disks/zfs_io_counters.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/zfs_io_counters.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"161ebe16efecf3f39d108281e53958dcbd15aaef5a3eebb693c966cf510ef7b1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: freebsd.rs \u2194 macos.rs: \u0060src/collection/processes/freebsd.rs\u0060 and \u0060src/collection/processes/macos.rs\u0060 change together 90% of the time (9 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00603545a318\u0060 refactor: run nightly format (#2033); \u00608353f15a\u0060 refactor: effectively vendor nohash (#2019); \u006094af05ee\u0060 refactor: use rustc-hash and nohash (#1902) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/freebsd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b7c7b08d11dae278c465d139cef55969d1f2a7e6b2c00b15bfaa5e1645ce05"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: temperature_table.rs \u2192 cpu_graph.rs, disk_table.rs, process_table.rs: \u0060src/widgets/temperature_table.rs\u0060 changes together with 3 other files \u2014 \u0060src/widgets/cpu_graph.rs\u0060, \u0060src/widgets/disk_table.rs\u0060, \u0060src/widgets/process_table.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/temperature_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7107da4407b147893a62ae767ba3729dae44d74d25889b0989131d949e23347b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: constants.rs \u2194 flags.rs: \u0060src/constants.rs\u0060 and \u0060src/options/config/flags.rs\u0060 change together 64% of the time (9 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060a0c96cfd\u0060 other: clean up config file migrations (#2065); \u006089991459\u0060 other: migrate over process config fields to \u0060[processes]\u0060 (#2063); \u0060edc295e3\u0060 other: partial migration of network/memory config options from flags \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/constants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd762d78d11e22ac4314f6279de1411075e688d0eb054147cf2f625bc88cda7e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: args.rs \u2194 flags.rs: \u0060src/options/args.rs\u0060 and \u0060src/options/config/flags.rs\u0060 change together 64% of the time (9 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006089991459\u0060 other: migrate over process config fields to \u0060[processes]\u0060 (#2063); \u0060ae425d09\u0060 feature: add new \u0060table_gap\u0060 option with a drawn-line option (#2039); \u006042ee4c79\u0060 feat: add packet size \u0026 packet rate (#1980) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options/args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"851028ba7a1d75b31109da95f1a52199bfc98316387b9842ea9537b394f19ed7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: amd.rs \u2194 nvidia.rs: \u0060src/collection/gpu/amd.rs\u0060 and \u0060src/collection/gpu/nvidia.rs\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006086179169\u0060 feature: initial Intel GPU support to get process usage (#2239); \u0060fe79718e\u0060 refactor: move GPU collection files around (#2231); \u006030fb02c1\u0060 refactor: move Linux DRM-related collection code into its own file (#\u2026 (at that commit the files were still \u0060src/collection/amd.rs\u0060 and \u0060src/collection/nvidia.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/amd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72d3f2f2c3d7d51b30c0c099ce4e89d656995e9d662bf1718fc546bfad69bcd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: windows.rs \u2192 freebsd.rs, mod.rs, macos.rs: \u0060src/collection/processes/windows.rs\u0060 changes together with 3 other files \u2014 \u0060src/collection/processes/freebsd.rs\u0060, \u0060src/collection/processes/linux/mod.rs\u0060, \u0060src/collection/processes/macos.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/windows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fac4b62e0bc3ec8410efc3c400db9076a86304ae58af905cb34c241d54e34d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 process_ext.rs: \u0060src/collection/processes/linux/mod.rs\u0060 and \u0060src/collection/processes/unix/process_ext.rs\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060102ae6b2\u0060 feat: Added priority and nice as columns in process view (#1881); \u006094af05ee\u0060 refactor: use rustc-hash and nohash (#1902); \u0060e4b814fd\u0060 refactor: optimize username cloning for Unix processes (#1816) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57f00ee9c9aa92303df8672a85a37a89c98c6bcf6dc3ad80af524359feae4f7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: app.rs \u2194 drawing_utils.rs: \u0060src/app.rs\u0060 and \u0060src/canvas/drawing_utils.rs\u0060 change together 52% of the time (15 of the 29 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u006000afd660\u0060 refactor: share implementation for pecentage-based time graphs (#1736); \u0060dbda1ee5\u0060 refactor: more data conversion cleanup (#1653); \u00603b577411\u0060 bug: fix search scrolling with wider Unicode characters. (#938) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"887c40e874578f49144c60d8d5312013a55c1786eda8e288312b52444de33b9f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: process_columns.rs \u2194 query.rs: \u0060src/widgets/process_table/process_columns.rs\u0060 and \u0060src/widgets/process_table/query.rs\u0060 change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060102ae6b2\u0060 feat: Added priority and nice as columns in process view (#1881); \u0060e4b814fd\u0060 refactor: optimize username cloning for Unix processes (#1816); \u00604d935bdd\u0060 feature: support virtual memory column for processes (#1767) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/widgets/process_table/process_columns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5c28eb35d95fb631500f798a1d2ad2482413b9d9e4cdfd89c7383d4c6fd4f1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: constants.rs \u2194 process.rs: \u0060src/constants.rs\u0060 and \u0060src/options/config/process.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006095b60c80\u0060 feature: add configurable default column sort order (#2174); \u006089991459\u0060 other: migrate over process config fields to \u0060[processes]\u0060 (#2063); \u00601888dbb2\u0060 feature: configurable default sort column for the process widget (#2053) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/constants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c497df415a4de64be0cd6fd19df7af7c675751810cd399af16d4cfd87e1f1a04"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759dca709f1a032fb6f624ce672e6afb5558fce53ecf01fb73618c4d33923164"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4496de62601bd43cbd054c683a48362b4db6cc1de5f87d1b8e842c22770bdb45"},"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","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":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060use_current_cpu_total \u0026\u0026 cpu_usage \u003E 0.0\u0060 appears character-identically in 2 files \u2014 src/collection/processes/unix/process_ext.rs, src/collection/processes/windows.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/unix/process_ext.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3346d3ceaf7a2320e38ca22d4eb5b85ff5c1a446524a876839ba0c886ee09a8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_device_name\u0060 turns every \u0060Err\u0060 into \u0060\u0022Name Unavailable\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/unix/linux/partition.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3489a6e46cae84a97e1f43a965587d676254030f2304b706e6c72a1370228f9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060unmounted_disks\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/disks/unix/linux/unmounted.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54fdb2a6fca1c8130ef711b14c8882c823db164ac4fd66b85e54a3cd1d97e0a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_active_pci_bus_ids\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/gpu/nvidia.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34e17fd57c7f843a6972dfe30e0998953022ff1d97355824e3f23ee511b4c60"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060threads\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/collection/processes/linux/process.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"686dc0a35d235b4245ca2ffe8eeedc67564139f55fd5217d58f73d3407ad4256"}}],"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-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-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-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-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-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-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":15,"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."]}]}