{"$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":"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED1","name":"Handler temporal coupling","shortDescription":{"text":"Handler temporal coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/ED1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"App::key (cyclomatic 181): App::key has cyclomatic complexity 181 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":2956}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0fa38d94ad82c0fd98d2cb247827dcae8fb36c751fc67f4c9baf07c1b519cd"}},{"ruleId":"D1","level":"warning","message":{"text":"App::answered (cyclomatic 96): App::answered has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":4339}}}],"partialFingerprints":{"codehealthFindingId/v1":"124cb31906b550f91002e3923eef6ec5ba37163c54c7b2802a09ff54c38a0e9b"}},{"ruleId":"D1","level":"warning","message":{"text":"App::home_key (cyclomatic 79): App::home_key has cyclomatic complexity 79 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_keys.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b579eb50990ced72f972a7dd9d41abc924d0dab03c95165e2e7b402e5191073"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::field (cyclomatic 78): Reader::field has cyclomatic complexity 78 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f03f88bb751b51653372c56fa6ffa894f68e7af59553478cadd7cc4f641d89a"}},{"ruleId":"D1","level":"warning","message":{"text":"App::home_event (cyclomatic 70): App::home_event has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"579cb267a23046245d3ced2849b9ad6c3f4d448ea45079c2b9c6678e7f0b4b0e"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::records (cyclomatic 64): Reader::records has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"27127d5fa4f070c5fdf341bef1dae511b08b36015089ab156d0801d318310352"}},{"ruleId":"D1","level":"warning","message":{"text":"App::quality_key (cyclomatic 63): App::quality_key has cyclomatic complexity 63 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_keys.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"243ba91558dcb8aaae17c662c11af9b61cdaca7888bbe9c7788c807c2ad52a68"}},{"ruleId":"D1","level":"warning","message":{"text":"App::analysis_key (cyclomatic 62): App::analysis_key has cyclomatic complexity 62 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_keys.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61036d71c399e6477e288d495e55618fed22f712d33294cc201e1f6ffd84721"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::query::tokenize (cyclomatic 56): datui_lib::query::tokenize has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"227ad2bf655f94a35281766b0d97a41299af34beaed2493da4ee2f33fed843ff"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::chart::panel_lines (cyclomatic 53): datui_lib::widgets::chart::panel_lines has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ae5e298821c0bbeccf12f8f89bd706473490ef22a75c538526343d6d7d7c50"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::query::parse_nodes (cyclomatic 52): datui_lib::query::parse_nodes has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Op::python (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b69b563ff02109690f4f3651af26f4cf54e11a4843328e27c38246bcd204c28"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::delimited (cyclomatic 51): Reader::delimited has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ca857884a1ef01e0003d6daec5ccb776fe96ff0e5add530ed01f370eaaccab"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::midi::add_file (cyclomatic 51): datui_lib::formats::midi::add_file has cyclomatic complexity 51 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa547dd057e37608321c8d4be11e59f70f76efbf5cf26b6940021169b4ca221"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::ulog::index (cyclomatic 51): datui_lib::formats::ulog::index has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/ulog.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7736c3cc0d9f18c1d3add787419d67b4d179477a8cdf402dfbe739ce6476e5"}},{"ruleId":"D1","level":"warning","message":{"text":"App::hex_key (cyclomatic 47): App::hex_key has cyclomatic complexity 47 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/hex_keys.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07b25732584ed9bee5723b720f95850f5421e8874cb7c41e04a9e0275fd4f2f"}},{"ruleId":"D1","level":"warning","message":{"text":"App::background_failed (cyclomatic 47): App::background_failed has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":4849}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c91a111deed24946eb8bf7356e029bc3444c34637c0bfefb084e640ab64cf13"}},{"ruleId":"D1","level":"warning","message":{"text":"App::build_local_lazyframe (cyclomatic 47): App::build_local_lazyframe has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":3080}}}],"partialFingerprints":{"codehealthFindingId/v1":"2271dbe6a6a08e44e80b431166fa78cbb963fbe8c32f9d42d0b80c2c2bcb6ffc"}},{"ruleId":"D1","level":"warning","message":{"text":"DataTable::render (cyclomatic 46): DataTable::render has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f8dfbf6f930eed6f0caf4c0e98d9c5543f82ceb53094fdc20e8949f87f460c"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::app::run::run_impl (cyclomatic 44): datui_lib::app::run::run_impl has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/run.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7194ab8c88820412b44513f32c2b22830fadf1ae0bda331fc6388e219b4a94e"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::chart::chart_export::draw_plot (cyclomatic 44): datui_lib::chart::chart_export::draw_plot has cyclomatic complexity 44 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21c92c734eac250686d72b76111126d7f7937ab04f1fc91f751c54a59b940ce"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::dbc::parse (cyclomatic 44): datui_lib::formats::dbc::parse has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dbc.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"425cf155fb7453430f10b507c6634d0b2346f91f879677a272ff021eb5b64809"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::main_view::data_quality_control_keys (cyclomatic 44): datui_lib::render::main_view::data_quality_control_keys has cyclomatic complexity 44 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b1ba794b6469fc5bc811c4bf6fb7422a2e32a3d972ffb260f005e447369d49"}},{"ruleId":"D1","level":"warning","message":{"text":"FramedRecords::build_index (cyclomatic 43): FramedRecords::build_index has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec469fa54fbf1115804e53200bd2341d60d2f50b739d4f6b7341fd6b27705537"}},{"ruleId":"D1","level":"warning","message":{"text":"App::dispatch_event (cyclomatic 43): App::dispatch_event has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":3672}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9249524ef86d3a66003fe11bcd3b7918644c8b9e2279e635b608fc9f13f85a"}},{"ruleId":"D1","level":"warning","message":{"text":"Spec::parse (cyclomatic 42): Spec::parse has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/matching.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8c295092e8e7dce45e94d6d817ab0e9230871e6e3ab275d50f93b9a2991449"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::fixed_records::decode_values (cyclomatic 42): datui_lib::formats::fixed_records::decode_values has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fixed_records.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"39384c2d8cde662133ff2b6dcd85d7ccf6bf3cba51a81bcf6e1b0c932ef01450"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::analysis::quality_export::to_markdown (cyclomatic 41): datui_lib::analysis::quality_export::to_markdown has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_export.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75382da0548589377335043cd1058d628c497fb720c0ce81b3eed489559c592"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::query::apply_accessor (cyclomatic 41): datui_lib::query::apply_accessor has cyclomatic complexity 41 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Op::python (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a73fe6bf54afabd28b4e61f83382582a16574019a39324ff99302a448ff4543"}},{"ruleId":"D1","level":"warning","message":{"text":"App::quality_setup_key (cyclomatic 39): App::quality_setup_key has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_setup_keys.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b04db3406a8c33fc352220427aa709e965c1f8f3f45901938f5aef8930a5af6"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::chart::render_xy_chart (cyclomatic 39): datui_lib::widgets::chart::render_xy_chart has cyclomatic complexity 39 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c3c8a8e151b546962615dfce0cac6004f8b3690f496c6c401fb8fdfb5746e5"}},{"ruleId":"D1","level":"warning","message":{"text":"App::spawn_load_phase (cyclomatic 38): App::spawn_load_phase has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e677877800eeed48ede10dde8679d874bbed349574851f508160a2ae65e613e5"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::home_view::preview_head_keyed (cyclomatic 38): datui_lib::render::home_view::preview_head_keyed has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92a41233bce2388af9e013f2bebcc02cc1eefd869178928d6ed994c2ba14b14"}},{"ruleId":"D1","level":"warning","message":{"text":"App::apply (cyclomatic 37): App::apply has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/applied.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"41689d83d53f5f2e197f754f4b0fd141b72caf122494beda9ee45509d0eaec99"}},{"ruleId":"D1","level":"warning","message":{"text":"App::info_key (cyclomatic 37): App::info_key has cyclomatic complexity 37 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/info_keys.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efa112de8ff572521dd1ff159978dcb375a98770446f0dbd805e88a84721afd"}},{"ruleId":"D1","level":"warning","message":{"text":"CloudConnectionConfig::validate (cyclomatic 36): CloudConnectionConfig::validate has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"037944b74e8a3728fa9bcb47bd58a3cfa1a939b7566cc5824d9e8e50cd3d7c5e"}},{"ruleId":"D1","level":"warning","message":{"text":"Fitted::fit (cyclomatic 35): Fitted::fit has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf98f2bf3596b8f520d83c92675a682e75288f2d242ab3afebb41176bfb19fc5"}},{"ruleId":"D1","level":"warning","message":{"text":"FixReader::message (cyclomatic 35): FixReader::message has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5dd39dbbf948880c48bc311cab7d2fac2c4916a14edd4de4d5a9162e1fb0f6"}},{"ruleId":"D1","level":"warning","message":{"text":"DataTableInfo::render_schema_table (cyclomatic 35): DataTableInfo::render_schema_table has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80c1670800c2339ba6e3bc5e9549f554edaec5e53ae2c363b6d9b37f7046825"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::app::form::key (cyclomatic 35): datui_lib::app::form::key has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/form.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ad4f031b4e28900579b7fd0e79dcba341949a6c010f6e61c09b2b42592211a"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::data_quality::read_lines (cyclomatic 35): datui_lib::widgets::data_quality::read_lines has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c66310d59ff41419b11e7114fc23c2ff54b40b9d567bd89090ab3c3c2faae7"}},{"ruleId":"D1","level":"warning","message":{"text":"VcdReader::token (cyclomatic 34): VcdReader::token has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/vcd.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"2335b56394bad9f49b5c798cf6c6f9374f43cda671cc531e6851e78d750c824e"}},{"ruleId":"D1","level":"warning","message":{"text":"App::focused_text_mut (cyclomatic 34): App::focused_text_mut has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/paste_keys.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af44fbef3d56762545a685822dc9e613599739632fe448a535f80fa399b19b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Footer::render_line (cyclomatic 34): Footer::render_line has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/footer.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7be372e167dcbd1bcb76a3561876ac5d5ab07464b124aab3e570cce928ed9a"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::build_listing (cyclomatic 34): datui_lib::home::build_listing has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"8264eba49bc60fc73fc91b9abc509c5afbe01d58c775c84840b512dad8c652c0"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::value_counts_view::draw (cyclomatic 34): datui_lib::render::value_counts_view::draw has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/value_counts_view.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f63964b3bc7e51d014f7f129a3ccecb23d13c3c2cd37c9012496e3f8e385eb"}},{"ruleId":"D1","level":"warning","message":{"text":"Step::python (cyclomatic 33): Step::python has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f260f286b9fa9c7652d7fa98deb6436d4874245e5f7bfa95968cd5ed0f84233"}},{"ruleId":"D1","level":"warning","message":{"text":"App::inspector_key (cyclomatic 33): App::inspector_key has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_keys.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8960420d649fb841331278028a0810d06b3a5d6bce120ae31e48504f2f18aeca"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::catalog::check_dataset (cyclomatic 33): datui_lib::home::catalog::check_dataset has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f5ac6f4e905dc454f36f8011b49af7e1847479c13f8f532b2300e293e4e1fd"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::discover::classify (cyclomatic 33): datui_lib::home::discover::classify has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"267de6eaf8e9f14a79a9410c0eb9d580ce16b73a927a89689b2c63167cad3bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::main_view::mode_hints (cyclomatic 33): datui_lib::render::main_view::mode_hints has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9287414db57f75b31c75627fc12f52aaa8afaeb50f40f835f3109209a256e6"}},{"ruleId":"D1","level":"warning","message":{"text":"EventPump::drain_from (cyclomatic 32): EventPump::drain_from has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/event_pump.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a3cdd03361b628fc14975215ca27aaef0f7cf01602775b1185fa0042b8d8e4"}},{"ruleId":"D1","level":"warning","message":{"text":"DataTableInfo::render (cyclomatic 32): DataTableInfo::render has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"06238442c8275721407f2b514304c4c4aae03b754f42185bec01823a58ef815c"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::record_inner (cyclomatic 31): Walker::record_inner has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeb406b7086ecb5b922bef25487bcd669ba5b549c2555f6e7274ee6ad36fd12"}},{"ruleId":"D1","level":"warning","message":{"text":"App::chart_key_inner (cyclomatic 31): App::chart_key_inner has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_keys.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdd4cf0ec032dae5b0a71ef9703b676fc02f0dc05de470f76f162ea898cba15"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::analysis::quality_report::coverage (cyclomatic 31): datui_lib::analysis::quality_report::coverage has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d9421c67f648119b7ecc57a37f84bad23e2a46a6a385bc29e63dfb05c4c734"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::query::parse_term (cyclomatic 31): datui_lib::query::parse_term has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: Op::python (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0c5e6ab8f8e3e3b4354ebc4c4d21078075bc3c7b2d23e03c3c721cf32207b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Fitted::ln_density (cyclomatic 30): Fitted::ln_density has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b7064d1af9cc57fdaebb05dc4d42fef21aa9810c7610c8f88ee7697ebf57fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::field (cyclomatic 30): Walker::field has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"65517b32446452c3bb74920aff0a9e13e9ae13e5fb9d9a3a7bd1e9a1e0c4918e"}},{"ruleId":"D1","level":"warning","message":{"text":"App::sort_filter_key (cyclomatic 30): App::sort_filter_key has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/sort_filter_keys.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4d3d7b4691357c60c048c921a11a0ca0370289548d91e8b356bb8cbb8dbd33"}},{"ruleId":"D1","level":"warning","message":{"text":"Loader::answered (cyclomatic 30): Loader::answered has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e7ae459989826fe816c905504887ca1c68d07042a30f7d1ac745fa8e725800"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::dataflash::index (cyclomatic 30): datui_lib::formats::dataflash::index has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataflash.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0f6384e83b3abf99924fce2fe2667b81a60061f61525158fb17b08f4a1f63a"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::analysis::render_correlation_matrix (cyclomatic 30): datui_lib::widgets::analysis::render_correlation_matrix has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9fa2913e63280af56888b83561245097d290319e00130edd79ed7290d3818b"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_cli::man::render_command (cyclomatic 29): datui_cli::man::render_command has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/mod.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"597d80efa563aad98c3afbb8fc3a1bf2f63367d8ee3b25f2b78233a258202343"}},{"ruleId":"D1","level":"warning","message":{"text":"ChartModal::step (cyclomatic 29): ChartModal::step has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab1408e3b24f1d9274bbb8aa1e5e1ca2952dc01564638010ebfc5e7628c5441"}},{"ruleId":"D1","level":"warning","message":{"text":"Compiler::field (cyclomatic 29): Compiler::field has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c18319912c08610daf57d9399dd4c046c921d9a9ab2c36a982192b39f545be9"}},{"ruleId":"D1","level":"warning","message":{"text":"DataTableState::prepare_async_collect (cyclomatic 29): DataTableState::prepare_async_collect has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/buffer.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c1d59ec69c9d993e2a80fe6ef342b9a4860747cc78a29042a18d27d61e1576"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::fix::parse_message (cyclomatic 29): datui_lib::formats::fix::parse_message has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3555b5ac256a39b71f19281fa3b9fb34c923e8f28d730e20d1d2bb48cb75dead"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::loading::follow::spool (cyclomatic 29): datui_lib::loading::follow::spool has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff4d0cc1e004ed75662af5450c1b21834ca0e11844c49b665df1a89036c952e"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::home_view::render_list (cyclomatic 29): datui_lib::render::home_view::render_list has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"012cfed3056e60061d49187a278b6704e6f666080866220f7fbbdd3893fbba51"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::inspector::draw_fields (cyclomatic 29): datui_lib::widgets::inspector::draw_fields has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0af5c9a2ec095d2cb638a57ba91a02a3408d7d1175dde45ae438f9576c0762"}},{"ruleId":"D1","level":"warning","message":{"text":"Fitted::cdf (cyclomatic 28): Fitted::cdf has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe359f1931974a4138448a068cfc64ed308570ae2bfb16cb4a11dd75568b16d"}},{"ruleId":"D1","level":"warning","message":{"text":"Dictionary::parse_xml (cyclomatic 28): Dictionary::parse_xml has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/dict.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f1504e8d34bf5182acb7293b6b468455f40e43b28b0a5c05c83e443fcca070"}},{"ruleId":"D1","level":"warning","message":{"text":"Loader::first_step (cyclomatic 28): Loader::first_step has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e632850178b7fde0dafca638f610991bc1fe277c9ea94d053d58c3846401d6"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::past_calendar::guard_expr (cyclomatic 28): datui_lib::past_calendar::guard_expr has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/past_calendar.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"22af314d1489ab30a328cdf60d7dbb8fc790cd999f619b0d1274b74c609ee92f"}},{"ruleId":"D1","level":"warning","message":{"text":"EventPump::terminal_mouse (cyclomatic 27): EventPump::terminal_mouse has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/event_pump.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7df9c4f772249bae991c13c01ae62202008ea8dca075ee07c986baae5e7b14"}},{"ruleId":"D1","level":"warning","message":{"text":"App::table_status (cyclomatic 27): App::table_status has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/footer_state.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6396a7bf77ed05651d741c6d122dda36ce65760fffa0041ba9a26220f57fa73c"}},{"ruleId":"D1","level":"warning","message":{"text":"App::typed_into_focused (cyclomatic 27): App::typed_into_focused has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/paste_keys.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dca171c7281c4ac68a7070908973df147441d9fa4ddc1faedce80cff24c81cc"}},{"ruleId":"D1","level":"warning","message":{"text":"App::keys_context (cyclomatic 27): App::keys_context has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"08554ecdce256888df6f36e7e3b699414781cd8de13d1c18b27932c15cb935ee"}},{"ruleId":"D1","level":"warning","message":{"text":"DataTableInfo::render_notes_tab (cyclomatic 27): DataTableInfo::render_notes_tab has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"a717a864597f401c5d44adbe3927635adfe5ac760c8dfda764d068271cbcad50"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::query::parse_node (cyclomatic 27): datui_lib::query::parse_node 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. This is NOT this file\u0027s highest cyclomatic complexity: Op::python (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"023f1546544c621280775af930ec5fe909538f8e4141311dd1309270e2b3147a"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::datatable_main::render (cyclomatic 27): datui_lib::render::datatable_main::render has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/datatable_main.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9673ca572d2d045b3fbf270e7e28a62c2cdab72d85172f81ffb1ed46f1604f63"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::home_view::render_preview (cyclomatic 27): datui_lib::render::home_view::render_preview has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"99945378888f6c4d1666e086c8fa59a959a1df4454bfaf2d8e1bc536e4e21156"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::main_view::analysis_control_keys (cyclomatic 27): datui_lib::render::main_view::analysis_control_keys has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d68b8dfa830d7a1461e92744272181966034bc395c302d0c11d848017312bd"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::data_quality::trend_bar_fields (cyclomatic 27): datui_lib::widgets::data_quality::trend_bar_fields has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e4eedb2353c749d42d7fd759ad8358137f5bc751cd2869c579e00b111ca0c0"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::documentation::layout (cyclomatic 27): datui_lib::widgets::documentation::layout has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/documentation.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c192145cf36d22840af5001fc3cb07bbd353e5982d908182ad12ac5f0a3b34c"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_cli::keys::chord (cyclomatic 26): datui_cli::keys::chord has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/keys.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b444527e4a0c26e49e00e62704c7e618495b19a3f7d297f10aa9146739b7759"}},{"ruleId":"D1","level":"warning","message":{"text":"FramedRecords::open (cyclomatic 26): FramedRecords::open has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"0756b3f1d11deaa8d7d05c8afc18e08a0acdb542adea98fae912daa94afc811e"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeState::slots (cyclomatic 26): HomeState::slots has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":4587}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d6927daaf0dd212d1aadf319347b9c7a8a6582e6ea57b9a7450a97b6b8850d"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::analysis::quality_trends::expected_gaps (cyclomatic 26): datui_lib::analysis::quality_trends::expected_gaps has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_trends.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"022ee7f0f4cc3fbd73503429e794b70acbf7af6562847c4265d9c37c0c5225b7"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::help::render_help (cyclomatic 26): datui_lib::render::help::render_help has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/help.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"226c2d56ed52d14429f0bda9ecf497d7ff038e84d8cff691ad4cb32e3e3bae03"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::home_view::enter_notes (cyclomatic 26): datui_lib::render::home_view::enter_notes has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe1cd2614ae20aabe87534fbddd346c2dfad421115d750f55dc02afc191a0db"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::main_view::chart_hints (cyclomatic 26): datui_lib::render::main_view::chart_hints has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef2d6e5e8062a7750d432123c6eea5be1464ff7fbb0379dcadaca9ac82000ea"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::inspector::footer (cyclomatic 26): datui_lib::widgets::inspector::footer has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3ad93f4fd7feae2770c71f600535820d826ab975844711f9344893aee3f4e0"}},{"ruleId":"D1","level":"warning","message":{"text":"App::filter_editor_key (cyclomatic 25): App::filter_editor_key has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/sort_filter_keys.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8c775e5e04ab476ac0448ba633e25ea7b5959fcad09f20c1cf4f13148f7aa6"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::describe (cyclomatic 25): datui_lib::home::describe has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"228cd40e183406efd1ce67db8f3c32e3dde71d793c1e4b8ee3d7a22c359a547b"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::search::walk_inner (cyclomatic 25): datui_lib::home::search::walk_inner has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/search.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"460add7b5160fedde42973560f43724790493c663e3a537976b32b6e37186299"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::sort_filter_sidebar::render_filters (cyclomatic 25): datui_lib::render::sort_filter_sidebar::render_filters has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb734bda0afa26d407722c2c5d162f59eba5f5abe9ad0b1d532cfa726ff889a"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render (cyclomatic 25): datui_lib::widgets::data_quality::render has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f1b85aaf6d7a9658817672c0d77f1f898fcb5efa5efe36ceb59150748b1224"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::pivot_melt::render_form (cyclomatic 25): datui_lib::widgets::pivot_melt::render_form has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/pivot_melt.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9027db87d665304234aef1e9c526d8e891f18f982b7a25e888eec702d5a8be7b"}},{"ruleId":"D1","level":"warning","message":{"text":"Fitted::valid (cyclomatic 24): Fitted::valid has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52156f5550c8f6a67a4b002d0b44faec8fb44c405160ce68aeb37d7f429c15d"}},{"ruleId":"D1","level":"warning","message":{"text":"ChartModal::row_order (cyclomatic 24): ChartModal::row_order has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6ee02a5040ce2b01d9e0d38e83fe336ee65fb4025e28f39c862bad38806337"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::cloud::cloud_sources::discover (cyclomatic 24): datui_lib::cloud::cloud_sources::discover has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_sources.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"816c09403644bbea95f4f432a28ad1e4403cf50078ef0aaa1c6434e7f0abb8c4"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::discover::directory_format (cyclomatic 24): datui_lib::home::discover::directory_format has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd59632cae86f6e68e0391c8fefaa7c7f971111c2546c2a29984bdd3e72298f8"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::discover::enrich_dataset (cyclomatic 24): datui_lib::home::discover::enrich_dataset has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e25318301238f40a347c8c1eb4f7722767f72cc87fd456c6dbbedd4e612cfd"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::sort_filter_sidebar::render_in_effect (cyclomatic 24): datui_lib::render::sort_filter_sidebar::render_in_effect has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc05a3a6975615f7d3e80e4bca89195970283e752d9c1eca97efac62c88eaed"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::sort_filter_sidebar::render_columns_tab (cyclomatic 24): datui_lib::render::sort_filter_sidebar::render_columns_tab has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace6ec8f1791b110a5d12bac742bbb191e774befbbff367b784a607f82da602d"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render_intervals (cyclomatic 24): datui_lib::widgets::data_quality::render_intervals has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::widgets::data_quality::setup_value (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3097d1862196703be9e2e5c427bffaf0f8c59189f2076ccbe4a1fb4294ae0a"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_cli::man::roff::inline (cyclomatic 23): datui_cli::man::roff::inline has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/roff.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cdaa5eadeb1d90f44eedeb3637e3e28a0c026c807f9895dea614bcc682b83a"}},{"ruleId":"D1","level":"warning","message":{"text":"SortModal::jump_selection_to_order (cyclomatic 23): SortModal::jump_selection_to_order has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4837b9e3623ff1eabd0529d8bf7165a023f087daa839ec4f8dc5f1d82c507d6"}},{"ruleId":"D1","level":"warning","message":{"text":"SdfReader::line (cyclomatic 23): SdfReader::line has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/sdf.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9af169bbc6ee6fd9fb61eb05112ad91f3f118d1f02c75cd237eed8f860ae27a"}},{"ruleId":"D1","level":"warning","message":{"text":"App::value_counts_key (cyclomatic 23): App::value_counts_key has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/value_counts_keys.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a121f7c66d5ed8fb77077e7dcfd12a841a77b590e643a9ae50709729a7f29c22"}},{"ruleId":"D1","level":"warning","message":{"text":"App::home_open_selected (cyclomatic 23): App::home_open_selected has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ae47997f0573eaaa27bc6ece667b7b12f83b0a1c0b65b5115c041a447cc1c2"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::chart::chart_data::prepare_aggregate_xy (cyclomatic 23): datui_lib::chart::chart_data::prepare_aggregate_xy has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c51beacddfd927621f16f7a849e51090c7649864578ec56f155156802cb814b"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::chart::chart_data::prepare_bar_aggregate (cyclomatic 23): datui_lib::chart::chart_data::prepare_bar_aggregate has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"632da1bc81eb0ed05be75630459867cb14a8589607ba81ecd52a2357525f9d4c"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::chart::chart_trend::copy_text (cyclomatic 23): datui_lib::chart::chart_trend::copy_text has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_trend.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd31f803dc2c583f02c6fd9d4cf6f7648a58d483edbc2c0b83c49dc67618dae"}},{"ruleId":"D1","level":"warning","message":{"text":"Markdown::render (cyclomatic 22): Markdown::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":"crates/datui-cli/src/man/roff.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"84563e7af5dc8b4701da303fdc88268f0c404723f4df2d39a0f9270bc2efc87e"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::blocks (cyclomatic 22): Reader::blocks has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"4faf4b2bb5f04bed3ab0c5125274e716e2d782f3959ba3ecf305191a87b95988"}},{"ruleId":"D1","level":"warning","message":{"text":"TextInput::apply_key (cyclomatic 22): TextInput::apply_key has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/text_input/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"526f8d5733211406b42e5676c90520ded8cabcccf2864e32cf7a90424361820e"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::analysis::data_quality::profile_quality (cyclomatic 22): datui_lib::analysis::data_quality::profile_quality has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec8b00cf6a12cd498995d90da35a433270586aeacd58845d91ecb421f6c49f9"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::export::python_script::source (cyclomatic 22): datui_lib::export::python_script::source has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a2a99aef022c18e8cea04e8324b1d615dc5c6cd72b41d55d28caed756146a6"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::sort_filter_sidebar::render (cyclomatic 22): datui_lib::render::sort_filter_sidebar::render has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a3148cdaa783acec5ac2dedeac6c53c8b81f42c7fdf0421a52102b95088268"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::analysis::render_distribution_table (cyclomatic 22): datui_lib::widgets::analysis::render_distribution_table has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"478382cc0a70fa6efc2ac25fcc4bd1823fc4c337b22b5ed0f543c14f99db37a2"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::inspector::render (cyclomatic 22): datui_lib::widgets::inspector::render has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a0be1447a020c3cab7fc8cba66a6aca70c6eb71147ffd64052385117e7e6b6"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::ticks::calendar_ticks (cyclomatic 22): datui_lib::widgets::ticks::calendar_ticks has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/ticks.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00f8e0c6732143f55f36495c8e21fad9eb4ace6820bdf10d5578595ff7851f1"}},{"ruleId":"D1","level":"warning","message":{"text":"App::take_follow_rows (cyclomatic 21): App::take_follow_rows 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. This is NOT this file\u0027s highest cyclomatic complexity: App::text_field_focused (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a005e05a1e09ba2a0eb718ce192535eb6c071977f2d6bd6f012ab4a521b18ff5"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::excel::excel_infer_column_type (cyclomatic 21): datui_lib::formats::excel::excel_infer_column_type has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/excel.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"c115dbcec4f3cdff10e7d8c4eb5750a91d5876997b20c7f401fafe210be4224e"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::framed_records::capture::udp_payload (cyclomatic 21): datui_lib::formats::framed_records::capture::udp_payload has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":3028}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef95333cbc6fe13b9df8187e9616b3d94f5920b3ad2c340327a74c9acfec205"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::typed_value::parse_duration (cyclomatic 21): datui_lib::typed_value::parse_duration has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/typed_value.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"819f783cf6511349c1d5ec7449996d81b15dc2e76a8563092ea982cb41fd54a3"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render_findings (cyclomatic 21): datui_lib::widgets::data_quality::render_findings has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::widgets::data_quality::setup_value (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3b2876efe4a9e24c71933f4d553a91ecea35ee22d735c6d83c1b8a51a007e1"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::pivot_melt::render_grid (cyclomatic 21): datui_lib::widgets::pivot_melt::render_grid has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/pivot_melt.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"9609684769e31dc20d229d6306d4a45ee6cd445504345962d6698a349a134f7e"}},{"ruleId":"D1","level":"warning","message":{"text":"SortModal::move_column_display_up (cyclomatic 20): SortModal::move_column_display_up has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9bd12c7eb8b6c35bf2cfcbef50c3fd00bb9ca94cab91701fc60be97d52b137"}},{"ruleId":"D1","level":"warning","message":{"text":"Page::path (cyclomatic 20): Page::path has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_pdf.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d052c72e4208b70c660d54ea0d19f67e78a1e173d7dca965e7e911fd67e93c"}},{"ruleId":"D1","level":"warning","message":{"text":"ConversionFailure::sql_message (cyclomatic 20): ConversionFailure::sql_message has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/error_display.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f262d5ff4ab77b4bd7286a034fff74e6a787def2dc44b6478dd846f962a25c34"}},{"ruleId":"D1","level":"warning","message":{"text":"App::follow_mark (cyclomatic 20): App::follow_mark has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: App::text_field_focused (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a1c7e6ec8b1bb175303ff643eb2770d4accf708dccf55957c503b1cf5342b0"}},{"ruleId":"D1","level":"warning","message":{"text":"App::view_key (cyclomatic 20): App::view_key has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/view_keys.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd9cdea9691752c131bdeb7aaa79017312cdf4d251383e1b172654f0486c42f"}},{"ruleId":"D1","level":"warning","message":{"text":"DataTable::draw_columns (cyclomatic 20): DataTable::draw_columns has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb5df53792b21ff5147039f91180107ffbc851ea60aa0a6b6742c70485e7498a"}},{"ruleId":"D1","level":"warning","message":{"text":"TextArea::position_for (cyclomatic 20): TextArea::position_for has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/textarea/edit.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef38db2f5e2826213ac1a6353035a287407ce70130eec2e8d20907a593cd3765"}},{"ruleId":"D1","level":"warning","message":{"text":"FormView::draw (cyclomatic 20): FormView::draw has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/ui/form_view.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79909a6fd31bf17d1d9e0420e377478b1381cd72e0357b5546fb7f041cf0180"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::analysis::quality_report::build_report (cyclomatic 20): datui_lib::analysis::quality_report::build_report has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ObservationKind::spec (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"202aa40f6b9facc589c141d901bc4748e870c57151ba7eedc5682645dc7a76a3"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::analysis::quality_report::checks (cyclomatic 20): datui_lib::analysis::quality_report::checks has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: ObservationKind::spec (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e949e728da6c041a2466e38f435a9c898783596fb07874c5d656b4572cf6faf6"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::app::startup::read (cyclomatic 20): datui_lib::app::startup::read has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/startup.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f7b8798a4d3016aa796e1e8bfeadd2581b6ccf382de1e173f1d3e4a124ed04"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::chart::chart_data::envelope_series (cyclomatic 20): datui_lib::chart::chart_data::envelope_series has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4dc9b54f81ba0a1fe2635ff7be9b96bbfeb1adb62fa2929dc8759187fdf70d"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::cloud::cloud_sources::resolve_among (cyclomatic 20): datui_lib::cloud::cloud_sources::resolve_among has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_sources.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b24ba4e534ed0fa1fdf1558e00d4cd6880212e851522e6985227eb2bfc56bc"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::browsed_section (cyclomatic 20): datui_lib::home::browsed_section has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":2636}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c04f5b215e35bacf823d7fd1d63dc55aa04d6e413c049920a4002d7cbd3508"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::catalog::dataset (cyclomatic 20): datui_lib::home::catalog::dataset has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f95c4243b7de00baf81f5379f9448bf7ce27e0cecf9be08894b0767cae2201"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::discover::scan_dir_with (cyclomatic 20): datui_lib::home::discover::scan_dir_with has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da344c6aec85bdd046818d2a4507b78af20a67acafdc96d58d535086b06cbce"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::home_view::section_header (cyclomatic 20): datui_lib::render::home_view::section_header has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a89da0e9e18d565b756f992dde67f2a7b615329bc9e8526851be41a242fe71"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::typed_value::python (cyclomatic 20): datui_lib::typed_value::python has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/typed_value.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b09f9d37fd335661ff6aa766930c3f7ecd349c6c2d0b90a74594044bef26a65"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::documentation::lines (cyclomatic 20): datui_lib::widgets::documentation::lines has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/documentation.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"38aae2c910ab103b3c586f7ecdc5864855d6de07bfac1e96539418107dad22ea"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::inspector::binary_pane (cyclomatic 20): datui_lib::widgets::inspector::binary_pane has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c430fe1c91f255d2706ad05b64454fee6aacc7c8ac35900d1f4ccd934925a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"ChartModal::set_mark (cyclomatic 19): ChartModal::set_mark has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"78da003a5e560e8c4943d9686b9f3fdace6bb5b6e7f4176de6447038b04288af"}},{"ruleId":"D1","level":"warning","message":{"text":"NmeaReader::sentence (cyclomatic 19): NmeaReader::sentence has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/gps/nmea.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"f076efb7b831c235a334dbd6be4d894a759accc528ea66509e49350cd4d57b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"App::perform_copy (cyclomatic 19): App::perform_copy has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/copy_keys.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85d27205a8b0f8438144192c787e7b8064a9ebe5776a3f7837e55329c5077d6"}},{"ruleId":"D1","level":"warning","message":{"text":"App::click (cyclomatic 19): App::click has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/pointer.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"4568a4f3d0aff9ef5b10e92b0999ed94c81f6fb6d6f3d66d3f45c178167cbc34"}},{"ruleId":"D1","level":"warning","message":{"text":"App::spawn_home_probes (cyclomatic 19): App::spawn_home_probes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd90d408120b9b3ebb3a6763fe64636a4b2624a034012fc2860e88da811dcf5"}},{"ruleId":"D1","level":"warning","message":{"text":"App::inspector_needs (cyclomatic 19): App::inspector_needs has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_reads.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7e3ad63c3e4217eaa78ed71c088a6c7e0fec81ac81c7ae32896800874beff4"}},{"ruleId":"D1","level":"warning","message":{"text":"App::counting_event (cyclomatic 19): App::counting_event has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/counting.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d9bb641fadc3d010433b3b29d0a8513c9699495956f37fff7229c5c2125466"}},{"ruleId":"D1","level":"warning","message":{"text":"App::install_dataset (cyclomatic 19): App::install_dataset has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a0dbf08582aec16920e5655826cd87f592ebdeb7e1f72769f86092d55dcb31"}},{"ruleId":"D1","level":"warning","message":{"text":"Watcher::run (cyclomatic 19): Watcher::run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"47640b2c830860ffa487f7e367afcaf4320727fd9c1b33b10a0e20bf1bc741ed"}},{"ruleId":"D1","level":"warning","message":{"text":"DataTableInfo::render_detail_list (cyclomatic 19): DataTableInfo::render_detail_list has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b42aa3d6ce931c164eda3124bbd79156f94436a8781a5dd5c39294246af4b0f"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::chart::chart_export::svg (cyclomatic 19): datui_lib::chart::chart_export::svg has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: Rgb::of (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"6668adadeb5b323e5bf64b847326452b66a9493cf188cab3292ec9063b029c25"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::chart::chart_plot::trailing_mean (cyclomatic 19): datui_lib::chart::chart_plot::trailing_mean has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_plot.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbf4a05b0a2375a86e9be2b83a3767eaa4e22b99f05f5d0c3b293473c5df8cc"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::chart::chart_trend::lowess (cyclomatic 19): datui_lib::chart::chart_trend::lowess has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_trend.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"7783f68667534e58a081afb04d8f25d10645e9281f232699dc6231265394f2c7"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::error_display::user_message_from_io (cyclomatic 19): datui_lib::error_display::user_message_from_io has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/error_display.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d546820a8558cfffa83f5f62ea89e0da3474c7dd9b23708e5dbd5fb21126af"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::audio::read_wave (cyclomatic 19): datui_lib::formats::audio::read_wave has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::formats::audio::read_comm (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/audio.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f853ae194e68c9fa032faed6c5f951eb8dbeca1f10fd3505cf3e18d85e66130d"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::framed_records::capture::pcapng (cyclomatic 19): datui_lib::formats::framed_records::capture::pcapng has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":3156}}}],"partialFingerprints":{"codehealthFindingId/v1":"174dabcad8f21c88c5223fbd67725210f4aecea1aa38c03a7e94042bfe29bdef"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::parquet_footer::column_stats (cyclomatic 19): datui_lib::formats::parquet_footer::column_stats has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parquet_footer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1927547d8f9b52952d77e66d30ed51782d8fa76f42339d05ec8a3be89c4a369"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::schema_union::sample_files (cyclomatic 19): datui_lib::formats::schema_union::sample_files has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/schema_union.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"c144de881b75309afa2d8c6702e8d1847cb6865a8b2a9452b770dbd7e1847b58"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::query::sql_group::plan (cyclomatic 19): datui_lib::query::sql_group::plan has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/sql_group.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ec1061beab1efd199321a1e198825ece44de833e30a6d5342bd1062d9bf16e"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::view::calculate_relevance (cyclomatic 19): datui_lib::view::calculate_relevance has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/mod.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee873fc7adfa2376afd7cd539f857a9d40762eff246c9a5ebd3d4fa0971916d8"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render_setup (cyclomatic 19): datui_lib::widgets::data_quality::render_setup has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::widgets::data_quality::setup_value (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ef12160a34b3266989b74335ad574345737dd3e92f563b2abe681e4714b28a"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_cli::man::plain::render (cyclomatic 18): datui_cli::man::plain::render has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: datui_cli::man::plain::glyph (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/plain.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"902704cc9c2f4d66d7567f77dc533d3229dbb77a0281d6dc917008a7bb87cd88"}},{"ruleId":"D1","level":"warning","message":{"text":"AnalysisModal::plan_choices (cyclomatic 18): AnalysisModal::plan_choices has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_modal.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c05dd8eed50f93d0467ecfdf4de638c6ecdd0b0c0a0cbf18531f8c322f20088"}},{"ruleId":"D1","level":"warning","message":{"text":"Fitted::discrete_quantile (cyclomatic 18): Fitted::discrete_quantile has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f652f9d7e01cee4d13e37692838989b61e4404f0a8d5450dd7d3b97a6a9429de"}},{"ruleId":"D1","level":"warning","message":{"text":"EventPump::classify (cyclomatic 18): EventPump::classify has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/event_pump.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c94b48c9cf46bb7f447d3d9768ff458d000728e9d185eb84a63d13effa0df5"}},{"ruleId":"D1","level":"warning","message":{"text":"ReplyScanner::feed (cyclomatic 18): ReplyScanner::feed has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/terminal_color.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d8ba670b98e58f44f7dbdc6ec869acfbbaf7ceee46a60ceaa09ca675d03244"}},{"ruleId":"D1","level":"warning","message":{"text":"FramedRecords::read_from (cyclomatic 18): FramedRecords::read_from has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabaa0e7994261bb3cc0f4b30b9a757a18f76df0f31f70b0d4a94e2e17675a62"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::match_rules (cyclomatic 18): Reader::match_rules has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4d6ac0da013c5ffdf20a2fadf678995560f2c54221f769dd20695c5b99cbe3"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::time_meaning (cyclomatic 18): Reader::time_meaning has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1f17e6334eafa7845aba6ea6a4e8af2570475f351bdbcee8821b7efffefa7f"}},{"ruleId":"D1","level":"warning","message":{"text":"DatasetSchema::ranges_of_columns (cyclomatic 18): DatasetSchema::ranges_of_columns has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/schema_union.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"8720366d7575573aa75b8cf8342bcf13262f7266406262d9a71ba7263546cbc9"}},{"ruleId":"D1","level":"warning","message":{"text":"PlotMarks::redraw_axes (cyclomatic 18): PlotMarks::redraw_axes has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::glyphs::ascii_twin (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/glyphs.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"2469379dcf3f8d14f9b750f65e18119ecc35c362ecdd545a3deaf335e198c063"}},{"ruleId":"D1","level":"warning","message":{"text":"App::run_quality_compute (cyclomatic 18): App::run_quality_compute has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_runs.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca492550f074d30bc9ef70da702eeaf3bfb700600114b10395e157ad555684cc"}},{"ruleId":"D1","level":"warning","message":{"text":"App::scan_for_open (cyclomatic 18): App::scan_for_open has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40d43a7f399fc09935929397e142ffb4f99df8d32b31e93c138c9ebf0ffedd9"}},{"ruleId":"D1","level":"warning","message":{"text":"App::build_lazyframe_from_paths_with (cyclomatic 18): App::build_lazyframe_from_paths_with has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c7c98543d08c7f94ad369f4ced6109a1f7a5f8696fa69e26773e392c692e68"}},{"ruleId":"D1","level":"warning","message":{"text":"App::view_score_details (cyclomatic 18): App::view_score_details has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/view_apply.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03592329cc9d7c6cf074fb2a75a456514c6bbbd8889abf1db00079dd3e35573"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::audio::read_aiff (cyclomatic 18): datui_lib::formats::audio::read_aiff has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::formats::audio::read_comm (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/audio.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fa7d23ac0b57f9c823a185f982d4bca0f5d5d3e714c65cdae481cd70dd6faa"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::dataset_files::open (cyclomatic 18): datui_lib::formats::dataset_files::open has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataset_files.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0f291f2b02f1d77c4a2b8cf8e2c5a0acd1a83475508f580f290f54fdbe0b4a"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::midi::parse_track (cyclomatic 18): datui_lib::formats::midi::parse_track has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::formats::midi::meta_kind (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa2d762c419334da451086ab7405c61cfe79d758bb0b24aebd746b46d6606a5"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::model_files::read_gguf (cyclomatic 18): datui_lib::formats::model_files::read_gguf has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::formats::model_files::ggml_type (cyclomatic 39) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/model_files.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2db30f2bf92eccd45afc7ec66eb5403c59c1d902b6856bc357001ca150b953"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::readers::csv::from_csv_paths (cyclomatic 18): datui_lib::formats::readers::csv::from_csv_paths has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/readers/csv.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"29533ebf26e8e20fcc55de1c4b00c29cc8fc3095f155d0e0b4f3757730fa5838"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::door_name (cyclomatic 18): datui_lib::home::door_name has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"9833a74e6fdf05a2b5a17714555d6b329ddb05f5681a6087090d0b6f569fd1bc"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::home_app::home_cloud_source (cyclomatic 18): datui_lib::home::home_app::home_cloud_source has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e915bbf46d68b5e16367a8d3e54d199968a0dc2a2864d9432650292c78ddf4"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::hex_view::byte_rows (cyclomatic 18): datui_lib::render::hex_view::byte_rows has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/hex_view.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7030c66ff68ee2c121b1ac24152d5c773e3ae43fa1f80792368f7d3db2115e74"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::view_sidebar::render_list (cyclomatic 18): datui_lib::render::view_sidebar::render_list has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/view_sidebar.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ba2470d18893285e814dcb9839b36e86015095ea4aa2ff2e6eae35dc3bf951"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::analysis::render_distribution_histogram (cyclomatic 18): datui_lib::widgets::analysis::render_distribution_histogram has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2e536efcdae6a516f9ff5c980a771a98feb0c76573350b9f2670e3c4d76c41"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::chart::render_bar_chart (cyclomatic 18): datui_lib::widgets::chart::render_bar_chart has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef9b23a978a4110b79f297190c42ed2e118a21642884ef979394b2ea28865d2"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render_interval_detail (cyclomatic 18): datui_lib::widgets::data_quality::render_interval_detail has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::widgets::data_quality::setup_value (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef781178232137898f4c05ee5ff4a89f79f7cfe39388a7ed8eb4403a84d3280"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::inspector::pane (cyclomatic 18): datui_lib::widgets::inspector::pane has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"92701f76c4281254a0e3a7fbca2a7681e4ab5e3cd769f952f11fcf2cf6a77368"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::inspector::draw_value (cyclomatic 18): datui_lib::widgets::inspector::draw_value has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"558c2aff897f67e26b23a700153c722391dda98ad827d3aba5c90a72d13a4240"}},{"ruleId":"D1","level":"warning","message":{"text":"ChartRequest::from_modal (cyclomatic 17): ChartRequest::from_modal has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_jobs.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a1bcab569313f35cc38be9aa02d596b3ccb77b397f824a41d21c49942fcbf5"}},{"ruleId":"D1","level":"warning","message":{"text":"SidebarFilter::python (cyclomatic 17): SidebarFilter::python has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12a1e35b215cee730ef20adc08bd41df19ac9e191423d89712f5568991ef78c"}},{"ruleId":"D1","level":"warning","message":{"text":"Dictionary::parse_toml (cyclomatic 17): Dictionary::parse_toml has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/dict.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3bb58302a1e4ebf5bf96d5990d4c44658d9b0782322e38905c90bff329fdb3"}},{"ruleId":"D1","level":"warning","message":{"text":"Sink::finish (cyclomatic 17): Sink::finish has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"521a577a31454904bcac93b7e63cd33ba71525284f76d689c981ffcad1db2604"}},{"ruleId":"D1","level":"warning","message":{"text":"Registry::listing (cyclomatic 17): Registry::listing has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/registry.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3677e037d022153a60a869349f7f3d01376bb04b00c21ec95ea1ab108d9711"}},{"ruleId":"D1","level":"warning","message":{"text":"App::find_answered (cyclomatic 17): App::find_answered has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/find.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"26099b9d640ff68621cdcf4b84e53d7559772ce0090596b0790dedb4f41114e8"}},{"ruleId":"D1","level":"warning","message":{"text":"Tail::end_record (cyclomatic 17): Tail::end_record has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"53889a974f9ff47174ef079e6fcfbf0424c16fe8cd7b4b291c2e4dd82323839f"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenRequest::named (cyclomatic 17): OpenRequest::named has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: Phase::label (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef48c1f423143b34fa92bedcf813d47c3280bd1999ac09cc856ccb875e43e7b"}},{"ruleId":"D1","level":"warning","message":{"text":"Node::python (cyclomatic 17): Node::python has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Op::python (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"142e3fdf3ab15f773937b877892d89a1cb78060fd56b6c7ccc4f7ee8671dfeb2"}},{"ruleId":"D1","level":"warning","message":{"text":"DataTableState::query (cyclomatic 17): DataTableState::query has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/query.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"3585e6ec77669a921be69bc88ba122ba1e4df11f6f5e539969817d40c326ff50"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::analysis::data_quality::largest_material_change (cyclomatic 17): datui_lib::analysis::data_quality::largest_material_change has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: QualityObservation::evidence_predicate (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":4286}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d20410663e04d4dd0cf58a0b5d9ea5cdcfc3ac9a0ceba5c0d54f5cd3e13bf2"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::analysis::table_sample::draw (cyclomatic 17): datui_lib::analysis::table_sample::draw has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/table_sample.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0622079513be5ceac6a6b7cbfaea31363fd7f136a6f82abd55013091d62370e8"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::app::hex_view::readings (cyclomatic 17): datui_lib::app::hex_view::readings has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"663bda50d7d4bede5085bcb58a0ead356246dd3c0cc0aac418366089cf93b5d0"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::cloud::cloud_hive::split_points (cyclomatic 17): datui_lib::cloud::cloud_hive::split_points has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_hive.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a1df75773c68bab3b8ab14e381c05cedd998d58bfdcb0bc763696828339294"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::export::python_script::csv_arguments (cyclomatic 17): datui_lib::export::python_script::csv_arguments has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"529eccf853e1ffc7eb735cec9fb8bcd323d823532ec6fa7067010fa4c1b1aee6"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::audio::read_fmt (cyclomatic 17): datui_lib::formats::audio::read_fmt has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::formats::audio::read_comm (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/audio.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c9abb4e8d37dee9ebd3c6fcf1c7762c6273f7460f2055dfc76fb991fab9602"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::command::route (cyclomatic 17): datui_lib::formats::command::route has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/command.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd50690963d39d52a5b11866341c256510207b2a6594fd430f974d255afb5f5b"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::numpy::dtype_of (cyclomatic 17): datui_lib::formats::numpy::dtype_of has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/numpy.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4f641cb5936928329dd2841933aab851070242b832691d22b2e29add98d472"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::home::catalog::command (cyclomatic 17): datui_lib::home::catalog::command has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bd1e21e2c516df58386e127fb6acb9b6dee7e02799d7077f67fbfb4075ad1b"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::inspector::inspector_reader::wrap_unit (cyclomatic 17): datui_lib::inspector::inspector_reader::wrap_unit has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_reader.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd705826ce4ea89dc3491b12d350e18e524fd72f643ae451898e32552f430331"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::view_sidebar::render_form (cyclomatic 17): datui_lib::render::view_sidebar::render_form has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/view_sidebar.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1543d658b1a56bd9010802ba6ccf081514b0e8dfe3a7710adeec0c2cbed21e9"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::typed_value::text_of (cyclomatic 17): datui_lib::typed_value::text_of has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/typed_value.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7163f4e2280fcce544091dc79008074f08ab383cf9c742ce071e4ce2447f8830"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::axes::log10_sets (cyclomatic 17): datui_lib::widgets::axes::log10_sets has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/axes.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"b586f7028b765bbc627bd0169c715a4c7bde5c804157e6fd721a2b07e3724c2f"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::inspector::text_pane (cyclomatic 17): datui_lib::widgets::inspector::text_pane has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee0fd82e8b55c77b96692fe5e4dfd301801c067337f4e1eca50eff266044944"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::inspector::render_drill (cyclomatic 17): datui_lib::widgets::inspector::render_drill has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2088c963944a6878f34084b225804a09c1e02f5a217fe34800317910d471f631"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::sample_form::render (cyclomatic 17): datui_lib::widgets::sample_form::render has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/sample_form.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"194fbaa4cf7f99ee07dab59da1b7a9a0dc119ae24a4587d2790921fa309eda50"}},{"ruleId":"D1","level":"warning","message":{"text":"QualityScope::parse_command (cyclomatic 16): QualityScope::parse_command has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: QualityObservation::evidence_predicate (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c81767505a01b1493be423b2b2303ea15a5e74aaa93ad4068d52873739fa01"}},{"ruleId":"D1","level":"warning","message":{"text":"SampleForm::adjust (cyclomatic 16): SampleForm::adjust has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/sample_modal.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8157c46b46f5e453cabc7a4b3b28cb01fc69fec02de262a076539c34dcafc574"}},{"ruleId":"D1","level":"warning","message":{"text":"Drawer::draw (cyclomatic 16): Drawer::draw has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/draw.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc6a971689d79e30888deadad1b2b8ad7f2022c99c1a8dd9435097bdb96cb3c"}},{"ruleId":"D1","level":"warning","message":{"text":"ChartRequest::prepare (cyclomatic 16): ChartRequest::prepare has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_jobs.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1a7d2d2db0f2af234ae3d5dbc738347a92c38e30ca0cd132b667500885e182"}},{"ruleId":"D1","level":"warning","message":{"text":"ChartModal::pool (cyclomatic 16): ChartModal::pool has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef08b9c19ca5e09661e4779630554dd317fe64400990c9234e99dc1c5a322c68"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioSource::signal_report (cyclomatic 16): AudioSource::signal_report has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::formats::audio::read_comm (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/audio.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b8f6a0ef52ab9669405c6a78e6b3f4a0dad8e20284e0cc09f8970688ca01ec"}},{"ruleId":"D1","level":"warning","message":{"text":"Registry::load (cyclomatic 16): Registry::load has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/registry.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9479606bda64de2ca1f7a1b31f735e42c05e2cac926a7c66ed24ccd79ffa236"}},{"ruleId":"D1","level":"warning","message":{"text":"Source::predicate_sql (cyclomatic 16): Source::predicate_sql has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::formats::sqlite::read::decide (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/sqlite.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5619640c515b120d4bacc43bc9abf9d5d2c5ad5deeb937581813159562d926"}},{"ruleId":"D1","level":"warning","message":{"text":"App::analysis_list_move (cyclomatic 16): App::analysis_list_move has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_keys.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e13e2f0e7d7ef27fdac354492b7d872834b9d7c27018d7d864f400dc8964fd1"}},{"ruleId":"D1","level":"warning","message":{"text":"App::spawn_collect (cyclomatic 16): App::spawn_collect has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: App::text_field_focused (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c48fb65311cf7528e9b124a3db927a7645c8cd55579b41d3a7fb3ec2086018b"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::cloud::cloud_hive::list_dataset_files_reporting (cyclomatic 16): datui_lib::cloud::cloud_hive::list_dataset_files_reporting has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_hive.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598f7d10556f642d7ee2018aeee37de0f4f298b45f4310b3fefa4b467d82c90"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::command::check (cyclomatic 16): datui_lib::formats::command::check has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/command.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b51d1cad9ba9a1119462300f9af794d5bf986352606839287cfc47a8be2759"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::lines::field_counts (cyclomatic 16): datui_lib::formats::lines::field_counts has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/lines.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ea1157a68aa6be5aea4b31013dbdaea6602888239b3ce1b5c882973b4609a6"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::parquet_footer::shown (cyclomatic 16): datui_lib::formats::parquet_footer::shown has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parquet_footer.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9eed4b7a2c13ade2cee3834a23f38a9ef715bf6f56328c21e05364f690abf0"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::formats::readers::csv::type_string_columns (cyclomatic 16): datui_lib::formats::readers::csv::type_string_columns has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/readers/csv.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"3242bee42549d304ee848bec0d8d64417e7cff7484adc5722b849b613a407f5e"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::query::parse_timestamp_literal (cyclomatic 16): datui_lib::query::parse_timestamp_literal has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: Op::python (cyclomatic 56) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9efb62d56a22396e35d8075c9a0e3b26c1d2b9cefa05ba70fd5d210e6abd9f"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::hex_view::inspector (cyclomatic 16): datui_lib::render::hex_view::inspector has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/hex_view.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2ecb9ad4ca7e3d24c57553e26ba0a5328bcf090ec1e46a67b4ef2c7c4b386d"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::home_view::render_path_list (cyclomatic 16): datui_lib::render::home_view::render_path_list has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74b029f2611b0e6ca4077bacd04782a723bffde4fe38574bae7a990137a5753"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::render::home_view::entry_line (cyclomatic 16): datui_lib::render::home_view::entry_line has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3338608b9bd289fcd100ff3f681fad7b4c36bbc81899efc863c1cd133e30caf"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::column_paging::plan (cyclomatic 16): datui_lib::widgets::column_paging::plan has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/column_paging.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"006c41430a0c8e90083014f45d52e212ab7a254f7d70e167924e69ad0865b50d"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render_access_plan (cyclomatic 16): datui_lib::widgets::data_quality::render_access_plan has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: datui_lib::widgets::data_quality::setup_value (cyclomatic 25) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":4139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7442cd13dbaa40b7b6ac2bb5edec92ffad79baf1087b4a41b6c584372e819f"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::inspector::draw_table (cyclomatic 16): datui_lib::widgets::inspector::draw_table has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":2419}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f682e6c0e8388189861acde30b810540d93151bde5baefbc349fd696e6c518"}},{"ruleId":"D1","level":"warning","message":{"text":"datui_lib::widgets::quality_intent::render_form (cyclomatic 16): datui_lib::widgets::quality_intent::render_form has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/quality_intent.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2233136468270dab67524cb38982e096a6b507e72f3059653073392c2a0950e4"}},{"ruleId":"D2","level":"warning","message":{"text":"App::key (cognitive 173): App::key has cognitive complexity 173 (threshold 15). Drivers by points: if/else 69 (121 pts), boolean chains 36, match/switch 8 (16 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":2956}}}],"partialFingerprints":{"codehealthFindingId/v1":"09875db90fabf73409c50da433fd7c2909b45f092bfdfa68be11713c9f6d966f"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::query::parse_nodes (cognitive 108): datui_lib::query::parse_nodes has cognitive complexity 108 (threshold 15). Drivers by points: if/else 35 (66 pts), match/switch 6 (22 pts), loops 6 (14 pts), boolean chains 6 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd97b270a96ab83cbac9d773cf330533c89f79f020b21bf581ff9855d1d355ed"}},{"ruleId":"D2","level":"warning","message":{"text":"App::answered (cognitive 107): App::answered has cognitive complexity 107 (threshold 15). Drivers by points: if/else 41 (84 pts), match/switch 6 (13 pts), boolean chains 10 (nesting depth added 50). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":4339}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8f35c0462d2b69657933bc61e9fc38b7cae84b3e939727c78275440b9d00de"}},{"ruleId":"D2","level":"warning","message":{"text":"App::home_event (cognitive 105): App::home_event has cognitive complexity 105 (threshold 15). Drivers by points: if/else 31 (72 pts), loops 7 (18 pts), boolean chains 9, match/switch 3 (6 pts) (nesting depth added 55). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"57794f93612b64dfb64e0c4b740c7fd3e727d661ce8a22caa4c5fc14df399d37"}},{"ruleId":"D2","level":"warning","message":{"text":"FramedRecords::build_index (cognitive 104): FramedRecords::build_index has cognitive complexity 104 (threshold 15). Drivers by points: if/else 27 (72 pts), match/switch 6 (20 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc820ba33d5bbd258a9380536c00329bcd089e16ab0283086f84408f53b04de4"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::dbc::parse (cognitive 101): datui_lib::formats::dbc::parse has cognitive complexity 101 (threshold 15). Drivers by points: if/else 19 (67 pts), match/switch 5 (15 pts), loops 6 (12 pts), boolean chains 7 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dbc.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd8b73c1675bb8c7fa4fedde64b337ab5d430c6866178f4601df145e88dee21"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::query::tokenize (cognitive 99): datui_lib::query::tokenize has cognitive complexity 99 (threshold 15). Drivers by points: if/else 24 (61 pts), loops 5 (14 pts), boolean chains 13, match/switch 3 (11 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c343ae88466f2a057d74e588e201576f8491b7e4669032c2b93e1579297a3525"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::delimited (cognitive 96): Reader::delimited has cognitive complexity 96 (threshold 15). Drivers by points: if/else 32 (67 pts), match/switch 7 (18 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2e6f7fbb133c97a37125e4608578d4ca9d9dac18cd6d98cc32489ab1b09fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::records (cognitive 92): Reader::records has cognitive complexity 92 (threshold 15). Drivers by points: if/else 29 (59 pts), match/switch 9 (15 pts), boolean chains 11, loops 3 (7 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df1213238c78813b06cc9bc817a3edeb8398e71db61ac79d2f24431016c689c"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::ulog::index (cognitive 91): datui_lib::formats::ulog::index has cognitive complexity 91 (threshold 15). Drivers by points: if/else 23 (59 pts), match/switch 7 (19 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/ulog.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2182476f2575cec9aa48dc2c397085ffc3363739176f4aebb646edf14c38adfd"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTable::render (cognitive 89): DataTable::render has cognitive complexity 89 (threshold 15). Drivers by points: if/else 37 (65 pts), boolean chains 12, loops 3 (10 pts), match/switch 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d7233385b64252637e6065f9b0b84cb330563365824d5c82b37fb1cb10cab5"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_export::draw_plot (cognitive 81): datui_lib::chart::chart_export::draw_plot has cognitive complexity 81 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 12 (33 pts), match/switch 5 (9 pts), boolean chains 5 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"61415538041610ffe201a1cd82b89919788bf37ebda80bb3c18c6cd450e650d5"}},{"ruleId":"D2","level":"warning","message":{"text":"SortModal::jump_selection_to_order (cognitive 80): SortModal::jump_selection_to_order has cognitive complexity 80 (threshold 15). Drivers by points: if/else 20 (65 pts), loops 3 (12 pts), boolean chains 3 (nesting depth added 54). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b552edd625513e5f78268ec4e70d342652dae167515472befa8db06ee21a84"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::chart::panel_lines (cognitive 72): datui_lib::widgets::chart::panel_lines has cognitive complexity 72 (threshold 15). Drivers by points: if/else 32 (55 pts), match/switch 8 (12 pts), boolean chains 4, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"efea9f8e5f3cb9f81cd47ab1eba3dc03bc9037b8c4bb51446ed78a05395accad"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::field (cognitive 70): Reader::field has cognitive complexity 70 (threshold 15). Drivers by points: if/else 32 (37 pts), match/switch 13 (18 pts), boolean chains 15 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"251616da1edd26752d9bdb7a04d003cf14e87acf1f4a90d211b07437ea4bc165"}},{"ruleId":"D2","level":"warning","message":{"text":"App::analysis_key (cognitive 68): App::analysis_key has cognitive complexity 68 (threshold 15). Drivers by points: if/else 20 (36 pts), match/switch 8 (17 pts), boolean chains 15 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_keys.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f3ad9f217482efb85eb390132f7eb65b3fd8a680c90938ef1898d12ec534cd"}},{"ruleId":"D2","level":"warning","message":{"text":"App::build_local_lazyframe (cognitive 66): App::build_local_lazyframe has cognitive complexity 66 (threshold 15). Drivers by points: if/else 23 (42 pts), boolean chains 18, match/switch 2 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":3080}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcacd0a274d7d4e6cc0d9e7d1e456093ace85368a243faa07853cbfa1d343d48"}},{"ruleId":"D2","level":"warning","message":{"text":"App::home_key (cognitive 65): App::home_key has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (39 pts), match/switch 10 (22 pts), boolean chains 4 (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":"crates/datui-lib/src/home/home_keys.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f418ce5cca2162ef77c26c2756dc5c2f01e78b6dc6dc40757dbb2017cb6ce7a6"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::midi::add_file (cognitive 65): datui_lib::formats::midi::add_file has cognitive complexity 65 (threshold 15). Drivers by points: if/else 13 (30 pts), match/switch 11 (30 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef58bb335516a3931a86d1a9eb7fcf3f15dd7d3deff3c40f573e84a9708eaa6"}},{"ruleId":"D2","level":"warning","message":{"text":"SortModal::move_column_display_up (cognitive 62): SortModal::move_column_display_up has cognitive complexity 62 (threshold 15). Drivers by points: if/else 11 (42 pts), loops 3 (14 pts), boolean chains 6 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe81b09354f7f4acadc83e36e154f750cd6c5d16f5245084aae47dd7cbf68b3"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::quality_export::to_markdown (cognitive 61): datui_lib::analysis::quality_export::to_markdown has cognitive complexity 61 (threshold 15). Drivers by points: if/else 23 (38 pts), loops 8 (15 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_export.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"175c66c38ea79c701cc5f0aea795489ff84d39b6a2bc22000eba7e2ad80a71b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::record_inner (cognitive 59): Walker::record_inner has cognitive complexity 59 (threshold 15). Drivers by points: if/else 21 (41 pts), match/switch 6 (14 pts), boolean chains 4 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2162a3e4a05fdce3c3551779fb4f35ea0c08f78e645056c095ecd589737f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::sort_filter_sidebar::render_filters (cognitive 59): datui_lib::render::sort_filter_sidebar::render_filters has cognitive complexity 59 (threshold 15). Drivers by points: if/else 24 (47 pts), match/switch 2 (6 pts), boolean chains 5, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5b3e7aaedf8d208e628088893969da5e61d138c8f9cb82b2f7496f4f139c32"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::documentation::layout (cognitive 58): datui_lib::widgets::documentation::layout has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 6 (16 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/documentation.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4db02779fbf6100a6a7fc853d2d5e5a848c1e1e5f39aa311e3239fc77c413b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::dataflash::index (cognitive 57): datui_lib::formats::dataflash::index has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (38 pts), match/switch 4 (11 pts), boolean chains 5, loops 3 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataflash.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ee2894b9a079ac4e00539b99af7b99a67a4a8bdd07afd107da597c2d0cdb53"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::field (cognitive 55): Walker::field has cognitive complexity 55 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 3 (8 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 30). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe84a90759b020231f6700dca688d17d66c323d252834aca4456c4f869fc6559"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::home_view::preview_head_keyed (cognitive 55): datui_lib::render::home_view::preview_head_keyed has cognitive complexity 55 (threshold 15). Drivers by points: if/else 30 (44 pts), loops 2 (4 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"7113f13a2eb06c8749a6e1cd52977dd0a051d02a6695b41c540c22a0c7ff6b07"}},{"ruleId":"D2","level":"warning","message":{"text":"Footer::render_line (cognitive 54): Footer::render_line has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (39 pts), loops 5 (7 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/footer.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0b51c506e6deac9aacbf7423a1d271c71eb0656dcde8c91d5143cd3853fc14"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::fix::parse_message (cognitive 53): datui_lib::formats::fix::parse_message has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (36 pts), match/switch 3 (8 pts), boolean chains 6, loops 2 (3 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":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2deaf24c657c8a313c0c122f0452fecac332c4a7c99c2de83e8805347c8b7ce"}},{"ruleId":"D2","level":"warning","message":{"text":"EventPump::drain_from (cognitive 52): EventPump::drain_from has cognitive complexity 52 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 3 (8 pts), loops 2 (4 pts), boolean chains 3 (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":"crates/datui-lib/src/app/event_pump.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"2092a57649de6776c4da7ffc3e3a958972e16a8dd641e2dbbddf8ec10b67240a"}},{"ruleId":"D2","level":"warning","message":{"text":"Dictionary::parse_xml (cognitive 52): Dictionary::parse_xml has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (34 pts), match/switch 4 (11 pts), boolean chains 5, loops 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/dict.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9b931c00759a3b9e63198895fcf1f005cfc491473009d0a98f946d11047afd"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::chart::render_xy_chart (cognitive 52): datui_lib::widgets::chart::render_xy_chart has cognitive complexity 52 (threshold 15). Drivers by points: if/else 32 (36 pts), boolean chains 9, match/switch 3 (4 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe6b90939acd07af55daa528cd364ea9a28a4d351de57a693008bd00dca2206"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTableState::prepare_async_collect (cognitive 51): DataTableState::prepare_async_collect has cognitive complexity 51 (threshold 15). Drivers by points: if/else 27 (42 pts), boolean chains 8, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/buffer.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06854e5a9f609cf9fc001d16a1de5187e9f11fe0b0a43b92bc326c46e261163"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::build_listing (cognitive 51): datui_lib::home::build_listing has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (37 pts), boolean chains 9, loops 3 (4 pts), match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a39c5af76395e10cb70761ba9d369d4665c45f005822a881bcb8708eeab0b8"}},{"ruleId":"D2","level":"warning","message":{"text":"CloudConnectionConfig::validate (cognitive 49): CloudConnectionConfig::validate has cognitive complexity 49 (threshold 15). Drivers by points: if/else 28 (41 pts), boolean chains 5, loops 2, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ff90a2d2ee37b71c5bcb281acece6d50021c451b96c56bc7b0fe4e536628d1"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::query::parse_node (cognitive 49): datui_lib::query::parse_node has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (40 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"549fd5c4b0f98f23f470d42ce1473ebe161ef963808d8933e80866d1a8c72ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"FixReader::message (cognitive 48): FixReader::message has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 5 (10 pts), boolean chains 5, loops 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac387503c6838580ed90302332369e60ae7800bd3404848755379d039a2493be"}},{"ruleId":"D2","level":"warning","message":{"text":"Spec::parse (cognitive 48): Spec::parse has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 10, match/switch 6 (9 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/matching.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"306b586ca12968bc74438ba18b7fcbaa8f911e61e7bcf581b5a0d227de1f0e9a"}},{"ruleId":"D2","level":"warning","message":{"text":"App::quality_key (cognitive 48): App::quality_key has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 14, match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_keys.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7e14f9b8f5be366be3f78adb732a3c2a9518819be9149fd60adc03a646bd5b"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTableInfo::render_schema_table (cognitive 48): DataTableInfo::render_schema_table has cognitive complexity 48 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 5 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc15722a0737e4e7afc7c250e7ee590b6476a944922b2e2791a8f9e5bba7b71"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::value_counts_view::draw (cognitive 48): datui_lib::render::value_counts_view::draw has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 7, match/switch 4 (6 pts), loops 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":"crates/datui-lib/src/render/value_counts_view.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb44cf4f9d3bd1164e32faf2118d9ed2b87a3d9352eeedd9a574b6f38014731"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_cli::man::roff::inline (cognitive 47): datui_cli::man::roff::inline has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 5 (14 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/roff.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7126830674d484849e4c95149b90a89b5e77240e569ce6c51770ade6990a052"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::app::run::run_impl (cognitive 47): datui_lib::app::run::run_impl has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 10, match/switch 6 (7 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/run.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5538a17c384882880bcf5f1990985920569db73ca7019b552117f4631bd7e672"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_trend::lowess (cognitive 47): datui_lib::chart::chart_trend::lowess has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 7 (17 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_trend.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6dd1801a723f736641b84a13fb3f44e6c998d58014975a81e6099ca46200cb"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::catalog::check_dataset (cognitive 46): datui_lib::home::catalog::check_dataset has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 7, loops 2 (3 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"04994195019a2618404653d1020cd49dc6733040942abe06de6e710115bd213f"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::search::walk_inner (cognitive 46): datui_lib::home::search::walk_inner has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 4, loops 2 (3 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":"crates/datui-lib/src/home/search.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb6fdfa94d1307fee074ab9870185cab86f23b0e7cce12c87e43e732c096382"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::analysis::render_correlation_matrix (cognitive 46): datui_lib::widgets::analysis::render_correlation_matrix has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (28 pts), boolean chains 10, loops 5 (7 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d397895fd594d7759555f9e42e5b8b4626eb17a8bce270f934087f7d1f3f6279"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::main_view::data_quality_control_keys (cognitive 45): datui_lib::render::main_view::data_quality_control_keys has cognitive complexity 45 (threshold 15). Drivers by points: if/else 27 (35 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a98eea5e813fbfc86c183e21b3220818095273347bda967a480800f670f8a3"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::discover::classify (cognitive 44): datui_lib::home::discover::classify has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 11, match/switch 4 (8 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"498b875197ad97c3c55676216a1a9e4dc7b755ab630a61822694ea3066359ae4"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::hex_view::byte_rows (cognitive 44): datui_lib::render::hex_view::byte_rows has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 3 (8 pts), match/switch 1 (5 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/hex_view.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"54919cb584bf47f49208de68b8f90de15e43ed6c774f32d7d6c705e685c9905f"}},{"ruleId":"D2","level":"warning","message":{"text":"App::apply (cognitive 43): App::apply has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 7 (16 pts), boolean chains 2 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/applied.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd577b95f6ae7d9fbfe9036fc145d3af1575fa65241e330a86101ccb30faaa4e"}},{"ruleId":"D2","level":"warning","message":{"text":"App::background_failed (cognitive 43): App::background_failed has cognitive complexity 43 (threshold 15). Drivers by points: if/else 22 (38 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":4849}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49d57ca57ade45c4a3690030963200aa9ddf718c0d6288f5cd17180d033a60b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::query::parse_term (cognitive 43): datui_lib::query::parse_term has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 5 (12 pts), loops 3 (8 pts), boolean chains 5 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"4125061a2ec0853792c7afd54a5a8e0809eceb2680c26b76556d34efb8b421ed"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::main_view::mode_hints (cognitive 43): datui_lib::render::main_view::mode_hints has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5d8ea0612d9832812d2d77eb16a90fb4da04fac43344d4877fa330ba7bc56f"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTableInfo::render_notes_tab (cognitive 41): DataTableInfo::render_notes_tab has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 7, loops 3 (6 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a3746fe724bb2fb4b561b06c727f989f3098d40d23880fd1c13958e7920c3e"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_data::envelope_series (cognitive 41): datui_lib::chart::chart_data::envelope_series has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 4 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a6ab38b1dc59479fda68b96828b7cbe9f339141b5131f3eb57cf6b575408d6"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::main_view::analysis_control_keys (cognitive 41): datui_lib::render::main_view::analysis_control_keys has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (31 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c8e97f455ee5f965c6515471ac33bd1f808e2569ba33f8293d1b975b3eddb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdown::render (cognitive 40): Markdown::render has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (12 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/roff.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"63773c5fa1b5025ca241f20d4730c47cd07459204336c4413866869b75372388"}},{"ruleId":"D2","level":"warning","message":{"text":"App::quality_setup_key (cognitive 40): App::quality_setup_key has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 6 (13 pts), boolean chains 10 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_setup_keys.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"337b4450213767e8cb34a48c1217f6f12ee3ff1163b63e025d5f12d6cd25c617"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::sort_filter_sidebar::render_in_effect (cognitive 40): datui_lib::render::sort_filter_sidebar::render_in_effect has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (34 pts), boolean chains 3, match/switch 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9699e62fd98d90d507c597f9c8b2aae96f4229e7452800fa2ace49934e6fc7b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::discover::enrich_dataset (cognitive 39): datui_lib::home::discover::enrich_dataset has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 4 (8 pts), boolean chains 5, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee08a0cc7d70957fa81f4bc7cdafba889ae5278c590ed95d89bea0bb91004e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::loading::follow::spool (cognitive 39): datui_lib::loading::follow::spool has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 11, loops 2 (3 pts), match/switch 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d7860ca79b970400d8cd1dcbb79b414194c6ce5fe58a6a69eef45226e83e48"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::help::render_help (cognitive 39): datui_lib::render::help::render_help has cognitive complexity 39 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/help.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d9926fc28532741f7410d3620a607e1175cb0f2fe0a095dc92261a06659baf"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::home_view::render_preview (cognitive 39): datui_lib::render::home_view::render_preview has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"725144fd9b2b1591ec5cefd4104a45bd3c832d66804b5fdf3a6776d27f1092b6"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::sort_filter_sidebar::render_columns_tab (cognitive 39): datui_lib::render::sort_filter_sidebar::render_columns_tab has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (30 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ae326c611420252273e31e216ffafdebd62b25a5f73af03a3d5d912064b806"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::pivot_melt::render_grid (cognitive 39): datui_lib::widgets::pivot_melt::render_grid has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 5 (7 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/pivot_melt.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8f3613e60248149db60572fa70184c68181b493e4563b72897a97c05c4b6fa"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::ticks::calendar_ticks (cognitive 39): datui_lib::widgets::ticks::calendar_ticks has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 6 (13 pts), boolean chains 3, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/ticks.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc94bd968b7950b3a0371c0ac7730511dc7579f390b8b764d7499defee2b13f"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeState::slots (cognitive 38): HomeState::slots has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 10, match/switch 2 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":4587}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f8ce2697eacecf19e86cf33ec33bfe05367a34b08c87b19ed4a8b971365bcf8"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::catalog::command (cognitive 38): datui_lib::home::catalog::command has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 7 (13 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ec9272edddfa37dccc020f3cc92ff2e71090eaa2ec8e844622ca58b71abd8b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::documentation::lines (cognitive 38): datui_lib::widgets::documentation::lines has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 5 (12 pts), match/switch 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/documentation.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a678b091e05a819aaea02fa10a9ddf17ce64f01fb51559209e51e0beb91c2b5"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::inspector::draw_fields (cognitive 38): datui_lib::widgets::inspector::draw_fields has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (23 pts), match/switch 6 (10 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"16032f91821a306f64d97f7a0d2d91a8228799e34105315880c68aa271ba4c72"}},{"ruleId":"D2","level":"warning","message":{"text":"Fitted::cdf (cognitive 37): Fitted::cdf has cognitive complexity 37 (threshold 15). Drivers by points: if/else 25 (36 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":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9804ed811fc7c25524c294d46fe96dd54b87b24bbc93d6cbff14444dbc6f733"}},{"ruleId":"D2","level":"warning","message":{"text":"SdfReader::line (cognitive 37): SdfReader::line has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (31 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/sdf.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac974182993dd46d8b8f63590b367c1904f75098bed9ba28093e3aea5724ba97"}},{"ruleId":"D2","level":"warning","message":{"text":"App::spawn_home_probes (cognitive 37): App::spawn_home_probes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 3 (10 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3e80aafc326c8fcb1d3b0e0c95c07995748d3bc1c1217366b34535450e2b59"}},{"ruleId":"D2","level":"warning","message":{"text":"App::dispatch_event (cognitive 37): App::dispatch_event has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 5 (10 pts), boolean chains 2 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":3672}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dee7800e4eec00801e41ced4883fc34f014d840445ef3a65eb1d3bcb77bddb0"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::quality_report::coverage (cognitive 37): datui_lib::analysis::quality_report::coverage has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (22 pts), match/switch 4 (9 pts), boolean chains 5, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c3d0cddc15dcaa2d236701400cf3d521480145a20afdb0facb6ec4bbdeb0e9"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::framed_records::capture::pcapng (cognitive 37): datui_lib::formats::framed_records::capture::pcapng has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 4 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":3156}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef9ca0e3e8b4a6071949b393fa64186abc319842453e8a0c7fef29098a6c033"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render_findings (cognitive 37): datui_lib::widgets::data_quality::render_findings has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 3 (6 pts), boolean chains 2, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccc4f77a9638d394bded7c2dbce4893ce83aa58607363898d3c4093ce7f1cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::data_quality::trend_bar_fields (cognitive 37): datui_lib::widgets::data_quality::trend_bar_fields has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (28 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"59bb674e328a684dd6ac1f2a12cd28a16fffa63d7c09feaa8528489db10a6c47"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::sample_form::render (cognitive 37): datui_lib::widgets::sample_form::render has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 4 (10 pts), loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/sample_form.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a78130ce51b0aefa10168818827cf1d7456da17e917c1a13205d19abd8bb80"}},{"ruleId":"D2","level":"warning","message":{"text":"Fitted::fit (cognitive 36): Fitted::fit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 4, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"620330786a8da3b8528fa548ea3393e942e176f1341fee00632e5ecc8e455f19"}},{"ruleId":"D2","level":"warning","message":{"text":"SortModal::move_column_display_down (cognitive 36): SortModal::move_column_display_down has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 2 (9 pts), boolean chains 2 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52d12473a869d665ebf3224ec7bf2b1159f4fe6b462e966b18d4de3156fd460"}},{"ruleId":"D2","level":"warning","message":{"text":"Watcher::run (cognitive 36): Watcher::run has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9045ec6ef16e0466837425f98255b35294f35bd7321a1067218d921e0ba709"}},{"ruleId":"D2","level":"warning","message":{"text":"FramedRecords::read_from (cognitive 35): FramedRecords::read_from has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (9 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c55527b8348eca356c3bc9b932330ded0ddc53bd1cf4ed098436ed27608a07"}},{"ruleId":"D2","level":"warning","message":{"text":"PlotMarks::redraw_axes (cognitive 35): PlotMarks::redraw_axes has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 6 (15 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/glyphs.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49afc7d7dafdc6ddab2a51f571e822d9d9d13a48f3a06a6f42aea48a921b949"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::discover::directory_format (cognitive 35): datui_lib::home::discover::directory_format has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (25 pts), match/switch 2 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"e795d4c723977b3feeb7f7faf3e8cc212fcfad605f34b164275b87443b30e0c2"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::discover::scan_dir_with (cognitive 35): datui_lib::home::discover::scan_dir_with has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 4 (11 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eec3551b4fc46e88d632405f99ae3abe88dd3e87f29d977ff1df2b0b14a972"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::ulog::columns_of (cognitive 34): datui_lib::formats::ulog::columns_of has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/ulog.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"017a3a36b9df049202bec7db03019e7b972bb9e808a3641a20060803035758a5"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::datatable_main::render (cognitive 34): datui_lib::render::datatable_main::render has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/datatable_main.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a246e9fc4c33af19044038fd28e333d66291893b76a6ade2d7f56eddefe379"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::home_view::render_list (cognitive 34): datui_lib::render::home_view::render_list has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 6, match/switch 3 (5 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f3268b9032ecdd6274975ccef25c3c0a8a2101d6ad4faf36597b5f00637661"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::view_sidebar::render_list (cognitive 34): datui_lib::render::view_sidebar::render_list has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/view_sidebar.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"338b3b95733c3828d2f8127ecba29f7bd83b9bac337c4a7bfd50e98df6756699"}},{"ruleId":"D2","level":"warning","message":{"text":"VcdReader::token (cognitive 33): VcdReader::token has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 4 (7 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/vcd.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91b86df15ffc41ef7f792d720567acf7bbcf4d765cebfffe1f62be10ef39931"}},{"ruleId":"D2","level":"warning","message":{"text":"App::table_status (cognitive 33): App::table_status has cognitive complexity 33 (threshold 15). Drivers by points: if/else 23 (26 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/footer_state.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b32e550f62189a7df2f341b08dde2db488bf1e0e891cfb8d7e9e2b3dac4e86d"}},{"ruleId":"D2","level":"warning","message":{"text":"App::info_key (cognitive 33): App::info_key has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 13, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/info_keys.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae37ffe963e038abc0a83564aea4034a273c79d6ac65620f0a76cd8042d941a5"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTableState::query (cognitive 33): DataTableState::query has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 5 (9 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/query.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"b432c33f6731847b1442a3011233bdf5de5272e2a60efa99fc6f33a2ece173b8"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_plot::trailing_mean (cognitive 33): datui_lib::chart::chart_plot::trailing_mean has cognitive complexity 33 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 5 (9 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_plot.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b144e2c809221bce15ef0a4d4a7deb7bfc1bd112d24cb57c72abaeadf50756"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::audio::read_aiff (cognitive 33): datui_lib::formats::audio::read_aiff has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/audio.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f134ccce40ef9b5efde48d12d2d369df3b04a37320fb784fc3f6230baad7ef"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::help::lay_out (cognitive 33): datui_lib::render::help::lay_out has cognitive complexity 33 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 5 (12 pts), match/switch 2 (4 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/help.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c5618ecb9b74bcf904057a297be0de03a6934be473fe88f5d1cdd503ab944b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::analysis::render_distribution_table (cognitive 33): datui_lib::widgets::analysis::render_distribution_table has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (22 pts), loops 6 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda03a683dc34e6d0bc4d9f9c8b96a03b6c9b010a5952ee1ac7ba4ed8254464f"}},{"ruleId":"D2","level":"warning","message":{"text":"FramedRecords::open (cognitive 32): FramedRecords::open has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 6 (9 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1993818af0829d566d5f6b57fff1d88d7c367e0910e2b1ac0aae33d1980fe9a"}},{"ruleId":"D2","level":"warning","message":{"text":"App::run_quality_compute (cognitive 32): App::run_quality_compute has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 6 (14 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_runs.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f0c78e3f48e1f264d918bf7dcab6893507b42661d1ea272e7ed6993038f94b"}},{"ruleId":"D2","level":"warning","message":{"text":"App::counting_event (cognitive 32): App::counting_event has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 2, match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/counting.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d5fce1c49194b97cfd90e7faa2598d2e5cd87732b5ece3a2352333eaa62874"}},{"ruleId":"D2","level":"warning","message":{"text":"App::spawn_load_phase (cognitive 32): App::spawn_load_phase has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 10 (22 pts), if/else 5 (8 pts), boolean chains 2 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"640c17c4cebb21d62acac9d6abe09ee358bf330dc415558a92a05926827894cd"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::data_quality::profile_temporal_lazy (cognitive 32): datui_lib::analysis::data_quality::profile_temporal_lazy has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 6 (12 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6738d82a55247bf38b0f782c9c647df5724045454679e37ff8cdfc493dc8fe7"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::quality_intent::split_allowed (cognitive 32): datui_lib::analysis::quality_intent::split_allowed has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (12 pts), match/switch 2 (7 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_intent.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4305a58c13cc1982dd53fab9d61f04bf89586b2d90e59f007c66591a936ac95"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::quality_trends::expected_gaps (cognitive 32): datui_lib::analysis::quality_trends::expected_gaps has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 6 (9 pts), boolean chains 4, loops 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_trends.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e14bb6e4dac90bf1e12ba6b8d7c79260e7b87d29da0ee3f1ec2b2cebbd4b89"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::excel::excel_infer_column_type (cognitive 32): datui_lib::formats::excel::excel_infer_column_type has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/excel.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0191b05a9b1c3ab1de4ecc11a4a49dab824fdfcde5904cdeef7457d709501f"}},{"ruleId":"D2","level":"warning","message":{"text":"EventPump::terminal_mouse (cognitive 31): EventPump::terminal_mouse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 2, match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/event_pump.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"487487d9bdd330c8a67162ed6f5a07d8d03f38bf6b8fbf06d6357888909402b9"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_trend::copy_text (cognitive 31): datui_lib::chart::chart_trend::copy_text has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (6 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_trend.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b6e9a5fa4d72aadc1773ac4c2a2f730ec755c66d641d983b1e0a7b7f6e0675"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::home_view::section_header (cognitive 31): datui_lib::render::home_view::section_header has cognitive complexity 31 (threshold 15). Drivers by points: if/else 27, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28b67b31c98ebaf3bd0a19ea2cf442bfc699173873b36902157c4717ee3125f"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render_setup (cognitive 31): datui_lib::widgets::data_quality::render_setup has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 6 (8 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"990d49f5aea6ae1786aa02a77488accd522bcf262376d63168197bf79d570061"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::inspector::footer (cognitive 31): datui_lib::widgets::inspector::footer has cognitive complexity 31 (threshold 15). Drivers by points: if/else 20 (26 pts), match/switch 3 (5 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"6243b41094b8c42e9ecd806873a18e13bac5070492347352f19e58616c2b1bc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Step::python (cognitive 30): Step::python has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 5 (9 pts), boolean chains 4 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"50455a02527edc70ea672ea78b5b6b9da7486640169d5808eb55f3d1f82df747"}},{"ruleId":"D2","level":"warning","message":{"text":"GpxReader::scan (cognitive 30): GpxReader::scan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/gps/gpx.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"755af0b3a70063c23291b7ef2bd15561bf0c6b6b862d9d1d3cef42581674f9ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::blocks (cognitive 30): Reader::blocks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 4 (5 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"4909df29714ecd22ed2419135f4bd9b91a171fefe7b269ac7eebd3fb1c84b52b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::schema_union::sample_files (cognitive 30): datui_lib::formats::schema_union::sample_files has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 5 (7 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/schema_union.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e083c8800d0ac77a85b6561d3089250821a05ec7614dcd524575c4eb6367a46"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::axes::log10_sets (cognitive 30): datui_lib::widgets::axes::log10_sets has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/axes.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c18cd3065ac311861115c59bf9dcd2bf6b4024f7a61ac3e90d04526f35321f"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::data_quality::read_lines (cognitive 30): datui_lib::widgets::data_quality::read_lines has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 5 (9 pts), boolean chains 6 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d644e868694e98f7516749ec6ec8fd284af2a4e3ce16741600a3e2a61373d2"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render_intervals (cognitive 30): datui_lib::widgets::data_quality::render_intervals has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (21 pts), boolean chains 7, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"db81005194df5f1a253edb0fac10280e908c0a1043eddb4086ef785968b68794"}},{"ruleId":"D2","level":"warning","message":{"text":"Compiler::field (cognitive 29): Compiler::field has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 6 (9 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f190240d34945406500624ea98482997a647ec69a8739603eedf0158a91827"}},{"ruleId":"D2","level":"warning","message":{"text":"App::home_open_selected (cognitive 29): App::home_open_selected has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 5, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d39aa697bbe4bf7f07cbe5c6084c6b226799b1c6da64aee494860315e4bb518"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_data::prepare_aggregate_xy (cognitive 29): datui_lib::chart::chart_data::prepare_aggregate_xy has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 6 (8 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"953e0ee1b417e456e1c6cb926caed19cf947644626c6af26acec3e7b0193aedf"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::numpy::dtype_of (cognitive 29): datui_lib::formats::numpy::dtype_of has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (11 pts), loops 2 (4 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/numpy.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"672a97122ff5b7f9c0ac1ba007402ef2af06157c54e3123b98d5e0691c3455ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Fitted::ln_density (cognitive 28): Fitted::ln_density has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"556d1eb5693928c7e4f2bd8f0cc55c790092fc95a898c5e16b227c231bbbb39d"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartModal::row_order (cognitive 28): ChartModal::row_order has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 2, match/switch 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf81632d5d4da443613409467bc6c1293cc3e05a72775c9164bc45815f88bdc9"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioSource::signal_report (cognitive 28): AudioSource::signal_report has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/audio.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"30830c01302799342fe8ba66bdd0aad81157291adeba10bf77ea81413f93b4be"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::app::startup::read (cognitive 28): datui_lib::app::startup::read has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 5 (6 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/startup.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f493b86597e2341828ff1cbe45f34650530fe80a1eae7e0c37a2da949e9405"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::dataset_files::open (cognitive 28): datui_lib::formats::dataset_files::open has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 4, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataset_files.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e6180ec371d0c40d58c708145e403a4c458c92d3dd00c7fd3ee3abb33da7a12"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::midi::parse_track (cognitive 28): datui_lib::formats::midi::parse_track has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5d2dfab794b189713170678d593860325fb7d444ee96148c41cf9693dfa8db"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::past_calendar::guard_expr (cognitive 28): datui_lib::past_calendar::guard_expr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 8 (11 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/past_calendar.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d1c252ca6f3fe1ed2eaf240b6024ed07ecf1de475a07ff1a90cbee4f6b5a7b"}},{"ruleId":"D2","level":"warning","message":{"text":"App::focused_text_mut (cognitive 27): App::focused_text_mut has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 5 (10 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/paste_keys.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cf7d0e28696f4bd35af61411217b587787a679fe38b7146c987edc05d88266"}},{"ruleId":"D2","level":"warning","message":{"text":"Loader::first_step (cognitive 27): Loader::first_step has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dce22d2d13e80d067f6432ae4d86dfc0aa8a8f4f0ecd73c3488a9566b655ea"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTableInfo::render (cognitive 27): DataTableInfo::render has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4, match/switch 3 (4 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":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"701a108658767b8875fe88564d0083db373815193e4e401ee6ae9475a14a54e8"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTable::draw_columns (cognitive 27): DataTable::draw_columns has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (20 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ccffa2b37fc17c001a0e3faa414a815aaaa24cf17ba3fe85f89ac74c779742"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::data_quality::profile_quality (cognitive 27): datui_lib::analysis::data_quality::profile_quality has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb27b1f422ac7628264dcde857d7a29232376e7c4fb9d57a290de58efa7274d"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::quality_report::build_report (cognitive 27): datui_lib::analysis::quality_report::build_report has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (5 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":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92faa5c0ab1ddc21fc8202eed7355674be50b55bd6002a1de23601cc200d69b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::app::form::key (cognitive 27): datui_lib::app::form::key has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 5 (8 pts), boolean chains 7 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/form.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"909932b5a1aa54180cdfd07d2b9cf97cfbc6acc2be7122cc4a5f9ebf362994ca"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::cloud::cloud_sources::discover (cognitive 27): datui_lib::cloud::cloud_sources::discover has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (6 pts), boolean chains 5, loops 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_sources.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06196ec173400d1980353f5961407beb8eed1a17c1f2688b425e93044149c69"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::lines::field_counts (cognitive 27): datui_lib::formats::lines::field_counts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (7 pts), boolean chains 3, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/lines.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"21813abfed1ad5937518a454347e30e83c258c372885d58ae989b6fc13ca46a8"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::numpy::leaves (cognitive 27): datui_lib::formats::numpy::leaves has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 3 (7 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/numpy.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dddc424d8144d0fa1188a82c273b5da526338e30141d8975116af33eff697e5"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::chart::render_bar_chart (cognitive 27): datui_lib::widgets::chart::render_bar_chart has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (23 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ea7d6c852b7e39c1616e7c0c07cd60db855ee028f7792da640c2bfe9d8472c"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::info::wrap_words (cognitive 27): datui_lib::widgets::info::wrap_words has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6728143446b0b1a2fc3a561ce5a1973297f5a7c000094518321489fbdfe442"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::inspector::render (cognitive 27): datui_lib::widgets::inspector::render has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13, match/switch 6 (7 pts), boolean chains 6, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"01167aba0b62ddfa33b576b7b3a477057a7e6fa75ca68346241a7d11bbf46964"}},{"ruleId":"D2","level":"warning","message":{"text":"FramedRecords::decode_from (cognitive 26): FramedRecords::decode_from has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":2441}}}],"partialFingerprints":{"codehealthFindingId/v1":"3514a3d1f3ff178accf16d7274e9d35419c5ed1c8cc0625bc01aefa77cd03ae3"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::match_rules (cognitive 26): Reader::match_rules has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"af02c2418c22bce581813ac19b640acd078a0ae0bd72469f88f32e2c6df4d7ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry::load (cognitive 26): Registry::load has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/registry.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"044a314c435a12a1970999fde3b60d33616e436fb13dc0d33b69adcbb7a68983"}},{"ruleId":"D2","level":"warning","message":{"text":"App::build_lazyframe_from_paths_with (cognitive 26): App::build_lazyframe_from_paths_with has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce055a56d22181be47961ac768a29a9fa6ebb8ac8bb62bf5ced7736e6fcd497"}},{"ruleId":"D2","level":"warning","message":{"text":"TextArea::render_wrapped (cognitive 26): TextArea::render_wrapped has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/textarea/wrap.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"723cf1e119cd34862f189fbe20de9d619caf9e2189096922c56e6032df51fc2d"}},{"ruleId":"D2","level":"warning","message":{"text":"Picker::render (cognitive 26): Picker::render has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/ui/picker.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f50bc8fed128427022a3e002ddf28acb1111472425c2d53143dffc714fdbe5"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::app::draw::find_move (cognitive 26): datui_lib::app::draw::find_move has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 5 (11 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/draw.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c050d78725569a36267e62c584a564b31b235241c9ba02f3bedacba1f144f872"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_data::prepare_bar_aggregate (cognitive 26): datui_lib::chart::chart_data::prepare_bar_aggregate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5, match/switch 5, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2800813d4d721fcddec8753d5480b77d86d678aa948123b67808cbe7a8cdcb"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::browsed_section (cognitive 26): datui_lib::home::browsed_section has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":2636}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe50aebf35fe8729edf5f12e62fbaa98138d554ef1a56857605fc564ee41d42"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::analysis::render_distribution_histogram (cognitive 26): datui_lib::widgets::analysis::render_distribution_histogram has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aa55583137cc026a80894134b0e695d0e11d98290751381251b11a3862c2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_pyo3::args_from_kwargs (cognitive 26): datui_pyo3::args_from_kwargs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (8 pts), match/switch 2 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-pyo3/src/lib.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5597b94b2c9e5b7fd921d6fc6441ba1faf10aea9ed2358e53f67449b97bb8f3b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartModal::pool (cognitive 25): ChartModal::pool has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb54db4d459d8930d07ddb4ab68b0af213b7a6c76e2a9edca1eb8129f474744"}},{"ruleId":"D2","level":"warning","message":{"text":"Registry::listing (cognitive 25): Registry::listing has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 7 (10 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/registry.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"536761fcc5d1d45af57c14ccf7b8a8aa181c99c6f618e09b09e6262db8be142b"}},{"ruleId":"D2","level":"warning","message":{"text":"App::click (cognitive 25): App::click has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/pointer.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ef2c4c9f3068416408c154f585f85dcb9a5718453dcce1b56ecc44d2e4ed19"}},{"ruleId":"D2","level":"warning","message":{"text":"App::list_cloud_sources (cognitive 25): App::list_cloud_sources has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (7 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e30c8b1f02681195c52197071f461f084af7d47f7ddd2eebede5f1f22e16b2d"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTableInfo::render_detail_list (cognitive 25): DataTableInfo::render_detail_list has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1a864d184e6aedf8258788d2fd1f25eb7ca06902361ae5d938557cba4d34ab"}},{"ruleId":"D2","level":"warning","message":{"text":"FormView::draw (cognitive 25): FormView::draw has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 3 (4 pts), loops 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/ui/form_view.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a908be483d759794624fcd18a91d4ede2165f698690a632568c7b338dbbfb77"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::data_quality::largest_material_change (cognitive 25): datui_lib::analysis::data_quality::largest_material_change has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":4286}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a046bd81be376222206feabe549481af7f033cc11eecbcf972e6ab41691afb"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::statistics::rank_correlation_matrix (cognitive 25): datui_lib::analysis::statistics::rank_correlation_matrix has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/statistics.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"31df4afa0206e613ebf6915b9ef7f27074a95272c0caf208bd0d0422ffd46978"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_export::draw_bars (cognitive 25): datui_lib::chart::chart_export::draw_bars has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (22 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a877b0e6b1fc40e36c1984149753943e0b5edf486b5630b491f46d3c641766"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::dbc::tokens (cognitive 25): datui_lib::formats::dbc::tokens has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dbc.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b942b37abbbbccd92716ef3055a006f77ba02c3552c05544e065b96071e586a8"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::catalog::columns (cognitive 25): datui_lib::home::catalog::columns has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f4a14ff896f7b4f3c54e2f8f0d565b3ad39649dc633815beac9d30ceef6d09"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::home_view::rows_block (cognitive 25): datui_lib::render::home_view::rows_block has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4 (5 pts), match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e0e8bea5ba33db5f2f63f26f85e16592bbe3726fd994aed1ba12e5fa17a0ef"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render_interval_detail (cognitive 25): datui_lib::widgets::data_quality::render_interval_detail has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts), match/switch 4, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad87f967f8713c90ea518c4663d2f76ce24cc82db8091b94e80e64d4fd5443d"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartModal::set_mark (cognitive 24): ChartModal::set_mark has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 3, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"2173d8483c1ffa7c41378d029c6e98297f013f28016cbb14925482c85867f260"}},{"ruleId":"D2","level":"warning","message":{"text":"DatasetSchema::ranges_of_columns (cognitive 24): DatasetSchema::ranges_of_columns has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/schema_union.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e79d2b8a2f89af9c39fe35bf5c0a6196117ed40362636912754fc0d08b273a2"}},{"ruleId":"D2","level":"warning","message":{"text":"App::follow_mark (cognitive 24): App::follow_mark has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, match/switch 4 (6 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2354ab658db26a2bf07cc9613d70bec65c86014e0c60c242bfdb3fe34b6bd19"}},{"ruleId":"D2","level":"warning","message":{"text":"App::view_score_details (cognitive 24): App::view_score_details has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/view_apply.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"1633d544f326101cc42ddb861f92afee4d63f62ae071d1efa0526756454dc637"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::config::merge_tables (cognitive 24): datui_lib::config::merge_tables has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 3 (8 pts), loops 2 (5 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":2423}}}],"partialFingerprints":{"codehealthFindingId/v1":"833dd212ff4abf89362cdde7dad44a3b529646c57c515fb3df111b8db8ff011c"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::files::matching (cognitive 24): datui_lib::formats::files::matching has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/files.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e107278b224863704a08dae05b25a52a35a516562f3ba9845abbb02ea5aa1e47"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::chart::render_grouped_bars (cognitive 24): datui_lib::widgets::chart::render_grouped_bars has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"732611e60164a2fdaef8ef67310322b3f1e65a72a9e09effc37b26687a133cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::inspector::render_drill (cognitive 24): datui_lib::widgets::inspector::render_drill has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"21dff58f1a6d20a368131a6dd08644a9ac6207b5bae97a8d4474fd46bbc7cd9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Fitted::discrete_quantile (cognitive 23): Fitted::discrete_quantile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (5 pts), match/switch 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f00ac4592f1905f82ae75686654d759fe06b52d1001d8d3bc34bdf79b711241"}},{"ruleId":"D2","level":"warning","message":{"text":"Dictionary::parse_toml (cognitive 23): Dictionary::parse_toml has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (7 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/dict.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ff8357c0401e1608351e601bfa7a44cf374295312c874b025bf2d43864ca3a"}},{"ruleId":"D2","level":"warning","message":{"text":"App::typed_into_focused (cognitive 23): App::typed_into_focused has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/paste_keys.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"841d0d1a7527701fc0817ac3fc44aea4cb6b79b88e8568bcd4983a38589105f9"}},{"ruleId":"D2","level":"warning","message":{"text":"App::sort_filter_key (cognitive 23): App::sort_filter_key has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/sort_filter_keys.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b41a9d0162ac43671267cbf851f2967c3c867b280b8378ccd881969b36c7c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"App::take_follow_rows (cognitive 23): App::take_follow_rows has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 10 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd790dc3530db9851fcfcc5879600a64e5cdfae001f1d6794d5d682019be351"}},{"ruleId":"D2","level":"warning","message":{"text":"App::install_dataset (cognitive 23): App::install_dataset has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 7 (10 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f3ce32488a83d87952fec2b33cf7ab0f8a6e5bbc93b0ae7eea6f38fa808f8c"}},{"ruleId":"D2","level":"warning","message":{"text":"Counter::find_row_end (cognitive 23): Counter::find_row_end has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (6 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":"crates/datui-lib/src/table/csv_marks.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a691a05b1b10f28d6d11d8c659034d1c11c8e62a335684417f2cf5be541e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::data_quality::drift_observations (cognitive 23): datui_lib::analysis::data_quality::drift_observations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (8 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":5292}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfe57c3cffb379bbfc98aaa9982519c2b2d67b2576d45ef651585770bd7a0bc"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::readers::csv::from_csv_paths (cognitive 23): datui_lib::formats::readers::csv::from_csv_paths has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, match/switch 2 (5 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/readers/csv.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0f9311416c1d2f2b13a2af7d92d7bebb102a412e5d080fe529a810f843495d"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::door_name (cognitive 23): datui_lib::home::door_name has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4 (8 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"33062b89977b2166ef54ab80e621adb3f00ec1636d3c42b36f073bb332e4d3f0"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::input_strip::render (cognitive 23): datui_lib::render::input_strip::render has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/input_strip.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1545833b61c62c13df369f8295a3433d143eec992095a30be792f0456ae665c6"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::typed_value::parse_duration (cognitive 23): datui_lib::typed_value::parse_duration has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, 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":"crates/datui-lib/src/typed_value.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95537fad0dfc1b9ed76160e2b8e82821bce3fe7bdd3162404467298ae502aad"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::inspector::draw_value (cognitive 23): datui_lib::widgets::inspector::draw_value has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bdb9cdd267dbbad783450084520adab6aa93e0fdea308209289b2276ec2aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::inspector::draw_table (cognitive 23): datui_lib::widgets::inspector::draw_table has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":2419}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20db515f68053ed92d897d34ac28e03212e255d6ce3b6e392359346fca43984"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_cli::man::render_command (cognitive 22): datui_cli::man::render_command has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (4 pts), boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/mod.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1e2be2ab354e365fc4ca75e3f7a4b13ab69b755e2703acab8bc9cb6a43a1ce"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_cli::settings::render_settings_markdown (cognitive 22): datui_cli::settings::render_settings_markdown has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (7 pts), loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/settings.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"e331e3f2ae855fddfeec6668132acc4f3b2762c76444848b0b39c3bc79e71320"}},{"ruleId":"D2","level":"warning","message":{"text":"Script::render (cognitive 22): Script::render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (10 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"78754f71a4ecff3f542b2429dc21deafeff800ea6bf9b50e4edf68899479d420"}},{"ruleId":"D2","level":"warning","message":{"text":"Spec::open_rows_in (cognitive 22): Spec::open_rows_in has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/open.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"656bf19e0a75b5be744b144579c2b7f389897f2c8b1245403beec5483398271b"}},{"ruleId":"D2","level":"warning","message":{"text":"App::value_counts_key (cognitive 22): App::value_counts_key has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/value_counts_keys.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"77477f0a53635e9fc4df120876487de910dea5995100f475a737eda03ad4b8cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Tail::read (cognitive 22): Tail::read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ebb815fad064ed54bac2a5ff6c84ca5a9d445b203b3cc1de539ac65372c018"}},{"ruleId":"D2","level":"warning","message":{"text":"Tail::end_record (cognitive 22): Tail::end_record has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00c92b6367af673e2547017c2b8e9feb3aba4cd968363d92c9e3c4a11c1372d"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_data::prepare_histogram_by (cognitive 22): datui_lib::chart::chart_data::prepare_histogram_by has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"251ce25e3a7477d00c09409571d5a696d7e7d1ace981cd6e38dca861d52ad4e2"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::cloud::cloud_hive::split_points (cognitive 22): datui_lib::cloud::cloud_hive::split_points has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 4, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_hive.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bc20abe8411e005a1b5510d6e6beb0751f814fe0eb1c2feb55cf653d9a748c"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::cloud::cloud_hive::list_range (cognitive 22): datui_lib::cloud::cloud_hive::list_range has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (6 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_hive.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68c808cdd377b4dd63850d722071482d40a3a4d56e4d26e78e54d52ac01a1ed"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::export::python_script::source (cognitive 22): datui_lib::export::python_script::source has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14, boolean chains 6, match/switch 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cbda7fbdcbbb6d744e2774f756c3f2a688519e47421ef71eada40a8c00b3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::command::route (cognitive 22): datui_lib::formats::command::route has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/command.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9379a7d266e48fcdf5cafadb0e505d9261bec11fb1b9daaac385f28c78d139e2"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::dataflash::columns (cognitive 22): datui_lib::formats::dataflash::columns has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataflash.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dfc09df2a306fe97d35c3af042be4ebba9541a68284b05f6b1e649ad12beac"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::fixed_records::decode_values (cognitive 22): datui_lib::formats::fixed_records::decode_values has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 5 (9 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fixed_records.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f182b519fdd668c58770200679b76ccf5815ac9e23d779455a1f4cfc7d83a1f2"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::framed_records::sources (cognitive 22): datui_lib::formats::framed_records::sources has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (6 pts), match/switch 2 (6 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":2676}}}],"partialFingerprints":{"codehealthFindingId/v1":"10540b978c726bf01154a335982f98de26696c1ee272e8a34a3cb2e4661ebe97"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::midi::parse (cognitive 22): datui_lib::formats::midi::parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bfff25b7c361a06dec50f73f6a6594e54a640aafa864ca36876aeeb403c2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::apply_known_facts (cognitive 22): datui_lib::home::apply_known_facts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08c142fa6b80023e6e8c738c5ae69b982969113dad82a0985e29b49c6ad09ad"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::typed_value::text_of (cognitive 22): datui_lib::typed_value::text_of has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/typed_value.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a274f7b9056f8737d8b858610e3f7807dd52774f663eece478ee0266273085e3"}},{"ruleId":"D2","level":"warning","message":{"text":"EventPump::classify (cognitive 21): EventPump::classify has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/event_pump.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac63b00fa5a7ff41ac9c3258ede54d7d8240ea9b24e4e4ed3178b883d8126a17"}},{"ruleId":"D2","level":"warning","message":{"text":"ConversionFailure::sql_message (cognitive 21): ConversionFailure::sql_message has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 6, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/error_display.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c67860e8adde7fac9676cecba7e44d1a9e1f6ee5f5f147210e20bfe2af0295"}},{"ruleId":"D2","level":"warning","message":{"text":"App::hex_key (cognitive 21): App::hex_key has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/hex_keys.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd9869f7c57b611c432805f6eb4a2399e79b35db1d226b8f75a2b8fb7404124"}},{"ruleId":"D2","level":"warning","message":{"text":"App::save_view_form (cognitive 21): App::save_view_form has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/view_apply.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca939836dad965a25563a051ee1386a92970e0f57a35ae9ee694a44d1fdc293"}},{"ruleId":"D2","level":"warning","message":{"text":"App::view_key (cognitive 21): App::view_key has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/view_keys.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"81edcc9d6de5a96fb70f41c81329feb22a54a3999deb8d8dbe380e44fd4b4756"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTable::slice_column (cognitive 21): DataTable::slice_column has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"8154ccb01b08a9fc6e028dc2fa1fbddb4d9d920f3ae1f5c6b698b33e866d233b"}},{"ruleId":"D2","level":"warning","message":{"text":"TextArea::render_line (cognitive 21): TextArea::render_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/textarea/render.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a80722f9043164d693dd8594f92856dfe18d2fdb6a254cddd25c064ac10c2bc"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::quality_report::checks (cognitive 21): datui_lib::analysis::quality_report::checks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5fd90fd21206e7e5c3e261d338a5148a10a3f3181e0814414c1f4ef3393f9b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::app::hex_view::find (cognitive 21): datui_lib::app::hex_view::find has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"38166cf25140ca0dd19247fb33cb710b631022462015b11451f66972a15e9b95"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::app::hex_view::readings (cognitive 21): datui_lib::app::hex_view::readings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e7cfbd95362218de6a3da350bbec06ba46630f35a613c268a010d92766c944"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_export::svg (cognitive 21): datui_lib::chart::chart_export::svg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11, loops 6 (8 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fd965ae399cda17b59abc37002a0c871aa2f8bc5294ed70b44536e3744dfbd"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::cloud::cloud_command::split_command_line (cognitive 21): datui_lib::cloud::cloud_command::split_command_line has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 3 (10 pts), loops 3 (7 pts), if/else 2 (4 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_command.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b31c1c420cc4954ad2c35d5516bcfa32300ecf49c6aa7955b842e03a98229e"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::cloud::cloud_sources::resolve_among (cognitive 21): datui_lib::cloud::cloud_sources::resolve_among has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 10 (14 pts), if/else 5 (7 pts) (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_sources.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"04257f66f54b564d673377d67bd395845c152fffb92f075f3b6c64631a130f78"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::fuzzy::score_from (cognitive 21): datui_lib::home::fuzzy::score_from has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/fuzzy.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"793f29f4549cb548df9d5638d3b3ca7b7ad734c9777e909e76992e5f2a21655a"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::help::wrap (cognitive 21): datui_lib::render::help::wrap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/help.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc3cc196fdd8dd8cee93175ad1dd9425b74e07128cd2e81364054a3c8763e94e"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::hex_view::inspector (cognitive 21): datui_lib::render::hex_view::inspector has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/hex_view.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c322675e9793ec1bba11ea4a3c68737b7a2716e9c791a24b2a2e392f007f1305"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::home_view::render_path_list (cognitive 21): datui_lib::render::home_view::render_path_list has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e994513010e42654f643be4a504acd671e4dd3ceb4f53546326dfe931380b88"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::overlays::wrap_help_line (cognitive 21): datui_lib::render::overlays::wrap_help_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/overlays.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bf71e2d2fad4c19e676d031bc89318f3a863dbad081e24c6aedb4a64503403"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::data_quality::render_overview (cognitive 21): datui_lib::widgets::data_quality::render_overview has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"c251ec8b85137af11b3ba3e68b1b6c53b4929535b93d57431e47c81a2065cc1e"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_cli::man::render_config_file (cognitive 20): datui_cli::man::render_config_file has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/mod.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"43aff7674725e4b0171aac8e36543fab74f6fda2883293297eb98352589524bd"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_cli::man::plain::args (cognitive 20): datui_cli::man::plain::args has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/plain.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35def5baf0dff5e625e6974beeb1b976d13c8a5dc63758aa146ff576255d0f5"}},{"ruleId":"D2","level":"warning","message":{"text":"AnalysisModal::plan_choices (cognitive 20): AnalysisModal::plan_choices has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_modal.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aebdc94f0bf549236d6130676a828209f23d8859a98960ef3263d26d2e3ea8"}},{"ruleId":"D2","level":"warning","message":{"text":"QualityScope::parse_command (cognitive 20): QualityScope::parse_command has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"688e8e38464b78da0efe7ee742802c24991f853dc4636ac8e087aab90965b2ce"}},{"ruleId":"D2","level":"warning","message":{"text":"Drawer::draw (cognitive 20): Drawer::draw has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/draw.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"646b4c8a507a28dc80e9a754f912aa20bd7a0cf7c9867838a3a67574c25ea1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"SortModal::move_selection_up (cognitive 20): SortModal::move_selection_up has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (4 pts), boolean chains 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. This shape REPEATS in the file: one other method here (SortModal::move_selection_down) 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":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"4464455cdf272549c31bd8128bb3e112ddd25b44b3e38657dbc53c75035345ad"}},{"ruleId":"D2","level":"warning","message":{"text":"SortModal::move_selection_down (cognitive 20): SortModal::move_selection_down has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 1 (4 pts), boolean chains 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. This shape REPEATS in the file: one other method here (SortModal::move_selection_up) 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":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"69396583505b02e4173d7198fef9a0b64802c1bb49454012e0f4c525cde725fb"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplyScanner::feed (cognitive 20): ReplyScanner::feed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/terminal_color.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbb9fb74f236235ea2a5ba4316509fb3f90a86705b12203af587e8e46b550af"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartRequest::from_modal (cognitive 20): ChartRequest::from_modal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, boolean chains 7, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_jobs.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a71f82ddba2637e1c19304182551a0066b4dae7cc1472053b322010cc48b85"}},{"ruleId":"D2","level":"warning","message":{"text":"Drawable::of (cognitive 20): Drawable::of has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_plot.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3fbf2a34a1877c2fbf123f70ea0f3c0fe106f0469cf1928dfed662bba15013"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeState::apply_new_measurements (cognitive 20): HomeState::apply_new_measurements has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":5515}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f594d2bbde27cd6ef4738c86c58757a88ba4ab5cf204c79bcd4d946095cfb86"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::window (cognitive 20): Reader::window has cognitive complexity 20 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (7 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_reader.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dba1ff64cc340b415b94063dd8372c0b38b93702d775e0024065778db5e2c8"}},{"ruleId":"D2","level":"warning","message":{"text":"App::ensure_file_extension (cognitive 20): App::ensure_file_extension has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/export_keys.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa08e07a0fce989fff3fbd51ed2739a8bec4d9f95d0b424621c0073aa7babc48"}},{"ruleId":"D2","level":"warning","message":{"text":"Loader::answered (cognitive 20): Loader::answered has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"3396933084f5a8ec1b5ef772adcd7035ad79c0b678bf0d2e3636007f0cfab5df"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTableState::land_cursor_move (cognitive 20): DataTableState::land_cursor_move has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/columns.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d54ede94762cff2b44d2416803f2d5a6faaffd9a72d506c7f9f5be16c92e91"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::distribution_fit::incomplete_gamma (cognitive 20): datui_lib::analysis::distribution_fit::incomplete_gamma has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f51577454b2a289dac454d6c3be10c29afe7c36b812060bdc8a882b0f4d421"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::app::hex_view::sentinels (cognitive 20): datui_lib::app::hex_view::sentinels has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1762e2c7f5877ec964c99e34cba78b1301b9b3033fada5a6a266ae411c1287"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_export::axis_ticks (cognitive 20): datui_lib::chart::chart_export::axis_ticks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), match/switch 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6c4ed3bb3c00570037145063f13964ee38d045b390370ebcbe642018451567"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::config::themes::command (cognitive 20): datui_lib::config::themes::command has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (6 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/themes.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"740104887ad909a39f00c45fe7e5745d616c0d20d2a4277740a6329979db715c"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::framed_records::list_blocks (cognitive 20): datui_lib::formats::framed_records::list_blocks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 6 (8 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"de83016b294f85078361a586e15fe121e5fb924458413c8f798bd2a3d8cf026a"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::model_files::read_gguf (cognitive 20): datui_lib::formats::model_files::read_gguf has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (5 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/model_files.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e9a8736f91abe9d69ccb35f3a5872203013150018ddcfe6697fbaede38892f"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::schema_union::union_file_schemas (cognitive 20): datui_lib::formats::schema_union::union_file_schemas has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 5 (9 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/schema_union.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"edafced73a57f46fc50ad7497d5b429301c181314b97fea4377ccd5a099807d4"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::discover::schema_preview (cognitive 20): datui_lib::home::discover::schema_preview has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"82fd3d1a8ae4af62508903e979130bd6e16e92d35c17900507d4cdd50a3895f1"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::hex_view::status (cognitive 20): datui_lib::render::hex_view::status has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/hex_view.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e425e8481b9ce753a010825d2def1a1e0efabc3a5a4c12e8a3155b8d85211275"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::main_view::value_counts_control_keys (cognitive 20): datui_lib::render::main_view::value_counts_control_keys has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"4112f82679c01d949fd730f72c6cd337613476975cf935202f8240c95490324a"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::view::calculate_relevance (cognitive 20): datui_lib::view::calculate_relevance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/mod.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"c976d41dd3dbb48cfb87db2cb6f9f5308067c498242da341c01ebd9b1947f2fc"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::data_quality::pack_facts (cognitive 20): datui_lib::widgets::data_quality::pack_facts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8738b531de20600ac37bf4cec9aa9db80425d0cae536d754dc993f9e586bed"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::inspector::pane (cognitive 20): datui_lib::widgets::inspector::pane has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 3 (9 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f477a2548e1f4a69278b947b9e462c5165cb8b5496d59f340a6f52fcbcc3004c"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::pivot_melt::render_form (cognitive 20): datui_lib::widgets::pivot_melt::render_form has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/pivot_melt.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"de558b0863560c1064239be6d39db61445d2497673ef8ebdfb0a0ce4d10c2d7f"}},{"ruleId":"D2","level":"warning","message":{"text":"SampleForm::adjust (cognitive 19): SampleForm::adjust has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/sample_modal.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d631a6d2bce264c0c792939c2c769535d8a4f5d88f05f4e1dce468fe2ae96c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::sweep (cognitive 19): Store::sweep has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cache/store.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"996750ec7158fb1d4e2a9e202ea76f3157aa9bd198bca1e8f1cb5a108f107cd4"}},{"ruleId":"D2","level":"warning","message":{"text":"NmeaReader::sentence (cognitive 19): NmeaReader::sentence has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, match/switch 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/gps/nmea.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc48c9478d22ad45932c23c1fd6fb52ec43f8bbe90bbdf225a7cd42da2a87b88"}},{"ruleId":"D2","level":"warning","message":{"text":"Source::statement (cognitive 19): Source::statement has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/sqlite.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"411b80e3885ce35f61b86b5f1cb66b978594e053c803f9c7577959634540e15d"}},{"ruleId":"D2","level":"warning","message":{"text":"App::perform_copy (cognitive 19): App::perform_copy has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 9 (19 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":"crates/datui-lib/src/app/keys/copy_keys.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aea6fa0dee217ad1ed18595e6431dbafa251f7e700ce96aad222c2cda783d7d"}},{"ruleId":"D2","level":"warning","message":{"text":"App::spawn_collect (cognitive 19): App::spawn_collect has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":2176}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b90cc069201dc1ef99373d2cd3825630189ce20b9d36fbf856fa883f74471f"}},{"ruleId":"D2","level":"warning","message":{"text":"TextInput::apply_key (cognitive 19): TextInput::apply_key has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 8, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/text_input/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa555b103d8d91e07a03805a2c0b73240fbd84251f28fbf0a61c35c34bcd6d57"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::data_quality::profile_category_variants_lazy (cognitive 19): datui_lib::analysis::data_quality::profile_category_variants_lazy has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":3308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efef32a19fe49a9154dadcaba9d262b23228e8ef91d715ea0d096c5aa747daf"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::app::terminal_input::read (cognitive 19): datui_lib::app::terminal_input::read has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/terminal_input.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"125bc1648d209b7d2ab6f5217953f8ddd25269d9eca3f7ecf2a56ff565726351"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::cloud::cloud_browse::probe_url (cognitive 19): datui_lib::cloud::cloud_browse::probe_url has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (8 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_browse.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"932491315aa5a5d55eee3bc9726532e52e2d2d7dbcd1c6f3a116aebeb2450cee"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::cloud::cloud_hive::list_dataset_files_reporting (cognitive 19): datui_lib::cloud::cloud_hive::list_dataset_files_reporting has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (6 pts), loops 3 (4 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_hive.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b62d439976ec0b02536c90e20f5faa79957252698fd41252538caa386cbb8fc"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::audio::read_wave (cognitive 19): datui_lib::formats::audio::read_wave has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/audio.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee86afa4463b7f7f0e4a70cc645c79d18e49b8a5b236b2a274bb3303db0262b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::command::check (cognitive 19): datui_lib::formats::command::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/command.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c065fe7024316b38f9b6febfc45c0b9753b2dc7ad668210eac1ffa7f4b2e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::dataset_files::walk_dirs (cognitive 19): datui_lib::formats::dataset_files::walk_dirs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataset_files.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"febb1190009e1651e41a6d9f6cad9f300245576210a865873c6b894133451522"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::framed_records::capture::udp_payload (cognitive 19): datui_lib::formats::framed_records::capture::udp_payload has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":3028}}}],"partialFingerprints":{"codehealthFindingId/v1":"33879ad1423a2a544a179681615ed1a74d81ba565bc36ec98a48e7c99821a981"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::model_files::gguf_value (cognitive 19): datui_lib::formats::model_files::gguf_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/model_files.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"810754e00faef6961f83cecbacb6310cf646c318d6dfe06aea36306a1e95d928"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::model_files::read_remote_model (cognitive 19): datui_lib::formats::model_files::read_remote_model has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/model_files.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5e2b437a02d7f1cdee2d93f0b3ce3e3584c0238b99cd0c1e29243a04f0d051"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::readers::csv::type_string_columns (cognitive 19): datui_lib::formats::readers::csv::type_string_columns has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (8 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/readers/csv.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec327e0553dc908053ba439f47a14885296e9c50a96e9dce4178585554931ad"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::home_app::home_cloud_source (cognitive 19): datui_lib::home::home_app::home_cloud_source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, match/switch 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09fe781912edd498eac1c2b2eb81436e21df9875d870262212ea8dc87dc0888"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::inspector::inspector_reader::find_hits (cognitive 19): datui_lib::inspector::inspector_reader::find_hits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_reader.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"860f867af3b5d776e5bcdb1a2e0a70e457557c34a9aa8fcfbe45f38fc3bff6c6"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::loading::in_memory (cognitive 19): datui_lib::loading::in_memory has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"3244dfa5f61955a0fe302cdbdd72b430eae8ee89b369c60d9240ff7a4011fab6"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::analysis_view::render_body (cognitive 19): datui_lib::render::analysis_view::render_body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/analysis_view.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1e7935a8c0943d7b30c0fe965f4605d1bb163b2c4ef0a5c075e027f24d6ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::home_view::entry_line (cognitive 19): datui_lib::render::home_view::entry_line has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, match/switch 2, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"f427f848f7224d3f68085b7f856b4c666ba4e745148ae313ce23d3fd1572cc92"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::view_sidebar::render_form (cognitive 19): datui_lib::render::view_sidebar::render_form has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2, match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/view_sidebar.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e36c93564f4553d8f22110a207f219758533c42f1e3666c8f50e3d31c392b2"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::analysis::render_qq_plot (cognitive 19): datui_lib::widgets::analysis::render_qq_plot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"533d3558c2773d6aa6400c767846d1f86801347fbd1c0264ab864becfa2a5a8a"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::axes::fit_x_labels (cognitive 19): datui_lib::widgets::axes::fit_x_labels has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/axes.rs"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"644778d745f7815c1a35771388d60e8f1bdec17bcbc4d4f08586c55e63617457"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::data_quality::column_notes (cognitive 19): datui_lib::widgets::data_quality::column_notes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"7035fcd9dd71b6720184df7d5be52b71821c84f2cd5126daea75a8a7f095bbb6"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::inspector::binary_pane (cognitive 19): datui_lib::widgets::inspector::binary_pane has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d613f9a1049552dcb5442ff0015085c030d1ae33ea2aa9cbbdce77245d62ba"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_cli::man::plain::render (cognitive 18): datui_cli::man::plain::render has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/plain.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4267dcfe9a3b5d0778cc3990e6d0e4fce1866a233dff94d49515e7746cd8d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ChartModal::picker_toggle (cognitive 18): ChartModal::picker_toggle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"600135b32faa4bed7fb6c2034786597cc4ad76ad513e4e6f303100663b13e442"}},{"ruleId":"D2","level":"warning","message":{"text":"App::sample_context (cognitive 18): App::sample_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_sample_keys.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90a1af460e99ccacb2ca07854bf0a00a357cf94e33e726062c30a9797489d82"}},{"ruleId":"D2","level":"warning","message":{"text":"App::work_message (cognitive 18): App::work_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/footer_state.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73327e8dcb41d499e3c2a3a746b139ea9fc15b81263531fdfa70f6ce29d76d4"}},{"ruleId":"D2","level":"warning","message":{"text":"App::inspector_needs (cognitive 18): App::inspector_needs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 4, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_reads.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"552c1eed546a6de7e436806a1acd82db578ca29b6288f7a61ae03361c0b05b90"}},{"ruleId":"D2","level":"warning","message":{"text":"App::open_save_view_form (cognitive 18): App::open_save_view_form has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/view_apply.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdce233fe963301953dbc45ba9d75d217adcca57aceb018a62e8f1181c29e91"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::data_quality::apply_quality_scope (cognitive 18): datui_lib::analysis::data_quality::apply_quality_scope has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ad3c18c3478e52e5f1169a05c57e2958d56b59d8e88c4f288bf3e750a4d148"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::data_quality::segment_changes (cognitive 18): datui_lib::analysis::data_quality::segment_changes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"21afc080f1ff5f04246536f97998c0c08e79aa9eda0077d8bacce76bfaa9962f"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::data_quality::latency_profile (cognitive 18): datui_lib::analysis::data_quality::latency_profile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":4703}}}],"partialFingerprints":{"codehealthFindingId/v1":"57669bb8d6d245859f97e028840aa34656770ecbe07c5d2ce818800fdec07959"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::table_sample::draw (cognitive 18): datui_lib::analysis::table_sample::draw has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/table_sample.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b983607c25bc9704c553d48423c07faec0c2e071b7d657156ded472fa1af21"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::config::expand_path (cognitive 18): datui_lib::config::expand_path has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2d652944936137df59e0f111fe81d1200728d5dbbc9bdf6a77eefef896e749"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::files::open (cognitive 18): datui_lib::formats::files::open has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (7 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/files.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fdd39e73d49952c049b0b999d8183da267e4aca12a09e9630662100f225d2b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::numpy::plan (cognitive 18): datui_lib::formats::numpy::plan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/numpy.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"70361c117060819e914f7f1e0beac83a0dd98e8fb11416527031e4a3905e3cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::names_under (cognitive 18): datui_lib::home::names_under has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":5995}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc361adc24ff6c7d7263b4b1eb0e2c8756b3bb7caa0d5e34300a2bd8a8705a7"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::query::sql_group::plan (cognitive 18): datui_lib::query::sql_group::plan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 3, match/switch 2 (3 pts), loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/sql_group.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a0705b692f5e04e29255e0a61c2c7e252098e89605fc300c0ad25e25a4fe98"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::sort_filter_sidebar::render (cognitive 18): datui_lib::render::sort_filter_sidebar::render has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 5, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"08001b1f888c44ece46377bf6fa352b84968edbee472fba6ff30a8c7723d12db"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::chart::trend_entries (cognitive 18): datui_lib::widgets::chart::trend_entries has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c19c47db974abbcae8c13c359716ffa1c0375fff6ece378174729ffabe97f13"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::data_quality::detail_measurements (cognitive 18): datui_lib::widgets::data_quality::detail_measurements has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":3937}}}],"partialFingerprints":{"codehealthFindingId/v1":"2409c6ab99aedf7a71ced26134456d395ddee6f40bc998573757636baedc2cca"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::info::metadata_lines (cognitive 18): datui_lib::widgets::info::metadata_lines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3b8f93afee33394e28cc26c1aca35ea9f0637a9e07133e76dc0e26f84a6f8b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::inspector::text_pane (cognitive 18): datui_lib::widgets::inspector::text_pane has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, match/switch 4 (7 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"af34686ede23803b6ba8ec2528ebaf52aff2607f88ad7200d9e6842da18368d8"}},{"ruleId":"D2","level":"warning","message":{"text":"Below::of (cognitive 17): Below::of has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49892f6e3d0ebbf58aa7c29b1ffe32c66b868d52bb1ab10198b2047709713e5"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigManager::generate_default_config (cognitive 17): ConfigManager::generate_default_config has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"249b0c73a20664a981edc1b2db5060426b3d199273e8722123183abb287f1336"}},{"ruleId":"D2","level":"warning","message":{"text":"AppConfig::read_catalog_files (cognitive 17): AppConfig::read_catalog_files has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":2776}}}],"partialFingerprints":{"codehealthFindingId/v1":"03356b8a17272b3de2dfc700cc7fe4c080748352d5c2d15521693bb05d5f29df"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigLayer::anchor_paths (cognitive 17): ConfigLayer::anchor_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a03e9463633a841f2a08197f3964de55a08b717dd848410c4d8e741b20dfb0"}},{"ruleId":"D2","level":"warning","message":{"text":"Lines::column (cognitive 17): Lines::column has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 4 (5 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/lines.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"375b44dabe247356dd3965467bd59f0720d3ba2d963c7e85660af6bfc32492cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::time_meaning (cognitive 17): Reader::time_meaning has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"6602cb2710f3a333ae3907f84ca4f2502303a8a9ab10c3299373c6f834539267"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeState::parent_of (cognitive 17): HomeState::parent_of 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":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":3790}}}],"partialFingerprints":{"codehealthFindingId/v1":"35523ba3b42a7438a79eab6e2ea6a295ec817fe13e9c42eea8d559b65ce920b4"}},{"ruleId":"D2","level":"warning","message":{"text":"App::run_quality_setup (cognitive 17): App::run_quality_setup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_runs.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a3e1c4de576bddc7d726978fe8ba389ba54413d298962fd53310b27701f37b"}},{"ruleId":"D2","level":"warning","message":{"text":"App::filter_editor_key (cognitive 17): App::filter_editor_key has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (8 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/sort_filter_keys.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cea42e83559ab2c4e6e63000ab48206d176cb8ae3038057c8a909bb429d5506"}},{"ruleId":"D2","level":"warning","message":{"text":"App::chart_key_inner (cognitive 17): App::chart_key_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_keys.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"22babb788acf7267d984bfa9f4749dd4a9f1f4bad7176266066d2791d8588ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"App::open_inspected_value (cognitive 17): App::open_inspected_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_copy.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c0981dd393a4d3f81d9dcc80d6fd57b452d31519af83bb5b3b5955472673d52"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenRequest::named (cognitive 17): OpenRequest::named has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b107cd3f4cc01bf28299a8da42bf8146ee12d9fc151f1f7e62ba1f2e7fd528"}},{"ruleId":"D2","level":"warning","message":{"text":"OptionsRow::render (cognitive 17): OptionsRow::render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/ui/form_row.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7dec38d70805cab7a28672e9aa1c16b6e174d7283d8b24fbc6ffea875f0d58b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::data_quality::observations_from_profiles (cognitive 17): datui_lib::analysis::data_quality::observations_from_profiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":5168}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d5159f417f597bdb0b122ed31c117176b27c25e3c5499d5ebd7b327d38b855"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::sampling::block_sample (cognitive 17): datui_lib::analysis::sampling::block_sample has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (5 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/sampling.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"da66f96bc7ce85e9964d28e18896f8b441bfe7e355f67bfffc03124a27d04196"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::chart::chart_trend::theil_sen (cognitive 17): datui_lib::chart::chart_trend::theil_sen has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_trend.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ed286fbae5860ae9a0e2c8122e4d8fa7903d06aae4224dda630d0e83f09021"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::exact::duration_text (cognitive 17): datui_lib::exact::duration_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/exact.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2043187dad33450f8ac60a746cae8491e449afa363b75d8d71312b79c8bc6cc5"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::exact::json_len_floor (cognitive 17): datui_lib::exact::json_len_floor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/exact.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"14130c68cf6ae223f4c161bbe6b479a6019f1d17579184a45ae4430b61aa387c"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::gps::gpx::markup_end (cognitive 17): datui_lib::formats::gps::gpx::markup_end has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/gps/gpx.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8ecb2e0950981c0a690993891ab27a78aeb917d26ba1a671e510e618f6663e"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::midi::facts (cognitive 17): datui_lib::formats::midi::facts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"d648ea67115506735d2968faae89bf311cede0741a50a4f6fea6719d4c0d6bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::parquet_footer::column_stats (cognitive 17): datui_lib::formats::parquet_footer::column_stats has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parquet_footer.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"275be942b53a963ba8fadd601622d9a64528f691d225afbdfd4313d6acaab816"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::glyphs::fit_cells (cognitive 17): datui_lib::glyphs::fit_cells has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/glyphs.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cc29390138afb34256a07fa2c2a6e0a22ca902afd9eabf0c12edf9d48339fd"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::glyphs::validate_overrides (cognitive 17): datui_lib::glyphs::validate_overrides has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (5 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/glyphs.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"5075a1d0bf01321b33f90047d6a1dd3d377b87c4cc85cf5f991457b5512581bd"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::home::place_labels (cognitive 17): datui_lib::home::place_labels has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":2791}}}],"partialFingerprints":{"codehealthFindingId/v1":"99374a7cb0c0a783c08fafa696eb6c3c8c65ce2508f18b1c918a2e317ffe0895"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::inspector::inspector_reader::wrap_unit (cognitive 17): datui_lib::inspector::inspector_reader::wrap_unit has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, match/switch 2 (5 pts), if/else 3, loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_reader.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"504eaa35d7f9516333ed655289578ae342df32b21e99266b39b4179b414a9840"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::help::draw (cognitive 17): datui_lib::render::help::draw has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/help.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5302e2bcefda1437db463f5f2fa6da8d19e7db00a834b4b7e1bc036d501ca4e0"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::home_view::enter_notes (cognitive 17): datui_lib::render::home_view::enter_notes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f9200e98b0bcc441d36e197eb0babd0a0ef035f6c19a6b6593c6e00b0f546b1"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::main_view::chart_hints (cognitive 17): datui_lib::render::main_view::chart_hints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"394d4615c60de76a28fcb6e70a89bfb5737904152cd268dd56a71921dcdf356f"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::widgets::chart::render_sidebar (cognitive 17): datui_lib::widgets::chart::render_sidebar has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3318ff7ea209f74e7b1924c79e2beba6e02ebb2b7783f22468e2d2e0c3fb665"}},{"ruleId":"D2","level":"warning","message":{"text":"Markdown::table (cognitive 16): Markdown::table has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/roff.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"df024b0c99af9d477ba71207da00adc29513d24ca95ae5b85bcadf39b7581128"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_cli::render_options_markdown (cognitive 16): datui_cli::render_options_markdown has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 6 (8 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae9e5e90e6609e0c6134f13a96eb2eb3d4fe0c4f82019b111f9a1262fa2b3a4"}},{"ruleId":"D2","level":"warning","message":{"text":"IntentResults::observations (cognitive 16): IntentResults::observations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_intent.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"1255454b3e0a7250e9895f5c8fe3d78cf5762ada51a517894f43ed1d889c7225"}},{"ruleId":"D2","level":"warning","message":{"text":"RetypeModal::choose (cognitive 16): RetypeModal::choose has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/retype_modal.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5370927a71ec2e2657a48eb1f3913032c29518f226f86767f27dcaa38fe2f0"}},{"ruleId":"D2","level":"warning","message":{"text":"Search::window_at (cognitive 16): Search::window_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/find.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4f647efe776df5c97771eef46cbebcde00f80da9b649a1fb136df9cfd780ff"}},{"ruleId":"D2","level":"warning","message":{"text":"FixReader::finish_frame (cognitive 16): FixReader::finish_frame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c4b9d2abb5ab0dac4698d9429f808256c79766a904f63a78742ec5450034d4"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk (cognitive 16): Walker::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"4886ee657cdf880e6db7b82e1d7bb82226daf7a1d59f2c27659bbc74a2d16fdc"}},{"ruleId":"D2","level":"warning","message":{"text":"Spec::record_columns (cognitive 16): Spec::record_columns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (5 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/open.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6c3d96077ae8568a561b92d699864dc43ae0124798307c73820551788984ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::amount (cognitive 16): Reader::amount has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f495f61421b3091dbaf87030da82717edfdabaef364478106a21458b9287aeec"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::check_columns (cognitive 16): Reader::check_columns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"341bd20f98e2b1f3fa13c27e8dcb3cf557994c0ac92959f7ab42d34431b5dffb"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::bits (cognitive 16): Reader::bits has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"9449b0ba3f7123dfefd29d0d96f99f23111130e1e2d51910fa20149db5dfa884"}},{"ruleId":"D2","level":"warning","message":{"text":"App::footer_progress_line (cognitive 16): App::footer_progress_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/footer_state.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"199a8da0676dbc901543d991271667d2858098eafd70ac4b2c35bfa2984f5a3c"}},{"ruleId":"D2","level":"warning","message":{"text":"App::command_line_key (cognitive 16): App::command_line_key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/editing_keys.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cc1e2c7fdf839944a8ba5da0ec7ecd780f48e7ba719602036d7ec7b0a400aa"}},{"ruleId":"D2","level":"warning","message":{"text":"App::ensure_chart_data (cognitive 16): App::ensure_chart_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_jobs.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"485fb9d8e16f38f51e4a834e37809737634d22b614126304a82cae2a47fae405"}},{"ruleId":"D2","level":"warning","message":{"text":"App::chart_notes_of (cognitive 16): App::chart_notes_of has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_jobs.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ee6a30514b89e78c310f33801d00c568e0615e9f284fcfc71f337b3d108b04"}},{"ruleId":"D2","level":"warning","message":{"text":"App::open_what_it_is (cognitive 16): App::open_what_it_is has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"704a7dd1b614ee8fb6ee239cd0bd274691c580d8d00e38c468b81af8ce32b561"}},{"ruleId":"D2","level":"warning","message":{"text":"DataTableState::slide_table (cognitive 16): DataTableState::slide_table has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/buffer.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbcf3ded4e6dddb7a151f05afcf471c97a334724fe45c1e5054ec8f555d1a67"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::data_quality::signal_observations (cognitive 16): datui_lib::analysis::data_quality::signal_observations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":5436}}}],"partialFingerprints":{"codehealthFindingId/v1":"73922c455677dd8e613727ef908c5b0072ee6badfdd702bd04770644e9d55af4"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::analysis::quality_trends::trend_view (cognitive 16): datui_lib::analysis::quality_trends::trend_view has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_trends.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"848ee8c6aaa7ea89a9f1585b422a472c802bec90d3be2d7b1808cad5f15ef5fb"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::app::hex_view::parse_pattern (cognitive 16): datui_lib::app::hex_view::parse_pattern has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5835c42c24c6fd4f0ed97217fc712d10db4f7a240141b9eef8b9891c1548a87"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::cloud::aws_profiles::sections (cognitive 16): datui_lib::cloud::aws_profiles::sections has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/aws_profiles.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea168a93ac3b0bfb8376c470c9e2e08670b722b87507f0314db1a2d1adf17b6"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::cloud::cloud_sources::gcloud_sources (cognitive 16): datui_lib::cloud::cloud_sources::gcloud_sources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_sources.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4677314e10fa6ba0a6a1d811bd9da04470eeebdd5e595919e9e804a44f7d99"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::config::themes::parse (cognitive 16): datui_lib::config::themes::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/themes.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe4fdac9c05c89cf2a409f0727dd1041a88410f54d515749727f2f9363239be"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::error_display::user_message_from_io (cognitive 16): datui_lib::error_display::user_message_from_io has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/error_display.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3ef847c06b48f7138d214813ea4772b069b08023221c26bc884ad363054053"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::export::python_script::csv_arguments (cognitive 16): datui_lib::export::python_script::csv_arguments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, boolean chains 2, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af782ec6b8467981614272fbacd93c7153e2d219a8b38f6d5f4bb2b6619d674"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::csv_dialect::split_fields (cognitive 16): datui_lib::formats::csv_dialect::split_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/csv_dialect.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e8436b37780d7850048105828c7019f9f1d5898b8b766a9d7413189e3bf267"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::model_files::read_headers (cognitive 16): datui_lib::formats::model_files::read_headers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/model_files.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7e680935ed193a1c2ff4030130814b8b134505e073b3a7a46a02becc936b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::model_files::read_model (cognitive 16): datui_lib::formats::model_files::read_model has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/model_files.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"84967c9df6d42eb4234369c3f61e91a975f2599e210ff7e04f7062ba9e7429f1"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::readers::csv::infer_string_type (cognitive 16): datui_lib::formats::readers::csv::infer_string_type has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/readers/csv.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"136d354c872785ad389afb0d10550e6ed37d38c43a750bf76d031b168dd9316a"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::formats::types::path_parts (cognitive 16): datui_lib::formats::types::path_parts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/types.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8e7287b3b7887eaf2d00c9c18ba00bdf84ca892c04960ddb872aaa0b15cad5"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::query::sql_plan::sorts_by_group_keys (cognitive 16): datui_lib::query::sql_plan::sorts_by_group_keys has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/sql_plan.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"855d415bc7d6b0184636aabc7b5e62bedaf6e99b860d09627470ad006cc9e5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::home_view::fit_kind_cell (cognitive 16): datui_lib::render::home_view::fit_kind_cell has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, match/switch 4 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cab89e49b544c0fc8cd3c0fe5f9e98b7534032c2a5c2185057dee078a4e25bd"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::render::input_strip::render_columns (cognitive 16): datui_lib::render::input_strip::render_columns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/input_strip.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c29e7c9febd67f278aebbbe415fe8dbc25c7fe3c1d86fb6cbbecea98f919cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"datui_lib::view::matches_pattern (cognitive 16): datui_lib::view::matches_pattern has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/mod.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fa520021f755ec42f669b4d8a780e97ba7c3f79b80d1f078fd7bef62335207"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 665 methods, declared across 41 files: src/lib.rs (157), loading/open_scan.rs (67), home/home_app.rs (59), analysis/quality_runs.rs (49), \u002B37 more file(s). The bar is 30 methods; this is 635 over it, 22.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e25452adbe4206f01855940844e8be2070a8305443d739ea878abf95a349fc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataTableState: TooManyMethods \u2014 367 methods, declared across 9 files: table/facts.rs (93), table/copy.rs (50), table/query.rs (50), table/buffer.rs (47), \u002B5 more file(s). The bar is 30 methods; this is 337 over it, 12.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"214738c2ec85cdf6cb31d97e71d921243d8025d13b7b54ab0a6f9c354d8f8e47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/data_quality.rs: FileTooLong \u2014 3881 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 100 free functions. The bar is 500 significant lines; this is 3381 over it, 7.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"845edeef404ea7d2135f67d8014ca8c8d8c5cb859f0daf637b92e1f1314dc9e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/mod.rs: FileTooLong \u2014 3605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 86 free functions. The bar is 500 significant lines; this is 3105 over it, 7.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40442dcb453c42234da893138c33326155500505d13be083addc28c9fc567f11"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 3547 significant 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 3047 over it, 7.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb32d233d06104811531228ed9b8e2956f97a885a56ddf78505640d2c868b516"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/data_quality.rs: FileTooLong \u2014 3234 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 73 free functions. The bar is 500 significant lines; this is 2734 over it, 6.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32edd955e5176cc49dcb20826df58c371da0ddb90f5865c79bf58295d75b158"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/framed_records.rs: FileTooLong \u2014 2340 significant 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 1840 over it, 4.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8d8fc902b98fb1a9ca0abc6eb3b4396a3f38b876851adcc9083ad8d281213d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: loading/open_scan.rs: FileTooLong \u2014 2295 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: App (2 blocks, 118-3372). The bar is 500 significant lines; this is 1795 over it, 4.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70e02ad12d68266b1e54b5516f068371c915b88bf180627d15c87337f448af0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/mod.rs: FileTooLong \u2014 2191 significant 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 1691 over it, 4.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f815ca8c462c0a451ebc0c140a627d1ccca884b48a072a6c9c2b2898ea8c7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/home_view.rs: FileTooLong \u2014 2091 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 54 free functions. The bar is 500 significant lines; this is 1591 over it, 4.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bebdb545b62614c1b23aa9767ed02c79d86f18fd061c895dba4477af442b40"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Reader: ClassTooLong \u2014 1653 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 31 methods, 2 blocks, lines 80-2315. The bar is 400 significant lines; this is 1253 over it, 4.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c48c134ca3501df91f78af8bb4af552c781eb50c38bc41330365947d350313a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HomeState: ClassTooLong \u2014 1645 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 117 methods, 3 blocks, lines 1612-5685. The bar is 400 significant lines; this is 1245 over it, 4.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"1517dc0aa90aba846c745714591d2cf39165e5704ca759fbaf35b9dc94cf7225"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.spawn_load_phase: MethodTooLong \u2014 spawn_load_phase runs 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 304 over it, 4.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdb4c8a01168a0851c88261e990c57b275f67360d3fc6f25a1bc1a97b897fce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chart/chart_data.rs: FileTooLong \u2014 2008 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 67 free functions. The bar is 500 significant lines; this is 1508 over it, 4.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a24715e6e6d82efbe49d8ca6a9c2c6631ea967c8c9fdca137ea382ab8ada5d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HomeState: TooManyMethods \u2014 117 methods. The bar is 30 methods; this is 87 over it, 3.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"609465a3e84c53fd6363040614551574969a8071fb2b8674de4aace8b0dbf93d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/mod.rs: FileTooLong \u2014 1876 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 1376 over it, 3.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9132f9a989a193ae9efe69fb971cf152dd7b3bfc6e4109df03f8675df67dd0a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/inspector.rs: FileTooLong \u2014 1868 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 50 free functions. The bar is 500 significant lines; this is 1368 over it, 3.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f041c9e95ab9520bb1564688aaecc844fb641ce01b2a7e7c59785b3bfdb726e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/home_app.rs: FileTooLong \u2014 1806 significant 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 1306 over it, 3.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1474d19430dbf47436bd412f4535fd12f6bb3c712edaa6e4a7c5458929f10af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/parse.rs: FileTooLong \u2014 1709 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: Reader (2 blocks, 80-2315). The bar is 500 significant lines; this is 1209 over it, 3.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a643ee0399c0ffe2b45adbad6c7952845e58f3974b5e4c7e7ebd1ac40692e287"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/quality_report.rs: FileTooLong \u2014 1655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 1155 over it, 3.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6838e174d553febf1eb420134ca1cc27a471f322877b378117d9d5b55711143d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTable.render: MethodTooLong \u2014 render runs 326 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 226 over it, 3.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"248acbdf5c57d0d14178b32893bb01e7ec55324c4adeb270d8b88bfa37056298"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.records: MethodTooLong \u2014 records runs 317 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 217 over it, 3.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fde36dbd74fd644b431aef54c54081144464ddbab6c6d610d8b5f7bb865a18e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Loader.answered: MethodTooLong \u2014 answered runs 311 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 211 over it, 3.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"933f0a5a76d20238dc1a547a6b2105f878ed5ad27fd1787dd21f0493f6fa6082"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.field: MethodTooLong \u2014 field runs 307 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 207 over it, 3.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"61060a1a4ab0b5d68f05eb354748d84c578a1f854c38b3af6dbd64e35725284d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chart/chart_export.rs: FileTooLong \u2014 1465 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 965 over it, 2.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab9ad14a5ffc68225e98ad460fd040be4d2d817460a6fe3a6127d7cede74417"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/chart.rs: FileTooLong \u2014 1452 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 952 over it, 2.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62e395554e65bdbe0a812a530938215d203a81f420924c273790d9ba095d7b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/analysis.rs: FileTooLong \u2014 1448 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 948 over it, 2.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0faeda238dc32bc0f54e51585044339e15f94de5e94c554b12dc4d87d66e27"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: loading/follow.rs: FileTooLong \u2014 1433 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 933 over it, 2.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e47f3c1b8510202c1bd30ccbfb64fa7825c9000ca8c5ed90a424e2cc5641d23"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChartModal: TooManyMethods \u2014 84 methods. The bar is 30 methods; this is 54 over it, 2.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b481d66230d4c0dfa52573f209ba2db79c610ee2025a9a448cdaee4363272c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::analysis::quality_export::to_markdown: FunctionTooLong \u2014 datui_lib::analysis::quality_export::to_markdown runs 280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 180 over it, 2.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_export.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7c9a3d0c895fdb6f124b1afe7f6a8c29ef9eb64008f55e37f3b1e1e0ef0914"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ObservationKind.spec: MethodTooLong \u2014 spec runs 280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 180 over it, 2.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"150be75bca1b5c69947c6ea66e34af0c8fc5038021fbba4d3f1a9a4a1e1130ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/keys.rs: FileTooLong \u2014 1349 significant 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 849 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5fff0dca8a66dc98795eb6078cf5029a81e492a435fbbf23a94ae610178ae2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataTable: ClassTooLong \u2014 1078 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 37 methods, 4 blocks, lines 27-1837. The bar is 400 significant lines; this is 678 over it, 2.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c504863aa34bf4ffc745d69926d7429abb918e62cc63e807a81b82cdba659ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DataTableState: TooManyFields \u2014 80 stored fields beside 367 methods. The bar is 30 stored fields; this is 50 over it, 2.67\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0217d1b302cd9a919d4e695064f2dcb90d8aa1926268d9784b0f126eb37ee54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/info.rs: FileTooLong \u2014 1319 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: DataTableInfo (3 blocks, 674-1976). The bar is 500 significant lines; this is 819 over it, 2.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45670f19599df77e934a1d78b48a135015748517c72934506e6410d5deefb9a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: loading/mod.rs: FileTooLong \u2014 1318 significant 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 818 over it, 2.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"030a286ecfbc90fcf30d738c21cbd2882529e60816bcb5316fdc869e37c6ab6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/schema_union.rs: FileTooLong \u2014 1308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 808 over it, 2.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/schema_union.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1d62ccf0c6e634653fa08a44e2d5254a4ae2b67fbbf68a0dea585c1163ebda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/discover.rs: FileTooLong \u2014 1307 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 79 free functions. The bar is 500 significant lines; this is 807 over it, 2.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b89291d0ca2d518033acb9fbdf9f1fd7d49d4cb4e61d1862891a7da3f61813"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/sqlite.rs: FileTooLong \u2014 1298 significant 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 798 over it, 2.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/sqlite.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddfae47a274288d4e0612933cff6b5e929674929b9fe1fce7865443e9126c6d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FramedRecords.open: MethodTooLong \u2014 open runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee034b4e7de3c5362a92df882fc2b96932c9e72d6af482c60703f27c94c6eaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chart/chart_modal.rs: FileTooLong \u2014 1257 significant 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 75% of them inside a single declaration: ChartModal (3 blocks, 538-2053). The bar is 500 significant lines; this is 757 over it, 2.51\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9c479af8b27fd58d58fdcf8f4123c9093f593c9c26182dc7fb96835e5d13d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/table.rs: FileTooLong \u2014 1221 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: DataTable (4 blocks, 27-1837). The bar is 500 significant lines; this is 721 over it, 2.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb599749488b7c884cfaaae316d4949aade56c7a085ef68b407a5aaea7f057b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/analysis_modal.rs: FileTooLong \u2014 1187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: AnalysisModal (2 blocks, 448-1790). The bar is 500 significant lines; this is 687 over it, 2.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_modal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d0ff415569be318ae189d8821d80a763689800fdf7f024197627b506b98add"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ChartModal: ClassTooLong \u2014 949 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 84 methods, 3 blocks, lines 538-2053. The bar is 400 significant lines; this is 549 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec2a4ea9f53a2c2cf478c35b21ed39ef81f401ccefa6d978dc57231ebd6b888"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/statistics.rs: FileTooLong \u2014 1165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 665 over it, 2.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/statistics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30295fb9dcf9046798ea6e676006f7dc1c0e19a3f7d4e23726a3c16ff266d3af"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AnalysisModal: TooManyMethods \u2014 69 methods. The bar is 30 methods; this is 39 over it, 2.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_modal.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0dbd76ec59dd5f5b40b3057e8a8b64e365fbe09ad01401500b2f8c2c361f2e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Glyphs: TooManyFields \u2014 68 stored fields. The bar is 30 stored fields; this is 38 over it, 2.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/glyphs.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc9b2b6687de1ae29614a83ef05ee61868dff84cb00385f6a4073a48e6f9629"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.delimited: MethodTooLong \u2014 delimited runs 225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"887e62eb4872481cef1e9f74eaecbe373cbda5cd2ea7556a38db38acb7e1041a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chart/chart_plot.rs: FileTooLong \u2014 1090 significant 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 590 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_plot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9142d2ae49bea3c1bce9c92c1300d4c32f26cbe71c4a15d6be7b94cc10e5ca13"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Compiler.field: MethodTooLong \u2014 field 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":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf58e9fbc3d88e231c8fb713debf49eae20f09a561910f9285d36d6c49c9d26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::chart::panel_lines: FunctionTooLong \u2014 datui_lib::widgets::chart::panel_lines runs 217 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 117 over it, 2.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0984704a44a4edabe30547b2cdf1ec0754aa83a33cc278caecb3ba2cc3c31374"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: export/python_script.rs: FileTooLong \u2014 1084 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 584 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61fdee63aeb731fb1d65a01efa021ba11ed2cfac6a6efc7d0a2ef415168e8ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.quality_key: MethodTooLong \u2014 quality_key runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_keys.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5872d405d4c0bc46d54825376fa59f5c691e66c6b689821c3269cdb1f44956d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::app::run::run_impl: FunctionTooLong \u2014 datui_lib::app::run::run_impl runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/run.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e1b8165d9b90366f93d992eff407490c6facc2d1bcd44c114aa4bd1923d4c9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AnalysisModal: ClassTooLong \u2014 857 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 69 methods, 2 blocks, lines 448-1790. The bar is 400 significant lines; this is 457 over it, 2.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":"crates/datui-lib/src/analysis/analysis_modal.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8420318ed31abd1a950563b1da2fe6996ddbd7872255a9823ae0612ad6c3798"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/quality_runs.rs: FileTooLong \u2014 1071 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 97% of them inside a single declaration: App (65-1559). The bar is 500 significant lines; this is 571 over it, 2.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_runs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39edfc00318aaa33215b18b037de2cdaa532a4724d72ba1a96317dac5a035051"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::chart::chart_export::draw_plot: FunctionTooLong \u2014 datui_lib::chart::chart_export::draw_plot runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf470487991659469ba377d72d08e9e388b7bc0705ebe6dcca4b1311c666fec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TextArea: TooManyMethods \u2014 64 methods, declared across 5 files: textarea/edit.rs (30), textarea/mod.rs (18), textarea/wrap.rs (9), textarea/render.rs (6), \u002B1 more file(s). The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/textarea/mod.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce895487758f8294fc15faab51fb6ced96080a0c85c6d40b065135139add60b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: OpenOptions: TooManyFields \u2014 64 stored fields beside 6 methods. The bar is 30 stored fields; this is 34 over it, 2.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_options.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0fae0a89430120584edba6f7c7c48b45dd344e76fa9b39c8f7b15a2ff4ae2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/cloud_browse.rs: FileTooLong \u2014 1057 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 557 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_browse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c23a3a5df23286fe653ea1c355e3d0a813eb9b43fb20bfcf1719fbac47a4978"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::value_counts_view::draw: FunctionTooLong \u2014 datui_lib::render::value_counts_view::draw runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/value_counts_view.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b712314754634486c86880278ed11e14d88d868fcdb0d781ce84e784186a60"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataTableInfo: ClassTooLong \u2014 840 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 3 blocks, lines 674-1976. The bar is 400 significant lines; this is 440 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b4f90efd62629c6e4158806fa6c9500f01a7ef351bd5396db64235b528588c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.home_key: MethodTooLong \u2014 home_key runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_keys.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d7349e59f581b78018485bc4a948b8f27c0d5a6b313d361976d35cc6e14d1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Spec.parse: MethodTooLong \u2014 parse runs 207 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/matching.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4838921e27fc2e043c598dc00132b8cc50ad102a63b2e9192370717530e9b70e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/query.rs: FileTooLong \u2014 1031 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: DataTableState (223-1535). The bar is 500 significant lines; this is 531 over it, 2.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cb19b2d17f933f4cddb2aa180803307753e877cc89bc24e17ed04fbaa1d521"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/audio.rs: FileTooLong \u2014 1001 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 501 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/audio.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cd9a6ec2eca38beb92e972181ba99d683667a8373a18a2cbb77fec3ba43d60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/dataset_files.rs: FileTooLong \u2014 1000 significant 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 500 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataset_files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93a238eca6be37dc0f6b59d5df21a28e5cc76ee551e3cae7d1a128e9e05e4d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::home_view::render_list: FunctionTooLong \u2014 datui_lib::render::home_view::render_list runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca3c80306f3af5ca385d979a6f0357e119ad0fad6c3ede19afae157c0b519a5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ColorConfig: TooManyFields \u2014 59 stored fields beside 5 methods. The bar is 30 stored fields; this is 29 over it, 1.97\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b595664a87d5edebf01599cf8c0bf48701611c2071589db10b9101a044e140d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/distribution_fit.rs: FileTooLong \u2014 975 significant 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 475 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe263a923f6b61b8cb4c0f26641500c6a0993a0e4599a4bc8ad62f498a352467"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/numpy.rs: FileTooLong \u2014 974 significant 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 474 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/numpy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa7d9214ac64b8f636f85847fa157f688aa044c8f7a17a7efe2b1889d40de6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::datatable_main::render: FunctionTooLong \u2014 datui_lib::render::datatable_main::render 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":"crates/datui-lib/src/render/datatable_main.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"daed7a3a20a1288861fa95b2d388534320ea35b7b40bf8875f8744b5a82e453d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/buffer.rs: FileTooLong \u2014 967 significant 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 62% of them inside a single declaration: DataTableState (600-1576). The bar is 500 significant lines; this is 467 over it, 1.93\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/buffer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cbe56ec2156f70791875ada8804ad830725e3bf44b64aa1877b9a4d6b4ab79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Theme: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ee496e82a2ba85dc747043f3b923e6d6bef4de6b73c7e65353f5e0b9c27f41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chart/chart_trend.rs: FileTooLong \u2014 957 significant 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 457 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_trend.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01328e8b2c05ac47cffe5d1808ceef5716f1e21adc44745297f8414b0c56926"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/model_files.rs: FileTooLong \u2014 940 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 440 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/model_files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfd922566b3acc8cc97645f75b51011faa8dca17a1c57e9234cd4f945ecdbc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/quality_export.rs: FileTooLong \u2014 932 significant 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 432 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1874c21dc51023c2616f6c57f1a2835332cd2f52f685305bc835572aa99996e3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FramedRecords: ClassTooLong \u2014 745 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 6 blocks, lines 491-2622. The bar is 400 significant lines; this is 345 over it, 1.86\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb97825ceeb7215b45a3069786e61cc0955af5cba95144eded7a1a01f9ccb9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/cloud_sources.rs: FileTooLong \u2014 931 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 431 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_sources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b1ec167e427acc383c34d4cc178062032953f8a16771e04b9002d8f82b74cc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HomeState: TooManyFields \u2014 55 stored fields beside 117 methods. The bar is 30 stored fields; this is 25 over it, 1.83\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":1612}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6eb03b680e2985c96f6c16ff80cde1b920edbd2541d222c01017d7a7ff9e07"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.build_local_lazyframe: MethodTooLong \u2014 build_local_lazyframe runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":3080}}}],"partialFingerprints":{"codehealthFindingId/v1":"b725a96d5cc6cb307115a0eb2cdec57acfa7f34d5c10ccd0f67aedfd839a97f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::main_view::data_quality_control_keys: FunctionTooLong \u2014 datui_lib::render::main_view::data_quality_control_keys runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"7734ad198c075839dda34d366eed1375a4f0ac07ea3bfa7540b7176ca4d0551b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/sampling.rs: FileTooLong \u2014 889 significant 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 389 over it, 1.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/sampling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61febe468b7dc1238aad041143f0b50811b5e4c48b81d84476e8c79eaf41cc92"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 53 stored fields beside 665 methods. The bar is 30 stored fields; this is 23 over it, 1.77\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7f2c5f9499c33f4e01022594784fbf781d67c3fc4b2b8ced74f986eafe1043"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: readers/csv.rs: FileTooLong \u2014 875 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 375 over it, 1.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/readers/csv.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5706a5b712fb57764353fb38ce94bdf17d3e7afe8b5514ae3a43e3d26b9dca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::chart::render_xy_chart: FunctionTooLong \u2014 datui_lib::widgets::chart::render_xy_chart 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":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc8c004a6b4d5660b6b4ac129265abea5980c5e5ce74d5bd16d5aa379f6ba0a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: View: TooManyFields \u2014 52 stored fields. The bar is 30 stored fields; this is 22 over it, 1.73\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/mod.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf459cfa980ec69e66de8c5eefb13570998ccdc8daec95309a00011c5f6117f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::chart::chart_data::envelope_series: FunctionTooLong \u2014 datui_lib::chart::chart_data::envelope_series runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8543f32eaf1550b8936e42358ea9d86ff2d08e79915b36c428438e8e79871ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::analysis_view::render_body: FunctionTooLong \u2014 datui_lib::render::analysis_view::render_body runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/analysis_view.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"035867122d3e5878273f3ff3c4b0624f02db545f91855eb9594bb03a2416b045"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Loader: ClassTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 3 blocks, lines 833-1837. The bar is 400 significant lines; this is 288 over it, 1.72\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b611a28745b7bf0f031777d012b76d0622f90e3ea33d18eaddceaa925c367cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.analysis_key: MethodTooLong \u2014 analysis_key runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_keys.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b41fb8954755ce7a3a472a868680ee203690d5cc94350ed62e6181b500b534d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::analysis::data_quality::profile_quality: FunctionTooLong \u2014 datui_lib::analysis::data_quality::profile_quality runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"9564c45096012003befd043c82fac66920df0faf7b2c947a1f5b786df9509bbe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.apply: MethodTooLong \u2014 apply runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/applied.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b421d2753e6d1b9aabdef6e296360c3fa1ca5e32653995040e078793ea8ba16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FramedRecords.build_index: MethodTooLong \u2014 build_index runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0b57684cd79dfcc916e8f6238c1d0b82c5fe5aa6bc4d436e4cdc729d0522f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::inspector::render: FunctionTooLong \u2014 datui_lib::widgets::inspector::render runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c54fb6dead7ba0b0ef75802e793876823790b4f7bb193936c1a3c64ae43c570"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/axes.rs: FileTooLong \u2014 830 significant 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 330 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/axes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1168162da6f4c435dc81ee5e85c34a3f8c425c7966077bf1df7036f9b6c46eae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: home/catalog.rs: FileTooLong \u2014 825 significant 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 325 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1b44234f509e099206fefb9af9780c85d97ba93e19bebcecd8648c65d93bf6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walker.field: MethodTooLong \u2014 field runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bb08ab14aefde2105062f0341527b354b238548875847e07b60a352c282a12"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::formats::ulog::index: FunctionTooLong \u2014 datui_lib::formats::ulog::index runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/ulog.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"9888433f4bfcc121c08289b5a99face2dca33e93229d75dd40c71866540e1a8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/midi.rs: FileTooLong \u2014 799 significant 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 299 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea9b2d30a35fbd2957884196489f14b11257f7422ba3e0f1eb788a4c1545591"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/candump.rs: FileTooLong \u2014 791 significant 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 291 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/candump.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf12548b086d33a8b065f5e340cf2f0ca762e8ca15be78e41caab2a1b4b1e96a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/copy.rs: FileTooLong \u2014 790 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: DataTableState (260-1211). The bar is 500 significant lines; this is 290 over it, 1.58\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/copy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b600a6a22fd19ee760a0881a157e3450f7b5b0300cfe5963974933906e6d5d08"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::home::build_listing: FunctionTooLong \u2014 datui_lib::home::build_listing runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2b8227aa158eeb3bc54016bdeccb4b7c46bb1c800fae5cb7e8dceca0e93ef5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::formats::dataset_files::open: FunctionTooLong \u2014 datui_lib::formats::dataset_files::open runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataset_files.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d23b7b832e682280d7725be56c5df9fd4f5377d4d423f83e28c6d73ebfabd03"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTableInfo.render_schema_table: MethodTooLong \u2014 render_schema_table runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e24b91fb5282abff06a657473f7bb776f96148a2c7255b4c30e9f48371745be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RenderContext: TooManyFields \u2014 46 stored fields beside 7 methods. The bar is 30 stored fields; this is 16 over it, 1.53\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/context.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a40fa70b3138ddd1b9b2d757a6c0fffffd37dc50e857f3a46453c619c9c5e0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cloud/azure.rs: FileTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 264 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/azure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49267aa6c045c849ac2a81c9f5a39bd3828f0c95af2df96a159479369e138ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTableState.from_schema_and_lazyframe: MethodTooLong \u2014 from_schema_and_lazyframe runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/mod.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d760c57f1b87f936e16639a740648e84e29524d0def8d4c4997199ae477eaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::query::parse_nodes: FunctionTooLong \u2014 datui_lib::query::parse_nodes runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2512}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29627e367094cbddc08154576bb36101eb957df7418f4b18c2ff442dd9bf18a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ChartModal: TooManyFields \u2014 45 stored fields beside 84 methods. The bar is 30 stored fields; this is 15 over it, 1.50\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a8cc2f13d0a8e6fed769ffd336bd8cf77d7af19478506fca2998f817c11820"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chart/chart_jobs.rs: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 246 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_jobs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01749c0307d2f2de115822c783e1844a72356a17e84641dade7c78ba298ed5ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/find.rs: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 246 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/find.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"675d0872fa87b46627e559f756900b495fd531a4e2d0db42e523e195e26d1e72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/facts.rs: FileTooLong \u2014 743 significant 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 93% of them inside a single declaration: DataTableState (109-1305). The bar is 500 significant lines; this is 243 over it, 1.49\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/facts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fd8f7ca4e636b234431f1c629ffc2744de9f9567e84f3172ff9f3d594826e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::trend_bar_fields: FunctionTooLong \u2014 datui_lib::widgets::data_quality::trend_bar_fields runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":3294}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fd3e4b76a8df407d78a74254d43702441fe138ab9712574ce8ca1651fd85d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::formats::midi::add_file: FunctionTooLong \u2014 datui_lib::formats::midi::add_file runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f3d745e6b09f16bcf01c7d539ab54a6b2b9267ce11f2a1824f0a08b55c549a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::analysis::quality_export::report_file: FunctionTooLong \u2014 datui_lib::analysis::quality_export::report_file runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_export.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4919b4ec462f195bf307533266cbc7913e706e4fabbbe39e28af60fd110d8b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::query::tokenize: FunctionTooLong \u2014 datui_lib::query::tokenize runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e13812bc39c50932bddc5a93cdd37ee3632559a96bb9c27805c9fdba5be9ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: table/mod.rs: FileTooLong \u2014 729 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: DataTableState (2 blocks, 143-1094). The bar is 500 significant lines; this is 229 over it, 1.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e386777eb1a01daab91ce7976ceea42549da85704c6ad5cd191e14915cda95f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/glyphs.rs: FileTooLong \u2014 726 significant 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 226 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/glyphs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d6d88b6a283bd20f542ec489956d6daf962c972e2b2f013ff9e3bfd199e93a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view/mod.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). The bar is 500 significant lines; this is 225 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9f87a25a0e9900d6ebfb97322f566203a887b6c703f24eed5f8b38ef1b5c89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/hex_view.rs: FileTooLong \u2014 716 significant 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 216 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da9b60871118e00edaf2bab0aae1c3822ad035fe0b810c53d8d383be8102722"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fix/mod.rs: FileTooLong \u2014 715 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 215 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7ad7984d141ca5c00616c3986bd2d6ec099c8cf883c787fb71a819cb82588e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::render_gaps: FunctionTooLong \u2014 datui_lib::widgets::data_quality::render_gaps runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":3493}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c38909e415600e046fad8d2855c90bc387088b6f7e0520bc3bd50a8adc909c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::home_view::render_preview: FunctionTooLong \u2014 datui_lib::render::home_view::render_preview runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":2396}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed783088b90505949a8fd1030d292650912e0a874ef90e248bbfdcecf15adaf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::sort_filter_sidebar::render: FunctionTooLong \u2014 datui_lib::render::sort_filter_sidebar::render runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"315505479c7694a9d2b17852a14ee64464e70041ea2a96c0745889be7fe47265"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::render_interval_detail: FunctionTooLong \u2014 datui_lib::widgets::data_quality::render_interval_detail runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2626}}}],"partialFingerprints":{"codehealthFindingId/v1":"91baf8f8e8d72549a1c3d92dc217beb3b7ed19a5e1a161e35acc028f3be26237"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::inspector::draw_fields: FunctionTooLong \u2014 datui_lib::widgets::inspector::draw_fields runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d286ff478bc682ebce59e76b65210f4ccc8900824a96800a80d76ad80228f14f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gps/nmea.rs: FileTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 201 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/gps/nmea.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a9e8af0d9d4017ff3c1a0fb706bc58c9a86ecdd4b1dcb5758858ba729b85e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::analysis::data_quality::profile_temporal_lazy: FunctionTooLong \u2014 datui_lib::analysis::data_quality::profile_temporal_lazy 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":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":4533}}}],"partialFingerprints":{"codehealthFindingId/v1":"907eb4096dfe6d4fd4083d7a0f4361c2a471698d748449f63a094d5e607fdcd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChartRequest.prepare: MethodTooLong \u2014 prepare 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":"crates/datui-lib/src/chart/chart_jobs.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e7dd6dd501c2caac296a307723de76ba3073e493b2489373951b8962092bc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: man/mod.rs: FileTooLong \u2014 695 significant 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 195 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2763bfd251a26c9ab95a5f17895dc4336aa2889a2c518ed7ce2f69d2add5e69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::sort_filter_sidebar::render_columns_tab: FunctionTooLong \u2014 datui_lib::render::sort_filter_sidebar::render_columns_tab runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b48e0a15c3ef7c02619a6b26539da7c7961ef017168ce707c2114567281be5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::analysis::render_distribution_table: FunctionTooLong \u2014 datui_lib::widgets::analysis::render_distribution_table runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"52769f28979761c115f596b701427f2c9c234cb56d83ec14b97ddf700d99c43a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Footer.render_line: MethodTooLong \u2014 render_line runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/footer.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"543dfb6041f2f94e8935cf6b2637739a66d37583f973d1d9a48165cfa5dc61ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/main_view.rs: FileTooLong \u2014 681 significant 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 181 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c440a888a6f65677f2f1bfa074a56a3bb68874fa36b5eb04cbb201dad81978af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::render_findings: FunctionTooLong \u2014 datui_lib::widgets::data_quality::render_findings runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e0dff4f0039ad8fe24bded547c194a950f9cdea83d2edc6c9bbf16d9f458ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTable.draw_columns: MethodTooLong \u2014 draw_columns runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeea812df35277b36b23c910cfb637476b351963d75d779760b180fcb0221f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: analysis/quality_intent.rs: FileTooLong \u2014 679 significant 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 179 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_intent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ea4667727f2d463d874a020f7afb0d9c1295b8134017f0ff16256a88bfcb97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::chart::chart_data::prepare_bar_aggregate: FunctionTooLong \u2014 datui_lib::chart::chart_data::prepare_bar_aggregate runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f9c1210536dced9b9aeea4c7c2523a0dc476871f6d3de344d7b24f5402c90c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::home_view::preview_head_keyed: FunctionTooLong \u2014 datui_lib::render::home_view::preview_head_keyed runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"370b536880d2333f7ef11f03012d393bb67d0964865e6e43e9259ec907f818cc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CacheManager: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cache.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb6fea59fb3fed6fbe8d6c021e4dcc3fc6eb24c2a9a20e0bdbdea951570ff30"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_cli::man::render_command: FunctionTooLong \u2014 datui_cli::man::render_command runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/mod.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"47994e80249441f12fec24c6e20aafa0151c8044f643e31efa5b995985dc3cb5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CloudConnectionConfig.validate: MethodTooLong \u2014 validate runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09200ab8ee2eee4a555e9137f0f898c0e0b30d3051ceeb4c3a3faebf5ca9d23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::sort_filter_sidebar::render_filters: FunctionTooLong \u2014 datui_lib::render::sort_filter_sidebar::render_filters runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e37f3960b3a9faf19f8e7bd5056f6eba69ac3d894ded75f7625a7fd4fb65f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::view_sidebar::render_list: FunctionTooLong \u2014 datui_lib::render::view_sidebar::render_list runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/view_sidebar.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf14cac087dd751266d54d0fc9f2b6cd0d8513122f477f0f6b340a37a76cca6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::formats::dbc::parse: FunctionTooLong \u2014 datui_lib::formats::dbc::parse runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dbc.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6049a399fca8aba89c790565f4fa8e2ffa4ef1d5267caeaf2002eb075a47341e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::render_intervals: FunctionTooLong \u2014 datui_lib::widgets::data_quality::render_intervals runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"66846452d957ae473c0baa718268468be260a2602b52714f279975aeda06b919"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::analysis::render_distribution_histogram: FunctionTooLong \u2014 datui_lib::widgets::analysis::render_distribution_histogram runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fa54ff2077f3144736652c6d215068eb7fd52de9bed793a444dec0a3ee14ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::inspector::render_drill: FunctionTooLong \u2014 datui_lib::widgets::inspector::render_drill runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"7baa10634a39901f3c7a349afbaeccafb1039291b07f12987c262f047b2a71a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.scan_for_open: MethodTooLong \u2014 scan_for_open runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac3326cdd2f1aa74e064ce179f2e8a87b6c4a1746b4b123c645c5400f5dec29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::documentation::layout: FunctionTooLong \u2014 datui_lib::widgets::documentation::layout runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/documentation.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"796e635d2bdca08aadd884f775bcb4875a184dc058c0f461abc43f33f6cf7eec"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataTableState: ClassTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 367 methods, 2 blocks, lines 143-1094. The bar is 400 significant lines; this is 110 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5adcc3bfdf99d1a00bcd15cf2a873cc21bc0f69da7f8c0566f484abd5e243bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::analysis::quality_report::checks: FunctionTooLong \u2014 datui_lib::analysis::quality_report::checks runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2262668dc583f7e99c002a8a2e37fc85c7fd78c038581aaecde78f0c8c1c50"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::analysis::quality_trends::trend_view: FunctionTooLong \u2014 datui_lib::analysis::quality_trends::trend_view runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_trends.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2e9a2c76d7e2ddfa88fc79e4e7042de448fba25d4a0aec620af2ed2664b312"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/settings.rs: FileTooLong \u2014 633 significant 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 133 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f724c8bb2a6a58ed41f2a0d5a0dfb14465e667ca09cbe79143dc39c60aec0bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/fixed_records.rs: FileTooLong \u2014 631 significant 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 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fixed_records.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c693932c7e45f19a0bd1850eea84ef5ee25a7df53d6d31b7cb64768800e45d71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::formats::fixed_records::decode_values: FunctionTooLong \u2014 datui_lib::formats::fixed_records::decode_values runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fixed_records.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"037dbb38817b961a49339684084dcb27d728e1560e36aaacdfe5169322960764"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.run_quality_compute: MethodTooLong \u2014 run_quality_compute runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_runs.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"629ebf5eaba9e2a86e76ec6d472871e9cb6a460b59145cbdcc9e6ae5d3847c0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modals/pivot_melt_modal.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: PivotMeltModal (3 blocks, 302-995). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/pivot_melt_modal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c96733db16df66618bb9b27e5988d0ce60cc6a4d549feaf0a19f4d2cd02db9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Loader.first_step: MethodTooLong \u2014 first_step runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67b9d659f06bc0ad95d0fd5515e7bf38ca6a229a8a129adde0944eff38c8a21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::analysis::render_qq_plot: FunctionTooLong \u2014 datui_lib::widgets::analysis::render_qq_plot runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"344cc1c8edf8bf284c0a122b54e129d947c4baee2a011611222b1c624e037b95"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataTable: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c634fbca2c702fbfdb0ea01af4011ea7b7a9c667f0cc1905c7fe211aaf995b1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DataTable: TooManyFields \u2014 37 stored fields beside 37 methods. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"141f63694f5852ddf870d49e867d9579daaef31281959dc4a0f55e759b3c587e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.quality_setup_key: MethodTooLong \u2014 quality_setup_key runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_setup_keys.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"578267dbb6ad8e61f8ec3e374c1dba8465f5160f9feb7f35c143d788bdc9114e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::formats::elf::read: FunctionTooLong \u2014 datui_lib::formats::elf::read runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/elf.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafb0dfa7238f0c6d6a7759c0bd814e50c5fcbda9c1847edb61f75856bc33ac8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTable.slice_column: MethodTooLong \u2014 slice_column runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cfaec73626270ed0070215a0e46cf8a03bd3203b17b7b2baddc47b510ddb41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::loading::follow::spool: FunctionTooLong \u2014 datui_lib::loading::follow::spool runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d09f640985e5a80a8b9d3d5ffb4cc800bb5377b80fa530443ad69bbeb193ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::view_sidebar::render_form: FunctionTooLong \u2014 datui_lib::render::view_sidebar::render_form runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/view_sidebar.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6eee03f0f095a9e1436885b6cb2364039915d0ded017a7cf708a372d2e944e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTableInfo.render_resources_tab: MethodTooLong \u2014 render_resources_tab runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51b6cfc602611959a9ddb054380c033ae1d5b86eb586c5020f8f1483867f4df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/jobs.rs: FileTooLong \u2014 604 significant 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 104 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/jobs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddefe73d29ec40fc10c90703d38aca02e8fa289331725d2956563944cdb742c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TextInput: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/text_input/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec256788ecaa3adc09fa9e666504f1fd8a1c8961fa6b837e613388efd7b3b85"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cache.rs: FileTooLong \u2014 600 significant 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 100 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd12bce03f02b41cbfeb0ee120fe54e860c2a6df241b1b92e213878006f463cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnalysisWidget.render_distribution_detail: MethodTooLong \u2014 render_distribution_detail runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0bb3fdf859eb3cedb2cded47a07b16c1e1df313d1829e317574e96af8d4bbe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::analysis::data_quality::compute_full_quality: FunctionTooLong \u2014 datui_lib::analysis::data_quality::compute_full_quality runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":3068}}}],"partialFingerprints":{"codehealthFindingId/v1":"346c29ad54367479d266a5aec1a52673c1c68ee7ce4e523a66d867c713bffcd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::export::python_script::source: FunctionTooLong \u2014 datui_lib::export::python_script::source runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"2debbee172602d8c19410ebb3ffe3ac1d62098d47157f98bf42637123bdcfc3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walker.record_inner: MethodTooLong \u2014 record_inner runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b9604e6d2a6c9792b0dba06c136982e8f3bf5463dcc9d21243c65acb2454e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::formats::framed_records::list_blocks: FunctionTooLong \u2014 datui_lib::formats::framed_records::list_blocks runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad60f402e7c364299ab602dce95acfb50404f68b8558c85506ef14cbaa902cca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::home_view::section_header: FunctionTooLong \u2014 datui_lib::render::home_view::section_header runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa9bd865243663cd742224592737b6950e590127dbe7ac4edc830b7dc4d8bc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/vcd.rs: FileTooLong \u2014 591 significant 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 91 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/vcd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef98a94ec03a96ea1c4f754ea4a3393e0cd91e29e2e27d46cabf8d08a590580"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Fitted: ClassTooLong \u2014 472 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 2 blocks, lines 39-755. The bar is 400 significant lines; this is 72 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae4d93c55dae23e4bf61ea72d019ad8e0db0d480dd3b29927ab44d0af989e9a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Step.python: MethodTooLong \u2014 python runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46745b8cf8564424b7f69455a6b5393d000650a89253c8f2b930d22444ad9be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::render_setup: FunctionTooLong \u2014 datui_lib::widgets::data_quality::render_setup runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"227164404df388f6144376089b5d4687b84e5daf70f35d2841e29c6d3e126c63"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::cloud::cloud_sources::resolve_among: FunctionTooLong \u2014 datui_lib::cloud::cloud_sources::resolve_among runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_sources.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"78043322312cb5dda26f24d15f8b2d2440a5c1c47d14191c9c695669974a3a6a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FixReader.message: MethodTooLong \u2014 message runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"2877f0d5197965ac8251bf5a6babd132388001249228c37441788c0df1969da5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.install_dataset: MethodTooLong \u2014 install_dataset runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd63a6397ba4fa2094dc81c2760296cf67dfb043930584b37f784a73d663ffb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::pivot_melt::render_form: FunctionTooLong \u2014 datui_lib::widgets::pivot_melt::render_form runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/pivot_melt.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"31630ae015e124f5f8826d612e21b3edc234cf71d40ada633bee856d1b25e8a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/event_pump.rs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: EventPump (2 blocks, 98-831). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/event_pump.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a04f972f6ea5d3a01e79d85b807f1c84b6efc6e2cd3865d2e0643694e0c2743"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/error_display.rs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/error_display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49ba532704743342887a18ae0d09b86874e144f2bae662a47378acf2629eca7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::past_calendar::guard_expr: FunctionTooLong \u2014 datui_lib::past_calendar::guard_expr runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/past_calendar.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c31b83238dc7c3fa363816c98ff3c3d8626ef5f25de88f42d54356fa184d2dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/footer.rs: FileTooLong \u2014 575 significant 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 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/footer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e8658c9e8333798d3bee73278529c67c040bf7d26e1da14c62a7bf15bad5aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::chart::chart_trend::fit_source: FunctionTooLong \u2014 datui_lib::chart::chart_trend::fit_source 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":"crates/datui-lib/src/chart/chart_trend.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a001815318a67bcfa0aec7a322bfeedeeb679169f755cc4114b90a09c89f4f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.build_lazyframe_from_paths_with: MethodTooLong \u2014 build_lazyframe_from_paths_with 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":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77ed1d6ee44d380a274a6038058a7bb3327989031bbc91872b1591b731207ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::help::render_help: FunctionTooLong \u2014 datui_lib::render::help::render_help 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":"crates/datui-lib/src/render/help.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd7e827215198306b2e2b1d343ba8034888eece508f644f52f7ad569ecfe55b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::render_columns: FunctionTooLong \u2014 datui_lib::widgets::data_quality::render_columns 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":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"4014aaf799bcd061ea9ba1136cb2868647f199147305565617298edc7c108de4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/sort_filter_sidebar.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 74 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34973b568756a61f60b28488cfcf98c121fbba53344d9b7edfbb59f2b52f062"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/lines.rs: FileTooLong \u2014 573 significant 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 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/lines.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"254c33e3da55165da31ca76ee2e9337266a42a14e967e28f3fee9979f9756270"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::sort_filter_sidebar::render_in_effect: FunctionTooLong \u2014 datui_lib::render::sort_filter_sidebar::render_in_effect runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8060e0174058d6611822a6c211dc60a258e2fe6d16ada2b02ae2c6fbb1d80c65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::chart::render_bar_chart: FunctionTooLong \u2014 datui_lib::widgets::chart::render_bar_chart runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"763a74b658684e88ce1e319eaf6b9f4bed3d6592f5b9d5bfa268f485ff2ea3c5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: InspectorModal: TooManyFields \u2014 34 stored fields beside 24 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_modal.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"767fef31b606a15c3bbdc704c8432e3abca07136098cc6d460f2e1be1b22f371"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Args: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca5de0de677da4a6b3a82bee183abf897ff688d84f06dac276a892fb70c7578"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.blocks: MethodTooLong \u2014 blocks runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"3baa5193913f85d831bdab30eb9fc3af6f43cd66ddf1712755d08af7a0e44373"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTableState.query: MethodTooLong \u2014 query runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/query.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51fa24bf3bbd2dfa63b0d0106db7cb764a32723b70e91abe7434d9cb918763e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::analysis::render_correlation_matrix: FunctionTooLong \u2014 datui_lib::widgets::analysis::render_correlation_matrix runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8745fc84619c905b7551a90d5787e86e36e26b4c18e0eb1373328af1faf8c31f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::formats::dataflash::index: FunctionTooLong \u2014 datui_lib::formats::dataflash::index runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataflash.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0224a8621e4683d2c89b767d7ea9a6c563962909ce3be6db75145dd2d27baf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fix/dict.rs: FileTooLong \u2014 550 significant 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 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/dict.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a1b0d6321be80eb8ec31493b150c464ee9fcdf7a336183da9c3f75d3421086"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTableState.prepare_async_collect: MethodTooLong \u2014 prepare_async_collect runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/buffer.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3240722f0dceb7291fe3cb17528bf56a2f6793dd65a4aa7594f199209d58a4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::read_lines: FunctionTooLong \u2014 datui_lib::widgets::data_quality::read_lines runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d07f7a7ab5d74af6e6328e0ca543460f6fb7ba31860968df312ae92d7c32c00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataQualityResults.estimated_bytes: MethodTooLong \u2014 estimated_bytes runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":2191}}}],"partialFingerprints":{"codehealthFindingId/v1":"379d8ad47b74ec4da676d481f6c1d2cd7aec10ad049acdde750e572b43c67733"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Fitted.fit: MethodTooLong \u2014 fit runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"262beb6a6c34f16b85445d823fa6df5b8a09574aca0e8ae0465c5a43bbcce569"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::chart::chart_export::draw_bars: FunctionTooLong \u2014 datui_lib::chart::chart_export::draw_bars runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e08ac1c48f7984c5721c59f7e00294e270c056d3091529dfa422dc78f34f92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/formats.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/formats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76016a7bd3fc5a5812671737a69db648353417ae948058dba5e3cd53e963c03c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 537 significant 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 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b559e9709bd2bbf7773237eefe8ce78896b2a2c43f4bdf2686d715b7117b83d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PivotMeltModal: 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), 30 methods, 3 blocks, lines 302-995. 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":"crates/datui-lib/src/app/modals/pivot_melt_modal.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe118d1fe7f5b4cc31cd2d71e5263170afa2a706d4bfc9c370bfb94392030716"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Page.path: MethodTooLong \u2014 path runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_pdf.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf379d80f665e0434273b30dcb58d8434d34916861a15cd881f043028f695a8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTableInfo.render_detail_list: MethodTooLong \u2014 render_detail_list runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f58a2aecad20274062e24f22be153f9515aeee9d80cf3516060ac59577eca6f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Walker: ClassTooLong \u2014 425 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 2 blocks, lines 988-1550. The bar is 400 significant lines; this is 25 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b24e185318504e0e5475fda554461035caff335a946217c964f9ddae7eb642d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HomeState.slots: MethodTooLong \u2014 slots runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":4587}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb64e52476373f9b49953522c9068c57fceace987c8be7cf23bf81a1238013a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::render_overview: FunctionTooLong \u2014 datui_lib::widgets::data_quality::render_overview runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dedf6bca461eb73c4c4b729ba004ade1010ac87e2cf3d80a5f0fd8f74ecb89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::render_segments: FunctionTooLong \u2014 datui_lib::widgets::data_quality::render_segments runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"643276f35e67bac350e82dee06e17a472959cd8fd736c9ba1e2dcf1ccbb3c0e6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SampleForm: ClassTooLong \u2014 422 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 3 blocks, lines 98-718. The bar is 400 significant lines; this is 22 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/sample_modal.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f6f421722b8e8ee0911e794c3d81647ae0e7f275d4edf9034ab9a518b4ac56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/exact.rs: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/exact.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c89c83ef9723ed0e0dd03193d094377b49101720418662b35a29af29bff1c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inspector/inspector_reader.rs: FileTooLong \u2014 527 significant 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 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_reader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6acb82754de93e7df222e4dc6c1cf6b14f395a5b1f4f7b85b720f1d745f5ccdb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataTableInfo.render: MethodTooLong \u2014 render runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1829}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd15b476201c66360d8d36d49ab6bd8c39c2600331dd5449a3a41eeb88d3ad8c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Reader: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c6ebe4b4af772d9520c9e0b4432c34d0fa5370ca0939f864b88331495b3a64"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dictionary.parse_xml: MethodTooLong \u2014 parse_xml runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/dict.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d5a43835277e1e60c887ca46602004b654340418d139f415fe5a620e5ec15f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::render::home_view::entry_line: FunctionTooLong \u2014 datui_lib::render::home_view::entry_line runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"13086fde3fafd6069d78e94807f484be72bacca5508718ce2fe8cbebb2c46e8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::data_quality::render_access_plan: FunctionTooLong \u2014 datui_lib::widgets::data_quality::render_access_plan runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":4139}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd84dad245e6d382ca7b4910c8da1ae4a50679721d7adc60c4d893133861c6b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/matching.rs: FileTooLong \u2014 513 significant 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 90% of them inside a single declaration: Spec (2 blocks, 5-695). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/matching.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadce199250a068d3780c95a1c2f497006e00d0d4fea0e6655bd9062d5ccbf86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/pointer.rs: FileTooLong \u2014 510 significant 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 10 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/pointer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2110f7bff0a45dae7a1f4366133d0f14832d094b7ba4476ec5838f08b78586d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: formats/ulog.rs: FileTooLong \u2014 506 significant 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 6 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/ulog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7293f1116acda9c2802d6ba6c4b9fe27be55494c80e0d8eeb333c802c8f6f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_cli::man::roff::inline: FunctionTooLong \u2014 datui_cli::man::roff::inline 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":"crates/datui-cli/src/man/roff.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"281f5d4cd0003b16ccc6b55d634614ce50f698309ed6d017b7a8b95500cf04e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::home::catalog::command: FunctionTooLong \u2014 datui_lib::home::catalog::command 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":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6026c4f35dfb5730e130810633d67f2fd2c8e4e27c8fb60af44dc66bf6accc50"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::home::discover::classify: FunctionTooLong \u2014 datui_lib::home::discover::classify 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":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d65b39cb78cb24c978a0fbfa148d6cb4413fbcbf549d7549f48d35de92d73ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: datui_lib::widgets::sample_form::render: FunctionTooLong \u2014 datui_lib::widgets::sample_form::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":"crates/datui-lib/src/widgets/sample_form.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a79229231ecd5c2589fe6d459182bd6f6e76b2a430b47798675f23059c1af08"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SortModal: ClassTooLong \u2014 401 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 2 blocks, lines 22-688. The bar is 400 significant lines; this is 1 over it, 1.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cb88f4496384fd53a47daa77913efabb0d9bed8a4c78acf124a1a89939f034"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/datui-lib/src/widgets/data_quality.rs:2167-2292 | crates/datui-lib/src/widgets/data_quality.rs:2302-2394 | crates/datui-lib/src/widgets/data_quality.rs:2465-2621 | crates/datui-lib/src/widgets/data_quality.rs:3498-3677 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c12eaf29f7b16b07212e9e48df4331658a5f232f9016634946882ea9922ac29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): crates/datui-lib/src/config/mod.rs:1905-1977 | crates/datui-lib/src/config/mod.rs:1981-2048 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e418a05ab1a759e52a5cec7df943b5c8fa309b47b0e8535d0251ea7ad2dac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/datui-lib/src/formats/excel.rs:128-167 | crates/datui-lib/src/formats/gps/gpx.rs:172-216 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/excel.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21547cd9ea5da8f9d0d360d6079973b100387d8796440feafde8402456060eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/datui-lib/src/table/buffer.rs:603-634 | crates/datui-lib/src/table/buffer.rs:638-684 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/buffer.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baaa98d27563d0fddf464d9b764681189552b7840409710a7baa13893dee5cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/datui-lib/src/lib.rs:1938-1962 | crates/datui-lib/src/lib.rs:3997-4020 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"186295dc2bf11cf6773a88e79e2c7e649d5c2e4fe099d7849f10ee68acefa027"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/datui-lib/src/analysis/data_quality.rs:3690-3718 | crates/datui-lib/src/analysis/data_quality.rs:3744-3778 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":3690}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d2b103a79cc053a9539125a74e07c56e639f1bb18449127dbe51a0859b6c87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/datui-lib/src/app/hex_view.rs:666-688 | crates/datui-lib/src/app/hex_view.rs:691-712 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"633e68d31d379025e63409ba5cd50e689d638360df65475cf06d983685c7a9fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/datui-lib/src/app/modals/sort_modal.rs:469-495 | crates/datui-lib/src/app/modals/sort_modal.rs:497-529 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e4755558c72234712ea3e2339d48093575df44f0565e2e7105f1aa65e52dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/datui-lib/src/render/home_view.rs:1725-1750 | crates/datui-lib/src/widgets/data_quality.rs:1350-1379 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f91945781cf8ed1fd10362d1e5acf148bd0649b649f8d89fd50c3a180ba0a9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/datui-lib/src/formats/candump.rs:845-865 | crates/datui-lib/src/formats/fix/mod.rs:1005-1026 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/candump.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"26553dca3bd37c77ca50aca6fc29762c0452af4b6b8562e68e57e2b0fcad6652"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/datui-lib/src/app/modals/sort_modal.rs:157-184 | crates/datui-lib/src/app/modals/sort_modal.rs:188-206 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daf52b8ef65e40573873c664b4d7e213fb7aad9470de2239b539c44839e1215"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/datui-lib/src/formats/command.rs:10-26 | crates/datui-lib/src/formats/command.rs:666-678 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/command.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9336e155860dfa3e492bd784a9145563d40afc8bed1a8525869ecabe8a705299"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/datui-lib/src/cloud/azure.rs:365-391 | crates/datui-lib/src/cloud/gcloud.rs:132-160 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/azure.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcb18b78d36c0ab8ebc419305b966e0f03e1475a2a809d069042a59738fa00e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/datui-lib/src/formats/model_files.rs:341-363 | crates/datui-lib/src/formats/model_files.rs:425-446 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/model_files.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"213362c358fb413abaa1ec281df92256e206e68ec6029a15087edeae038119b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/datui-lib/src/app/keys/picker_keys.rs:42-63 | crates/datui-lib/src/app/keys/picker_keys.rs:166-186 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/picker_keys.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"584729f58402e33695af53d9e94f1f4cd0826c5efa068e4e072240f22133b893"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/datui-lib/src/home/discover.rs:1986-2002 | crates/datui-lib/src/home/discover.rs:2024-2039 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8ca87f8cc12ebe163ccbf47a4b155c89abe91becfb82d34d0e6f16469c905b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/datui-lib/src/export/nested_json.rs:105-127 | crates/datui-lib/src/export/nested_json.rs:249-266 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/nested_json.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce48c6e0a890e33dbdae06b017ef94e9b1190b379548b9baa2a98cd3e80e991"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/datui-lib/src/analysis/data_quality.rs:50-76 | crates/datui-lib/src/analysis/data_quality.rs:88-105 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d76f493a568948d327ab61e2f544e50d633af57028da0409b8c1a7f619c347"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/datui-lib/src/analysis/quality_runs.rs:308-326 | crates/datui-lib/src/analysis/sample_draw.rs:531-550 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_runs.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b477f456a37fa6b9bc26d5204619403fc26997e7d57db8a28353e90b457f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/datui-lib/src/home/discover.rs:1971-1979 | crates/datui-lib/src/home/discover.rs:2006-2017 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ef10d14c76186dd6d7ec4f6c51c81046ce5a177b959916fccdf1da215b3da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/datui-lib/src/config/mod.rs:981-995 | crates/datui-lib/src/config/mod.rs:1035-1052 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1de8b23bebe080d6d90b2bc8025b5853632c28b528e3e74ff7ee0617f019780"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/datui-lib/src/home/mod.rs:5402-5419 | crates/datui-lib/src/home/mod.rs:5427-5443 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":5402}}}],"partialFingerprints":{"codehealthFindingId/v1":"343ec4888cc6a082e63d6f86d0869cfc8259835cf560b9ae180fd5b7696e62a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/datui-lib/src/analysis/table_sample.rs:284-302 | crates/datui-lib/src/loading/follow.rs:1087-1109 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/table_sample.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e37372a218bcd0b42787af99347e2b78feda4e1521b052687ea7b3b900c0566"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/datui-lib/src/home/mod.rs:1203-1216 | crates/datui-lib/src/home/mod.rs:3858-3871 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba9856d0450d1c7ae23a7d899bf1d1de2f1d6d1e812a36610538085d6017bfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/datui-lib/src/formats/candump.rs:633-642 | crates/datui-lib/src/formats/candump.rs:797-806 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/candump.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ebac9857b6e05a075f181ee06af96f5abf2d6db50b1ed8887defee55e05083"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/datui-lib/src/app/modals/filter_modal.rs:194-202 | crates/datui-lib/src/app/modals/filter_modal.rs:211-219 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/filter_modal.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7458b93338ce5f35cf2f69726158f1fb9908c27b109cf34a16f381018f1e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/datui-lib/src/exact.rs:621-639 | crates/datui-lib/src/export/python_script.rs:16-32 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/exact.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49f0ad91ac01900d3414df815375e90f43ef742684045c30415c7ba7f99274e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/datui-lib/src/home/home_app.rs:2080-2097 | crates/datui-lib/src/home/home_app.rs:2355-2369 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f89e8468074cb042c913860eb3a824e069bf5c8076e1476f280952c9448775d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/datui-lib/src/cloud/gcloud.rs:32-42 | crates/datui-lib/src/cloud/s3_tools.rs:148-156 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/gcloud.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a019521a9d938dc202433cf0ee9e60397f5f18e2bef656898dc04692da91ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/datui-lib/src/home/mod.rs:5190-5203 | crates/datui-lib/src/home/mod.rs:5339-5350 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":5190}}}],"partialFingerprints":{"codehealthFindingId/v1":"74737ca88e3725a2319f71614ad6c168ef3740860f7841b2118c79c218f964c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/datui-lib/src/chart/chart_keys.rs:416-429 | crates/datui-lib/src/chart/chart_keys.rs:433-445 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_keys.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32ca01cc2a26058037d12970543bba3ea3d705cb6b8c03e5457985b1095e18e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/datui-lib/src/analysis/data_quality.rs:5559-5568 | crates/datui-lib/src/analysis/quality_intent.rs:700-708 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":5559}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f7514954b673405ae97c49cff582e4d75f5e17e125f1bb3c53b2facdba924f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/datui-lib/src/formats/fix/dict.rs:254-269 | crates/datui-lib/src/formats/parse.rs:19-32 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/dict.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb413f6356ab9d3f5804a2413b0c117663db7ee6139fc28f2182143d5185e578"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/datui-lib/src/app/hex_view.rs:842-856 | crates/datui-lib/src/formats/framed_records.rs:921-934 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b564597e9d4b25026cf4cca87b36d84c71cf14c752db7e0bfa11c74cd9224b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/datui-lib/src/formats/candump.rs:654-662 | crates/datui-lib/src/formats/candump.rs:818-826 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/candump.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"688cccc195bbf97d5bab605e3655107c6b325a93eca142a2fa6be04ae237c0ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/datui-lib/src/chart/chart_export.rs:742-756 | crates/datui-lib/src/export/python_script.rs:36-51 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"957593fcdbcbc29e8edd0f844b137b2550c8b1bb26c53283deabe26fb3d06543"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/datui-lib/src/chart/chart_data.rs:1636-1649 | crates/datui-lib/src/query/sql_assist.rs:132-142 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d555c511f0c349e967a09a804f91c585b182139fe0d370925e5d2542b1c4fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/datui-lib/src/analysis/distribution_fit.rs:794-805 | crates/datui-lib/src/analysis/distribution_fit.rs:808-820 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"2266405ebee4c2fb85a75ffd22ea2d816c3ab65267b9d266b04be8c47bb98ac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/datui-lib/src/formats/registry.rs:199-208 | crates/datui-lib/src/formats/registry.rs:210-219 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/registry.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff92a35ab6ff5eb65a422ef72368a2d7d94ee1429d51e7e09a1f02cb0be18fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/datui-lib/src/widgets/crosshair.rs:71-78 | crates/datui-lib/src/widgets/crosshair.rs:106-113 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/crosshair.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfbb50f672eb4891dd2e26a02bd6c2be3d5a690fabffcf33997076cb4bb79c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/datui-cli/src/units.rs:59-66 | crates/datui-cli/src/units.rs:69-76 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/units.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5949c9e6ceea52db2b06f673f5d579ee1d007057aa2fdacaa80eaccc0d08d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/datui-lib/src/chart/chart_data.rs:1301-1306 | crates/datui-lib/src/chart/chart_data.rs:1406-1413 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"10efce7e67ff757d0d475d4bc7485d00d813b53ee322ad2c462ab9bd7a756753"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/datui-lib/src/analysis/analysis_modal.rs:1138-1150 | crates/datui-lib/src/analysis/analysis_modal.rs:1292-1305 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_modal.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f9dc4d74ff3b86f75c613ce44a2b31f78aac7b18be363167223f57d6806ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/datui-lib/src/cloud/cloud_browse.rs:270-280 | crates/datui-lib/src/cloud/cloud_sources.rs:220-227 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_browse.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"811126679f5cf3edb2ab1232b6ff3aaf043b698ffd232bb9f1175b3a01729beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/datui-lib/src/formats/gps/mod.rs:476-495 | crates/datui-lib/src/formats/sdf.rs:503-514 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/gps/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"531ac2aa5f18c0f3391eaf41abdfa97447a0d457f8831b6228d6c8a6527977d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/datui-lib/src/loading/follow/lines.rs:145-154 | crates/datui-lib/src/loading/follow/stream.rs:198-207 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow/lines.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd6988af8c62994d93f459adc8b67e116bcf8570d99e3bd2ba7495640a57237"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/datui-lib/src/formats/fixed_records.rs:28-41 | crates/datui-lib/src/formats/lines.rs:258-266 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fixed_records.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc769ff4d1f15e26a0659e634736ed4e50a71c2de30ae8cfd262298c0552c5b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/datui-lib/src/app/hex_view.rs:715-722 | fuzz/src/hex_input.rs:14-20 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8079dd00521ea63cf34fec0d02f3326560eff5abfa0c9e0e61015425d5240b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/datui-lib/src/app/jobs.rs:1140-1148 | crates/datui-lib/src/app/jobs.rs:1152-1162 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/jobs.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6d581a18a44ba570cdbab8d128ec8d3345d6cfa99cd03b30a50cc9a2e6ef87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/datui-lib/src/home/mod.rs:5656-5667 | crates/datui-lib/src/home/mod.rs:5671-5684 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":5656}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ac031e16271ffa41a775dd34f322dacea02ba36cbce93d7893591d742836b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/datui-lib/src/cloud/azure.rs:770-778 | crates/datui-lib/src/cloud/cloud_sources.rs:722-728 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/azure.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c54bbb4ee3202056c9815090d8354c53dba3eacf3b2ae2e16c2b4a1931267aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/datui-lib/src/view/mod.rs:980-991 | crates/datui-lib/src/view/mod.rs:997-1007 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/mod.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7989f612f81ca306859d4497479669dca733eea870682f75a87e91ed2bbcba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/datui-lib/src/widgets/view_modal.rs:84-94 | crates/datui-lib/src/widgets/view_modal.rs:96-105 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/view_modal.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"13dc0577d566eda368edfe1cc22e7d40329c346ff797f77df5888d9f0039c8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/datui-pyo3/src/lib.rs:411-430 | crates/datui-pyo3/src/lib.rs:455-464 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-pyo3/src/lib.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a43349949d687f4a45531bc58428f38a92e3ccced00c1ccfd55b3465706f837"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/datui-lib/src/chart/chart_export.rs:1831-1844 | crates/datui-lib/src/chart/chart_export.rs:1847-1860 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec0ffab14286ca880de9b4836299f4df423fa3751f57d04c48e5bc2313c6ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/datui-lib/src/exact.rs:277-284 | crates/datui-lib/src/export/nested_json.rs:28-34 | crates/datui-lib/src/export/nested_json.rs:44-50 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/exact.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b9306119cf403b477e81b6b8c031db5b1c6b64d4feaf1dab0ec25b4bf4685e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/datui-lib/src/config/config_command.rs:141-148 | crates/datui-lib/src/config/mod.rs:2332-2339 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/config_command.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9245fe9cf35a8508c8339499dba77ebcd5e118a11343cfcfde025fa38dc4a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/datui-lib/src/chart/chart_keys.rs:407-413 | crates/datui-lib/src/chart/chart_jobs.rs:622-628 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_keys.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3021a9ce2530b23c775a3f6ce6b1c3338a2bce24fc6d00222082f0463c3e56b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/datui-lib/src/formats/members.rs:112-121 | crates/datui-lib/src/formats/readers/mod.rs:494-503 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/members.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c0e10ab3c2eacf773164db77732d481d872b836d8ba57279dd5d590e18b515"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/datui-lib/src/analysis/sample_modal.rs:687-700 | crates/datui-lib/src/chart/chart_export_modal.rs:417-426 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/sample_modal.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"99007d01e37908eb44708fd55d9b74be528fe81a4d61797740aca00e46b0ec63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/datui-lib/src/config/mod.rs:3392-3399 | crates/datui-lib/src/render/context.rs:113-120 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":3392}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fc38acd912c20b040e6115c6653f5d01edb6656371b50cce7fa5b48d55786a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/datui-lib/src/export/export_modal.rs:311-318 | crates/datui-lib/src/export/mod.rs:42-49 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/export_modal.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2165daa793362f21b6b76c300f3e776f1f7a8533ba69c5384479c89e369167e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/datui-lib/src/formats/dataset_files.rs:1124-1132 | crates/datui-lib/src/home/search.rs:311-318 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataset_files.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3431649d7a88cbf5e968d52313980322a78a7ea6a45fcfd1706a66b6ddaf9a9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/datui-lib/src/loading/follow.rs:1311-1319 | crates/datui-lib/src/numfmt.rs:337-344 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"debe4e03caf781552b36489fa0bfdf559604732b05af31ca1fc33cd8172d9229"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/datui-lib/src/export/python_script.rs:168-177 | crates/datui-lib/src/home/mod.rs:2192-2197 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"aded0fc80bb2114cde98e2f70cdd6f22fe6bc9653fafc90b57b46a77a4e869e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/datui-lib/src/query/mod.rs:1560-1565 | crates/datui-lib/src/export/avro_types.rs:22-28 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"32936cd33e2eddb531fa09c29e9b691bb9f58a84b25fe5d7d5bf32346427c33f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/datui-lib/src/formats/sqlite.rs:1672-1682 | crates/datui-lib/src/loading/follow/lines.rs:132-142 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/sqlite.rs"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48b614b8856f2bc0f6362da091810d3633d1d7a0924891a459f661d888ff893"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/datui-lib/src/formats/fix/mod.rs:419-426 | crates/datui-lib/src/formats/gps/gpx.rs:379-387 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8d8f4ae7c63df6e4972a37058616b49a777b52feb2b9beb94f3864ba6bdc4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/datui-lib/src/app/modals/pivot_melt_modal.rs:179-185 | crates/datui-lib/src/view/mod.rs:349-355 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/pivot_melt_modal.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7ef51629eee57c9100f30de5e380031fb93ab7c00e02bdc6df3aa841c780e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/datui-lib/src/formats/dbc.rs:99-102 | crates/datui-lib/src/formats/fix/dict.rs:272-275 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dbc.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4786305dfdeaaa836e2a57f591ce941408bc9f928b392f201d9f50d46038bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/datui-lib/src/app/modals/pivot_melt_modal.rs:255-258 | crates/datui-lib/src/home/home_app.rs:149-152 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/pivot_melt_modal.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e78c4cbebe1bb2b10f4745aaa19c5cb84e3c82c379c3ce59f8ff685967d260a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/datui-lib/src/loading/follow/lines.rs:160-163 | crates/datui-lib/src/loading/follow/stream.rs:213-216 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow/lines.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"57570932482e617e3da1bb3025e6490c494cc0578a54593b2125f3437fa3e772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/datui-lib/src/analysis/statistics.rs:197-202 | crates/datui-lib/src/formats/excel.rs:120-125 | crates/datui-lib/src/home/home_preview.rs:149-154 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/statistics.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4c30b2186e04d858ffa860df7a99e8933dc9e7957af991dd685a50eacf722f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/datui-lib/src/formats/gps/gpx.rs:390-396 | crates/datui-lib/src/formats/vcd.rs:333-338 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/gps/gpx.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"de62c3be959861b3dc1d2a070cd71016542b8bee74c41194e57c4eaaebe63ea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/datui-lib/src/analysis/statistics.rs:190-195 | crates/datui-lib/src/app/form.rs:103-109 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/statistics.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18ea11850422a1e3d6aa536d2d09c525ff25573d021a58105f267e69f5752d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): crates/datui-lib/src/chart/chart_jobs.rs:85-90 | crates/datui-lib/src/formats/layout.rs:30-32 | crates/datui-lib/src/formats/schema_union.rs:1908-1914 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_jobs.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf79d6043aa080002596b844ce75f464c79cfca7c3be1e52fab3824bbb5294e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/datui-lib/src/cloud/azure.rs:635-638 | crates/datui-lib/src/cloud/cloud_sources.rs:883-886 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/azure.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bf508186e3597dd79f8fcc8d63c00e97b71e1ac97b5c3f46ac1b4919233f55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/datui-lib/src/config/mod.rs:762-765 | crates/datui-lib/src/formats/gps/nmea.rs:333-336 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70fb377f97810791fc6fb2435440e13793bac01da2e0c584bdc423485ba4195"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/datui-lib/src/formats/ulog.rs:254-256 | crates/datui-lib/src/inspector/inspector_bytes.rs:73-75 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/ulog.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b37d79f5a49db4030f31627fde1d5c98128d92f3487ed3e5934d8eec254c4b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/datui-lib/src/app/modals/pivot_melt_modal.rs:951-954 | crates/datui-lib/src/chart/chart_modal.rs:2007-2010 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/pivot_melt_modal.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"caba015da05aaca9586ec2f66d89e64b203c21c4552520f4c376394d67cd1db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/datui-lib/src/formats/ulog.rs:258-260 | crates/datui-lib/src/inspector/inspector_bytes.rs:69-71 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/ulog.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"717b4c121b0d640e16613d8a81a5c665f40b98269f52522ec629abd1acb133d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201335 lines \u00D7 2): crates/datui-lib/src/loading/open_scan.rs:2815-2849 | crates/datui-lib/src/loading/open_scan.rs:2860-2892 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/loading/open_scan.rs:2815\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":2815}}}],"partialFingerprints":{"codehealthFindingId/v1":"49714ff8d1cb3cc33d2403a568f8d8594bc079b3ad91e5b3b8578f76c418ba4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201334 lines \u00D7 2): crates/datui-lib/src/table/buffer.rs:604-632 | crates/datui-lib/src/table/buffer.rs:639-672 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/buffer.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbeb926f741ab25a2096075bfcc7e843c3148a3b4b520b3bb909a88af85fa7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): crates/datui-lib/src/query/mod.rs:2582-2609 | crates/datui-lib/src/query/mod.rs:2643-2672 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/query/mod.rs:2582\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f121c9861912012b8dc8cbecc7057549e2f27517960024ae3b87778525ab726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/datui-lib/src/app/modals/sort_modal.rs:629-646 | crates/datui-lib/src/app/modals/sort_modal.rs:656-673 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e7b0058d1644cb4422ebf5c08b302d4bbbe0ebf18e948c2eccb208e96f75b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/datui-lib/src/render/home_view.rs:2893-2910 | crates/datui-lib/src/render/home_view.rs:2939-2955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":2893}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1f73448c7d3eb0dbfec5a73f4a973b490e3783ac6fc99f668e80aad496cb1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/datui-lib/src/formats/excel.rs:151-167 | crates/datui-lib/src/formats/gps/gpx.rs:200-216 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/excel.rs:151\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/excel.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"130566041210ec3ad05f6697bb82783c78d07ddc745b248d937b9ede44d49c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/datui-lib/src/render/sort_filter_sidebar.rs:86-102 | crates/datui-lib/src/widgets/pivot_melt.rs:170-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"db34c53b81983d7ec11e19e1e9c9ba93d1cd9ce74fbc1cc3f2c7d56c9ed7733f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/datui-lib/src/formats/fixed_records.rs:852-867 | crates/datui-lib/src/formats/indexed.rs:128-142 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/fixed_records.rs:852\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fixed_records.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbb3975716928df6597e852fb0fdc94cdcfea617c20ab8097c4ea8f5169b1ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/datui-lib/src/widgets/analysis.rs:682-700 | crates/datui-lib/src/widgets/analysis.rs:913-931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dadf96e634dd4acd6d50ba73119bf54bb1ec117e43fcb8eefac0943e3a5f1c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/datui-lib/src/exact.rs:18-32 | crates/datui-lib/src/exact.rs:46-58 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060v\u0060 to \u0060f64\u0060 in one and \u0060f32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/exact.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e99a5c760525832829eaa4eba04c145bd99ae230d7561e9951820e568c7fccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/datui-lib/src/loading/open_scan.rs:2815-2828 | crates/datui-lib/src/loading/open_scan.rs:2860-2873 | crates/datui-lib/src/loading/open_scan.rs:2902-2915 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":2815}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66854910fa5d018ad7757fa3f929efc96d694495a9dcda085f9606b87838cc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/datui-lib/src/formats/dataflash.rs:182-195 | crates/datui-lib/src/formats/dataflash.rs:249-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/dataflash.rs:182\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataflash.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31685961486d7cd88a37b92f6384c804236852940001c6f153f852521c783fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/datui-lib/src/formats/dataset_files.rs:270-282 | crates/datui-lib/src/formats/dataset_files.rs:294-306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/dataset_files.rs:294\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataset_files.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1343f35b70680c3bc85841450987e7ac0be7c3c003f6b5204a44a449a9576f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/datui-lib/src/widgets/analysis.rs:725-737 | crates/datui-lib/src/widgets/analysis.rs:1038-1050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/widgets/analysis.rs:725\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/datui-lib/src/widgets/analysis.rs:724\u0060 calls \u0060column_spacing\u0060 and \u0060crates/datui-lib/src/widgets/analysis.rs:1037\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1f74c9caf9194e4c4796007c58ce76d79f3992775b22560099e3b9cbdffcac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/datui-lib/src/query/mod.rs:2612-2621 | crates/datui-lib/src/query/mod.rs:2674-2685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/query/mod.rs:2612\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdfaa884a489c252a2fe77f5b2ad94d66c2d03254a024743a4daeef2ffee319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/datui-lib/src/widgets/analysis.rs:316-327 | crates/datui-lib/src/widgets/analysis.rs:328-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bef274c663a46928da73563ef7dbf2b2d56a88baa39327929aec7798fcd466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/datui-lib/src/chart/chart_data.rs:1048-1057 | crates/datui-lib/src/chart/chart_data.rs:1074-1084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/datui-lib/src/chart/chart_data.rs:1085\u0060 calls \u0060push\u0060, \u0060unwrap_or\u0060 and \u0060crates/datui-lib/src/chart/chart_data.rs:1058\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"e055588ba3a4a5bb45e9dd76e08d9e3881a6de94d889f1c7b54a372688bf4498"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/datui-lib/src/cloud/azure.rs:862-870 | crates/datui-lib/src/cloud/cloud_browse.rs:285-295 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/azure.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a4cd703afe7e7ab538615f4012637afc7d43a0516629beab74fff641f2eedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/datui-lib/src/formats/parse.rs:2090-2101 | crates/datui-lib/src/formats/parse.rs:2190-2201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"7117a07266261a472642cc44fae076af3991f2c56854d3bb985288e155e03fdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/datui-lib/src/home/home_app.rs:2087-2097 | crates/datui-lib/src/home/home_app.rs:2362-2369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/home/home_app.rs:2087\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn home_browse_into(\u0026mut\u0060 in one and \u0060crate) fn home_jump_into(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21008d2798543991a62e15927eda82a05e020d96d59eb2bd4d4c7313913f60a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/datui-lib/src/query/mod.rs:2089-2099 | crates/datui-lib/src/query/mod.rs:2117-2127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/query/mod.rs:2089\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"42091b6b9a7dd94497b6d2930d3512a92d16e948f3bf9dac9d04fd1e5d5a89b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/datui-lib/src/render/home_view.rs:306-316 | crates/datui-lib/src/render/home_view.rs:365-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"135304ef6352a198cf12fe618ea76442b368640e417434b8c0e60ec973fbd5be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/datui-lib/src/render/sort_filter_sidebar.rs:63-73 | crates/datui-lib/src/widgets/pivot_melt.rs:150-160 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/render/sort_filter_sidebar.rs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"13104e23c0fa681e95f80af4410cde7b867ff869634d1cabc01a34dcaad70e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/datui-lib/src/widgets/data_quality.rs:3135-3145 | crates/datui-lib/src/widgets/data_quality.rs:3608-3618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/widgets/data_quality.rs:3135\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":3135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70e1aeac3b2eeb3d1b9b32cece55a541aa3db5157933ff64c5e980ed24ac8a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/datui-lib/src/widgets/documentation.rs:591-601 | crates/datui-lib/src/widgets/documentation.rs:605-615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/widgets/documentation.rs:591\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/documentation.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a64dee670eede54cd966dd82cfaa210094d6314f19a7ba4aaf973214a20f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/datui-lib/src/app/event_pump.rs:992-999 | crates/datui-lib/src/lib.rs:1796-1805 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/event_pump.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"6abb78a23c658f5eac0bf5103f0195cdf4f8db718c8dd17e99eec819b1871114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/datui-lib/src/app/modals/sort_modal.rs:498-507 | crates/datui-lib/src/app/modals/sort_modal.rs:584-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/app/modals/sort_modal.rs:498\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec06f435e05017892f84fc6954b769b37b32a79c164da91805f716e8f11933a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/datui-lib/src/formats/candump.rs:854-863 | crates/datui-lib/src/formats/fix/mod.rs:1015-1024 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/candump.rs:854\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/candump.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c473fb7e2ebe3329986ddbc81d3fa7690eb0244ac898df5a4c360384ae18bc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/datui-lib/src/formats/dataflash.rs:459-468 | crates/datui-lib/src/formats/ulog.rs:656-665 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/dataflash.rs:459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataflash.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ac902b3225fd89ad846ee01cf84b31c6cdfe074359ed638d56b8fb73273a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/datui-lib/src/home/mod.rs:3818-3827 | crates/datui-lib/src/home/mod.rs:3843-3852 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/home/mod.rs:3818\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/datui-lib/src/home/mod.rs:3815\u0060 calls \u0060is_empty\u0060, \u0060azure_account_place\u0060 and \u0060crates/datui-lib/src/home/mod.rs:3842\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":3818}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad7a5ad46f96314bf02b2dc0c4c7bbc48580d616d3d0687c6833a058d829a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/datui-lib/src/render/datatable_main.rs:408-417 | crates/datui-lib/src/widgets/retype.rs:56-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/render/datatable_main.rs:408\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/datatable_main.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b883c6dd5702ad01f42cbefc9f1838aee1f7931c91e6d55783bd0c0d6467e236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/datui-lib/src/widgets/data_quality.rs:1885-1893 | crates/datui-lib/src/widgets/data_quality.rs:4259-4268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"9353ebacd0ee433896618f20d3f80174edd91922ea855830fdca969b1e8f5d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/datui-lib/src/widgets/inspector.rs:2380-2389 | crates/datui-lib/src/widgets/inspector.rs:2503-2512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/widgets/inspector.rs:2380\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8ad232f8424349aa4e6abd817079ff732af72cb782af715df46a5b15ce64d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/datui-lib/src/analysis/analysis_keys.rs:236-244 | crates/datui-lib/src/analysis/analysis_keys.rs:260-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/analysis/analysis_keys.rs:236\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_keys.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"1468b4f59a4bc48c49d285f486f8524e644ddf7e0e095cb301e8e29c02dc2e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/datui-lib/src/analysis/distribution_fit.rs:1171-1179 | crates/datui-lib/src/analysis/distribution_fit.rs:1182-1190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/distribution_fit.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"caea5c68b6920008f42d23f475cdf85d30f315919b1b35617cc691fd2099fd14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/datui-lib/src/app/hex_view.rs:667-675 | crates/datui-lib/src/app/hex_view.rs:692-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"a948b4bcc24b6494cbb3478eda77152ace7be6df942f227029a7c9a19dc5372e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/datui-lib/src/formats/fix/dict.rs:255-263 | crates/datui-lib/src/formats/parse.rs:20-28 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/dict.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4dd7d80d3e79e5d50414565e8ea3aa6ed21a8abdee6fa2fe102ee09b881f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/datui-lib/src/formats/fix/dict.rs:646-656 | crates/datui-lib/src/formats/gps/gpx.rs:329-339 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/gps/gpx.rs:329\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/dict.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"f233444351ef6c637915fd6affb73b889ce17cce5f8e75b6e5fca9869a39aa3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/datui-lib/src/formats/matching.rs:57-65 | crates/datui-lib/src/formats/matching.rs:284-292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/matching.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fba04f7619d4337778a5b523e1c55f223a8c0ad543abc97d7fe56006cbfcd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/datui-lib/src/query/sql_assist.rs:117-125 | crates/datui-lib/src/query/sql_assist.rs:217-225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/query/sql_assist.rs:117\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/sql_assist.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb56b810b02afb0dd10f95946f4a9a6cf5be230ab210af321da6100ec423ba65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-cli/src/lib.rs:795-802 | crates/datui-cli/src/man/mod.rs:496-503 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-cli/src/lib.rs:795\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42fbd2e1e5224ecb81803fdbe76fc4aabaf87f0b279e73afd0d7efe26d9502f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-lib/src/analysis/data_quality.rs:3692-3699 | crates/datui-lib/src/analysis/data_quality.rs:3751-3758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/analysis/data_quality.rs:3692\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":3692}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed87501ae4533a0bb94f34023486840055251b669f368562080c8662233f72f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-lib/src/analysis/quality_report.rs:2193-2200 | crates/datui-lib/src/analysis/quality_report.rs:2222-2229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d2b66d9f3b8c660e9e37901a2aef62e1abec6ca6ec5e364ae8f51130a6f933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/datui-lib/src/config/mod.rs:2820-2829 | crates/datui-lib/src/config/themes.rs:82-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/config/mod.rs:2820\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65689e3749e5ac2a031152105b9c2b4b7e228d6ef3bae50a781d107852d0b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-lib/src/formats/dataflash.rs:344-351 | crates/datui-lib/src/formats/ulog.rs:208-216 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataflash.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5284ba122e7fe60dc88144106475cbc6932c189479ceb9b5f3cebca19d3f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/datui-lib/src/formats/fixed_records.rs:684-691 | crates/datui-lib/src/formats/framed_records.rs:250-256 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/fixed_records.rs:684\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fixed_records.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c89ec3060c5b5217ca9689bb745de4f59fe6bb108826e798e021ee255d4f677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-lib/src/formats/midi.rs:960-967 | crates/datui-lib/src/formats/model_files.rs:1221-1228 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ab4342430ecb3b833326d84a32faf45971aae1b4e31594b1a35aa00708368a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-lib/src/formats/numpy.rs:1299-1306 | crates/datui-lib/src/formats/text_formats.rs:133-140 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/numpy.rs:1299\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/numpy.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ef8b5601b7f837d779fa6c3fdb7dd8b406f3fed55cbd37d1a4dd3070fbf4d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-lib/src/query/sql_group.rs:93-100 | crates/datui-lib/src/query/sql_group.rs:166-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/sql_group.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0351de7e84b24d3f66b04b65ff5367dc6ff401b354b9e3a046a72b24fd229bdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/datui-lib/src/app/modals/sort_modal.rs:384-390 | crates/datui-lib/src/app/modals/sort_modal.rs:498-504 | crates/datui-lib/src/app/modals/sort_modal.rs:584-590 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/app/modals/sort_modal.rs:384\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"48184554e02ad4f6fd29569de8bbbeda53798514c2e87f104aa09c3228e019d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/datui-lib/src/loading/open_scan.rs:2842-2850 | crates/datui-lib/src/loading/open_scan.rs:2887-2893 | crates/datui-lib/src/loading/open_scan.rs:2927-2933 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/loading/open_scan.rs:2842\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":2842}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da632721356ca07ae6fc75c23eb34f1878d7942f073684efab49fd0edafa949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/datui-lib/src/query/mod.rs:2612-2618 | crates/datui-lib/src/query/mod.rs:2674-2682 | crates/datui-lib/src/query/mod.rs:2706-2712 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/query/mod.rs:2612\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":2612}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f981c4fc78eca939b5306268fd63514dd82c570c62eae5d2a27e436a57cc5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/app/modals/copy_modal.rs:253-259 | crates/datui-lib/src/app/modals/pivot_melt_modal.rs:611-617 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/copy_modal.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"479d2202f9931d3f2157aaa6ad8c81edb07dbf1072d5e67b41ecc3c43f853a09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/formats/candump.rs:656-662 | crates/datui-lib/src/formats/candump.rs:820-826 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/candump.rs:656\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/candump.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8abf8b9a1568d2c0145b98c97f768ccba2a819e689b26100ed6ef7c629b018"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/formats/registry.rs:382-388 | crates/datui-lib/src/formats/registry.rs:400-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/registry.rs:382\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/registry.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e1ef66443f6ed3d1ad3c09bad120dca1e950625ff27b7c958ead2e60ee5139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-lib/src/home/discover.rs:1987-1994 | crates/datui-lib/src/home/discover.rs:2025-2032 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"644dc7f86b5c9402a68362e490f398dbb0758595fe73aa60428c4df627722b67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/loading/follow/lines.rs:146-152 | crates/datui-lib/src/loading/follow/stream.rs:199-205 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow/lines.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc9aa9f611b218ddda2e5c957e1659043ce8fb1af56a3430f71c13306972fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/datui-lib/src/render/footer.rs:715-721 | crates/datui-lib/src/render/footer.rs:792-797 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/render/footer.rs:715\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/footer.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"332978a7218be46a191f167876f5f7dbf19e43bc2752be780487f18d9db6ee42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/datui-lib/src/render/home_view.rs:1968-1976 | crates/datui-lib/src/render/home_view.rs:2913-2921 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/render/home_view.rs:2913\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff921a84c29f997710b73053f17ab0411a2cfa73c5954ae00d18da881d84849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/render/sort_filter_sidebar.rs:271-277 | crates/datui-lib/src/render/sort_filter_sidebar.rs:738-744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/render/sort_filter_sidebar.rs:271\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fa9c5fa24b488046b9f64c84c5a0c42f156fd58fd1177a5f96159d1b8f5074"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/widgets/data_quality.rs:2466-2472 | crates/datui-lib/src/widgets/data_quality.rs:3499-3505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2466}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f29948e897fb9ff4cfed11e0bad66f660646fbfe650cc74e8f9f602007e54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/widgets/inspector.rs:321-327 | crates/datui-lib/src/widgets/inspector.rs:414-420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/widgets/inspector.rs:321\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59be990b469e4b442a292c494bd79a5bf804fe04e7e6b0b1502086f1d937a1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/analysis/data_quality.rs:3927-3932 | crates/datui-lib/src/analysis/data_quality.rs:4064-4069 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":3927}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a417d0ecf623d8f4a5eeae0e3cc4becd24a47670540c858f81a795cf82d5de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/analysis/data_quality.rs:5562-5568 | crates/datui-lib/src/analysis/quality_intent.rs:702-708 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/analysis/data_quality.rs:5562\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":5562}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bb29655ecfab824d041439d55706ce9c01ec0739e525f5ad1e746351d092ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/analysis/quality_runs.rs:317-322 | crates/datui-lib/src/analysis/sample_draw.rs:542-547 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/analysis/quality_runs.rs:317\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_runs.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"71988dd794b862ad8785715f9cf4af5f95f65d34364553f4c587ec2b897553ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/analysis/statistics.rs:1038-1043 | crates/datui-lib/src/analysis/statistics.rs:1053-1058 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/analysis/statistics.rs:1038\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/statistics.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85bb4e927a3ee2f8f821e71878e1af77c9f9b46f19d6228fdbce710b402e15a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/cloud/local_copy.rs:336-341 | crates/datui-lib/src/table/mod.rs:511-516 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/local_copy.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ed947b68fef017fb7c1065a6ceddc7e586f7b77602f86ec1cd579396cec5b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-lib/src/formats/fixed_records.rs:334-341 | crates/datui-lib/src/formats/framed_records.rs:900-907 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/fixed_records.rs:334\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fixed_records.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edd0febc4c154d243cfcea0f85b15842e829eabdebd333bc09261fabd8be71c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/home/mod.rs:5414-5419 | crates/datui-lib/src/home/mod.rs:5438-5443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/home/mod.rs:5414\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":5414}}}],"partialFingerprints":{"codehealthFindingId/v1":"3052550cb2295e4fc39e8d30c18b0998583c05b3fe14648e2f78137137164b2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/table/facts.rs:147-152 | crates/datui-lib/src/table/facts.rs:179-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/table/facts.rs:147\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/facts.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52bab1d06cb76024500d57d54013f32ee6c074d9388e168723d3c4cdef6e805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/widgets/data_quality.rs:2616-2621 | crates/datui-lib/src/widgets/data_quality.rs:3672-3677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/widgets/data_quality.rs:2616\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba17c81b0b524ee3ff85ecd5202fab095784e0aa9a59ddcc023dce26397499a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/datui-cli/src/docgen.rs:362-367 | crates/datui-cli/src/docgen.rs:383-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-cli/src/docgen.rs:362\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/docgen.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8952ea397b5f2a716d17d6503e03fa2d179da5578249da82e1bcdd4b1d25ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/datui-lib/src/app/hex_view.rs:717-722 | fuzz/src/hex_input.rs:16-20 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/app/hex_view.rs:717\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd5059d6dc7f298b49575108f883431f1bff9fc3d15899e5cf3d662cbb15b90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/datui-lib/src/app/modals/sort_modal.rs:302-306 | crates/datui-lib/src/app/modals/sort_modal.rs:441-445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/app/modals/sort_modal.rs:302\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/sort_modal.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"487a0539d709567aaa055c12a5655af87a29cb02f5a2d2b4bbf8a7b44b41b190"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/datui-lib/src/cloud/azure.rs:533-537 | crates/datui-lib/src/cloud/azure.rs:599-604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/azure.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"9057d0cdd01166d817295c3128b57922b95544196cec1274826fc0eb68fc8758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/datui-lib/src/export/python_script.rs:475-479 | crates/datui-lib/src/export/python_script.rs:485-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/export/python_script.rs:475\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d48425400f9f9450e5cdbf6e2ccf68ed559a13a1abc634ba05d01e35400a4f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/formats/candump.rs:637-642 | crates/datui-lib/src/formats/candump.rs:801-806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/candump.rs:637\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/candump.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c1be47cf662128c27b12d01fdaa94f48ad80692e738281ca89f3695abbc161"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/formats/readers/csv.rs:63-68 | crates/datui-lib/src/formats/text_formats.rs:137-142 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/readers/csv.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52350cdab4c78864f5b8636b036fe0523baa81c70dcdf6aff00ebf338bae182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/home/catalog.rs:116-122 | crates/datui-lib/src/home/codebook.rs:22-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/home/catalog.rs:116\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b8c39fbb3f8d2f13e721be9da2720f6c0e3fd09d57b082b8fdcb73eadff9a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/render/footer.rs:617-622 | crates/datui-lib/src/render/footer.rs:839-844 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/footer.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dde7d2609409f0cf4b96fdf96b339c360a528efaf743dac181fc66b1b78cdf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/datui-lib/src/table/mod.rs:595-599 | crates/datui-lib/src/table/view.rs:315-319 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/mod.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca7a1b2cf5f81cb79ad593b425b20d89264cbdea29b4fd9dba208bbdeca2720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/widgets/data_quality.rs:2287-2292 | crates/datui-lib/src/widgets/data_quality.rs:2389-2394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/widgets/data_quality.rs:2287\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"15268157888edb04d6ee011549d93738442883a8aab59c180d268ef7546284d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/datui-lib/src/widgets/data_quality.rs:2388-2392 | crates/datui-lib/src/widgets/data_quality.rs:2615-2619 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":2388}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efde89529870cedbab62b12ff64acd4165d2b2b1417ff31d71fecf458d54554"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/datui-lib/src/analysis/quality_report.rs:2322-2328 | crates/datui-lib/src/chart/chart_keys.rs:449-455 | crates/datui-lib/src/lib.rs:5717-5723 | crates/datui-lib/src/widgets/quality_intent.rs:237-243 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 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 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2272e735fc59468476f9edcd3c4abd0f4837668c979d1d5b5f4ae8727c089501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/formats/fix/mod.rs:429-434 | crates/datui-lib/src/formats/sdf.rs:237-242 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcbd7b51f802a3dbf1d5f81fac0697b3955eaab902ccf4771b5a9609843d516"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/formats/lines.rs:653-658 | crates/datui-lib/src/formats/spec_union.rs:80-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/lines.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d0df5cba3a56d37fefb1bc44837c0d823ebad0fc0af58ae3a79e94dd2300eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-lib/src/widgets/analysis.rs:1566-1573 | crates/datui-lib/src/widgets/data_quality.rs:182-191 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"475435315ba79b566c90fcfaf0909949ce8bf85bd40064fa77bcfc5d702b5720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/datui-lib/src/widgets/data_quality.rs:3118-3126 | crates/datui-lib/src/widgets/data_quality.rs:3586-3597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/widgets/data_quality.rs:3118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":3118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65ff04b57b337c208235462001d23aae5a14480925db694d1056935807c8760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/datui-lib/src/widgets/data_quality.rs:1956-1964 | crates/datui-lib/src/widgets/data_quality.rs:2331-2340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/widgets/data_quality.rs:1956\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b08379850a35175a657674333fe43cfaa1c32237e9cd9e6244620be4d360750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/datui-lib/src/widgets/info.rs:1209-1218 | crates/datui-lib/src/widgets/info.rs:1237-1246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc04d49db82c0e2e5ec2a5a04273c03a770ef829867fe20bbb3d0a3df4bbb41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/datui-lib/src/loading/open_scan.rs:1447-1456 | crates/datui-lib/src/loading/open_scan.rs:1818-1827 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/loading/open_scan.rs:1447\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caeab9de7703d4dba5eb089bdd413b29c4d897348eb296f35cace6446480e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/datui-lib/src/formats/parse.rs:1311-1318 | crates/datui-lib/src/formats/parse.rs:1843-1850 | crates/datui-lib/src/formats/parse.rs:1945-1952 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/parse.rs:1311\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/datui-lib/src/formats/parse.rs:1309\u0060 calls \u0060strip_prefix\u0060, \u0060unwrap_or\u0060, \u0060to_string\u0060 and \u0060crates/datui-lib/src/formats/parse.rs:1841\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce57c64573f5727335d92db8ae82f68d1ae547617a62ddbe5fa32a0b032675f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/datui-lib/src/home/catalog.rs:341-348 | crates/datui-lib/src/home/catalog.rs:414-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/home/catalog.rs:341\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dea113f2cd3cb0e36da8ac3c22517adfcbbba14bd05bbd903b81c64701cb65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/analysis/statistics.rs:695-701 | crates/datui-lib/src/analysis/statistics.rs:703-709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/analysis/statistics.rs:695\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/statistics.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"a707e9a5841772287cc8fa3eb6457e65f0fe68ca2fd3ffbbe8119e2448d1c5a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/datui-lib/src/loading/tee.rs:49-55 | crates/datui-lib/src/loading/tee.rs:87-93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/tee.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1477a89f061f823b05730d578beb3e517d08576496fdf8e226fff5a913d6e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/datui-lib/src/formats/parse.rs:350-354 | crates/datui-lib/src/formats/parse.rs:517-523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/datui-lib/src/formats/parse.rs:350\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe61990ce5bd393140e77af7e95659f299925dc6377989ee7890e5999354dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/cloud/azure.rs:716-721 | crates/datui-lib/src/cloud/azure.rs:847-852 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/azure.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd591ef2d2f3de1d2fd254dea931ade9f9eebf4cd19712877500f02f568672c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/datui-lib/src/cloud/cloud_browse.rs:526-531 | crates/datui-lib/src/cloud/cloud_browse.rs:789-794 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_browse.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"568cd44eed32f46e0eddfa661d3ecb79f9909e6db156ea22c957cd24ad358014"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/datui-lib/src/table/copy.rs:582-586 | crates/datui-lib/src/table/copy.rs:767-771 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/copy.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdedbcaf4670fd0eab73ef6d141943e917eff2d42ea96931563b235e8588a48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/datui-lib/src/widgets/chart.rs:978-982 | crates/datui-lib/src/widgets/chart.rs:1113-1117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"691daee61984f8eda8fa2fc1e75c1948f0ac2814adaf6661efc6a57db90b6ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): scripts/bump_version.py:191-216 | scripts/bump_version.py:234-266 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bump_version.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c6a06c4e668b63e605cfdbd88dbfc46f207c68740f64399fad0d16db7dbec7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): scripts/docs/build_all_docs_local.py:32-41 | scripts/docs/rebuild_index.py:23-34 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/docs/build_all_docs_local.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd2fc61de74fad1ca5da24f020abc60bee1a7616a49541d38f6ab057aae5541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/docs/generate_command_line_options.py:25-36 | scripts/packaging/build_package.py:55-66 \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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/docs/generate_command_line_options.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"069ab9e4ca7a4a7ffebb1a8deddccb46f751d985ff3634c9ca1a27b28f3b3683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): scripts/bump_version.py:120-129 | scripts/bump_version.py:220-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/bump_version.py:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bump_version.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feab9c16ea4247453bb455f3d8566ebc4df83901ead65be79789fd1f12f5ddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/generate_sample_data.py:234-241 | scripts/generate_sample_data.py:272-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_sample_data.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d759605427fed82fc1d2b62ac9944430688b92bb4bc64fa0effca17951632b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: datui-cli: datui-cli: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"17541801d9b6853124eee99f3504dc349e20e0b1a9078d369e778130396e9182"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Setting (LCOM4 4): Setting\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/settings.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8899cad41c924afbf88c4a6657d0fb29087208843828704b221aa6a6c6d4b174"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RenderContext (LCOM4 4): RenderContext\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/context.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0283a32976bf93c1841280240a1d61a743f404aed77073e602bb983f550f766e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/lib.rs: crates/datui-lib/src/lib.rs changed 282 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 181 in App::key at line 2956. 12 of those changes were fix/bug commits, and the other 270 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":2956}}}],"partialFingerprints":{"codehealthFindingId/v1":"e897b1ea8eab577cf1b4c20430e6e223551b3d2635c7d28227e2e2de7da9c14d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/config/mod.rs: crates/datui-lib/src/config/mod.rs changed 77 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in CloudConnectionConfig::validate at line 521. 1 of those changes was a fix/bug commit, and the other 76 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/config/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f9b6411f93d23d531c9e36c51f0661675d9a00ae21b5158420d3b3b159ddfe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/render/main_view.rs: crates/datui-lib/src/render/main_view.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in datui_lib::render::main_view::data_quality_control_keys at line 463. 5 of those changes were fix/bug commits, and the other 58 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/render/main_view.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/main_view.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"7079fcf002916736e7f8af294465fa1ed65157a360136f27ecb7c0c1a1fcfddb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/render/home_view.rs: crates/datui-lib/src/render/home_view.rs changed 71 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in datui_lib::render::home_view::preview_head_keyed at line 1918. 5 of those changes were fix/bug commits, and the other 66 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/render/home_view.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":1918}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac40c67879017d47616e394b1db05ba4c89a9f090e7b94666a5a3c65ccd81c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/home/mod.rs: crates/datui-lib/src/home/mod.rs changed 78 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in datui_lib::home::build_listing at line 2330. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/home/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef681fe584c4eae01be73e973e36a66617c731ed4103bf7f7fd48f65f071413"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/chart.rs: crates/datui-lib/src/widgets/chart.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in datui_lib::widgets::chart::panel_lines at line 106. 1 of those changes was a fix/bug commit, and the other 28 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/chart.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/chart.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d02b805c4cb70afc65e757130a7bb8901ac417cf90c442a6c3f9caa2a36c21a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/info.rs: crates/datui-lib/src/widgets/info.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in DataTableInfo::render_schema_table at line 887. 3 of those changes were fix/bug commits, and the other 38 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/info.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd8078a0407b33d71fe8134856b60922a4062ca909a7422ce8c43da93aada8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/render/datatable_main.rs: crates/datui-lib/src/render/datatable_main.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in datui_lib::render::datatable_main::render at line 16. 2 of those changes were fix/bug commits, and the other 40 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/render/datatable_main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/datatable_main.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"22bcdea17d58d79bd1bf4ba9cf3ba3c92d163a4b45f1dcbf06c7ceb7bfa1c55d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/query/mod.rs: crates/datui-lib/src/query/mod.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in datui_lib::query::tokenize at line 129. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/query/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dda653c153dfe4ffe781688d0fb2e765485660e55c0302d6878224eaa50b9f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/data_quality.rs: crates/datui-lib/src/widgets/data_quality.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in datui_lib::widgets::data_quality::read_lines at line 747. 2 of those changes were fix/bug commits, and the other 22 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/data_quality.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"559e8fe4594060e67a085ca6a7e149f2a1b4dc2901b9063ece7c220051622e74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/export/python_script.rs: crates/datui-lib/src/export/python_script.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Step::python at line 472. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/export/python_script.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/python_script.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aca1101b1c22d5123ac7605f27bfd12cd354a2bc2554b3c162615793c9d9b2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/analysis.rs: crates/datui-lib/src/widgets/analysis.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in datui_lib::widgets::analysis::render_correlation_matrix at line 1210. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/analysis.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/analysis.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0555f03db89a2d8588b258bd60c1e2cde4e266d3fbe80da8052186b71e304d18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/chart/chart_export.rs: crates/datui-lib/src/chart/chart_export.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in datui_lib::chart::chart_export::draw_plot at line 1136. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/chart/chart_export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_export.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a247053ee19c970e8b9592f7aad0932b00fe7bf3e99087fc4651f85f2c5da3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/chart/chart_modal.rs: crates/datui-lib/src/chart/chart_modal.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ChartModal::step at line 1695. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/chart/chart_modal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_modal.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e858dc17dbf63baa885fee63daca3e5978df39efcb4a7591c151198caaa6eec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/home/home_app.rs: crates/datui-lib/src/home/home_app.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in App::home_event at line 2445. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/home/home_app.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_app.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47ea1a08eb516d42402bf6acb25122d514454858432c594a71564c9a9aa2399"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/analysis/analysis_modal.rs: crates/datui-lib/src/analysis/analysis_modal.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in AnalysisModal::plan_choices at line 1363. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/analysis/analysis_modal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_modal.rs"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb2c9d82c1ac5e37eac2e7738ef5f081da4418d86445fe322772f11c0860bee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/view/mod.rs: crates/datui-lib/src/view/mod.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in datui_lib::view::calculate_relevance at line 1034. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/view/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/mod.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1ef14dd6ea6d8e01b2e59ebdd727f21878ca12d7e803c869abe727a28942ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/error_display.rs: crates/datui-lib/src/error_display.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ConversionFailure::sql_message at line 499. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/error_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":"crates/datui-lib/src/error_display.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f80c396b85ecc8e16bb42e889b4e870193117105ddcbcb18be21d3aeec0fbb1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/chart/chart_keys.rs: crates/datui-lib/src/chart/chart_keys.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in App::chart_key_inner 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-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/chart/chart_keys.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_keys.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5f7be11fd33612c9b90c6134d53d5cd8149aaa830f89944c2a03613c3edbb5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/analysis/quality_report.rs: crates/datui-lib/src/analysis/quality_report.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in datui_lib::analysis::quality_report::coverage at line 1637. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/analysis/quality_report.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"c299b9573cfdcbaf1547517a8efbbf6f11cb03f881759b69c5c93a5d9bd1de0f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/formats/fixed_records.rs: crates/datui-lib/src/formats/fixed_records.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in datui_lib::formats::fixed_records::decode_values at line 430. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/formats/fixed_records.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fixed_records.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69ce5643deaa8b33b7a2396dfd8848423bde8ee3181837078976a54660a5c9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/render/sort_filter_sidebar.rs: crates/datui-lib/src/render/sort_filter_sidebar.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in datui_lib::render::sort_filter_sidebar::render_filters at line 600. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/render/sort_filter_sidebar.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"8107169cd00a2820f17ffca7af675867938a549bdabcf1173bc5339eb04791f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/home/home_keys.rs: crates/datui-lib/src/home/home_keys.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in App::home_key at line 10. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/home/home_keys.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/home_keys.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11bfdd68f8b1010ecb585d3f45c0fff27e581b8a30a77d2906c4e45e12f222e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/formats/fix/mod.rs: crates/datui-lib/src/formats/fix/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in FixReader::message at line 496. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/formats/fix/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c73ec397e75c255c96959494b943d5a82f0294f682fa581d09236b5b19336e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/render/view_sidebar.rs: crates/datui-lib/src/render/view_sidebar.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in datui_lib::render::view_sidebar::render_list at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/render/view_sidebar.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/view_sidebar.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd556b2bcf9a6be0a40a6ce2efd8f621dbc4746499e4ee4575a9d21c3ffe0351"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/pivot_melt.rs: crates/datui-lib/src/widgets/pivot_melt.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in datui_lib::widgets::pivot_melt::render_form at line 140. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/pivot_melt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/pivot_melt.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"480df1e798eb35769d8c1613e4a8eabc0cb26b44dfd3919b509b37977b1a4773"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/inspector.rs: crates/datui-lib/src/widgets/inspector.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in datui_lib::widgets::inspector::draw_fields at line 1628. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/inspector.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5acd414f275df6d21b2b94d15f175b37960f34b6854af011157b97a66be94dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/loading/follow.rs: crates/datui-lib/src/loading/follow.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in datui_lib::loading::follow::spool at line 2102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/loading/follow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"853d51beed13d85dff03a1987405fe0ea495b4890199a13cfa8df518541935e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/find.rs: crates/datui-lib/src/find.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in App::find_answered at line 1094. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/find.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/find.rs"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"c034a557157ec60bdae54d62406005674ef5c71e4ffe9f76984f90d98e7951cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/render/value_counts_view.rs: crates/datui-lib/src/render/value_counts_view.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in datui_lib::render::value_counts_view::draw at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/render/value_counts_view.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/value_counts_view.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76194143d098281262ccf272048d97c6773052c32246d883a1bf4c0fe30a02d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/app/keys/hex_keys.rs: crates/datui-lib/src/app/keys/hex_keys.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in App::hex_key at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/app/keys/hex_keys.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/hex_keys.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1694dcf81aef0dbc771017dca933faf90940504920eac2a12e82ad22a6510b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-cli/src/man/mod.rs: crates/datui-cli/src/man/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in datui_cli::man::render_command at line 574. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-cli/src/man/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/mod.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ba672fd8b398b814c28b515679d19bc216d93601de267f57118bbe39c852cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/text_input/mod.rs: crates/datui-lib/src/widgets/text_input/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in TextInput::apply_key at line 403. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/text_input/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/text_input/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"6739a0f6fb26a4e41a71ab4da74e3e124b1bbc784731fe2a1e4a89b337219753"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/app/startup.rs: crates/datui-lib/src/app/startup.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in datui_lib::app::startup::read at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/app/startup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/startup.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba9bd27f4795aa3c81874b89347213efc19f86284e04dd13194d0fc2140587c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/app/footer_state.rs: crates/datui-lib/src/app/footer_state.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in App::table_status at line 65. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/app/footer_state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/footer_state.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4256fc07856549f1404f40f9dcea6d5136c6932d8131573c27b326d1e11c07a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/bump_version.py: scripts/bump_version.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in bump_version.main at line 574. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- scripts/bump_version.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/bump_version.py"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe9259bdea010e81dc3dd73083bb7fdc0b6dd86c7aa5626a7216d7ad9db03f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/analysis/analysis_keys.rs: crates/datui-lib/src/analysis/analysis_keys.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in App::analysis_key at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/analysis/analysis_keys.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_keys.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3248b003cf34a205d168a8a4453e03f1591ccb93b1cdb23252c8633c2a154aef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/chart/chart_data.rs: crates/datui-lib/src/chart/chart_data.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in datui_lib::chart::chart_data::prepare_aggregate_xy at line 2578. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/chart/chart_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":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"11883c9c4a2efcc75a11372d620e939d7133490a6c1bf2568bd05a02b5dca490"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/home/search.rs: crates/datui-lib/src/home/search.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in datui_lib::home::search::walk_inner at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/home/search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/search.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9e44bfac44d273f38d5aeb4843de7761a5548435a8e7439d0d25545836b4a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/axes.rs: crates/datui-lib/src/widgets/axes.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in datui_lib::widgets::axes::log10_sets at line 429. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/axes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/axes.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5f89ce86b8a95fade162b238dbd979d5c37fa05ea59d223b31a7ce1efaac37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/render/footer.rs: crates/datui-lib/src/render/footer.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Footer::render_line at line 611. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/render/footer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/footer.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cde931cd98ebe4e146d9e26d6815250b45ed9e802f7174e640905ce9fb0d693"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/chart/chart_jobs.rs: crates/datui-lib/src/chart/chart_jobs.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ChartRequest::prepare at line 313. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/chart/chart_jobs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_jobs.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d109488e6e72c8eb71c47e347ef0ebf475a7599c517b4af5cdd22635013691"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/loading/open_scan.rs: crates/datui-lib/src/loading/open_scan.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in App::install_dataset at line 320. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/loading/open_scan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"d145df440b937cd26cd5cbdc929058faeb2791d135e83ee33d0cd2c655bb683b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/table.rs: crates/datui-lib/src/widgets/table.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in DataTable::render at line 1390. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/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":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedd2a73368525bd06045771a92cfa10669917f1250485bb12d40a1b14ce5cd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/app/run.rs: crates/datui-lib/src/app/run.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in datui_lib::app::run::run_impl at line 172. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/app/run.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/run.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4111c19d81f86f33649d3c90b7f94eba5d6ead0a95cd98eace47b95da88496d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/formats/framed_records.rs: crates/datui-lib/src/formats/framed_records.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in FramedRecords::build_index at line 1986. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/formats/framed_records.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37b4e75a12036401615029019cfb3606891f5a494a807cc4d2b70029234371c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/formats/model_files.rs: crates/datui-lib/src/formats/model_files.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in datui_lib::formats::model_files::read_gguf at line 680. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/formats/model_files.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/model_files.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"84262d47296b5364ca84e1588886ca5b2336dac237db4ba01eae0d05bec9eb1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/docs/doc_examples.py: scripts/docs/doc_examples.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in doc_examples.run_block at line 397. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- scripts/docs/doc_examples.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/docs/doc_examples.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f86e4f481bdf1eb2663736d31457f10e66d0911f5dfc3275749647325e0e013"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/app/keys/sort_filter_keys.rs: crates/datui-lib/src/app/keys/sort_filter_keys.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in App::sort_filter_key at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/app/keys/sort_filter_keys.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/sort_filter_keys.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"982bb45de64771c6960191b6f24d569ad572478ad521aa500e90ccd387d09a05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/documentation.rs: crates/datui-lib/src/widgets/documentation.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in datui_lib::widgets::documentation::layout at line 483. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/documentation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/documentation.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3d4c17da63d69d2040d77c0eaa2306fc62e7910db3671a042fdb60c038e358"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/formats/parse.rs: crates/datui-lib/src/formats/parse.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in Reader::delimited at line 440. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/formats/parse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8936d25b2f6ed04e8afbd77a7aa600b6fd4951e3f5d8b20525f466dd3c2e1a6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/sample_form.rs: crates/datui-lib/src/widgets/sample_form.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in datui_lib::widgets::sample_form::render at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/sample_form.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/sample_form.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"600b54f2200539c6a825659f53339eef685516a0371d72fe0de996f1be3431ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/view/view_keys.rs: crates/datui-lib/src/view/view_keys.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in App::view_key at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/view/view_keys.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/view_keys.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"542ae94ced05515b69332f60d58e27d0a7983d9d13d1c48edb9c1453f7802c89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/app/pointer.rs: crates/datui-lib/src/app/pointer.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in App::click at line 732. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/app/pointer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/pointer.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4423c8c5f81ef13156f75990d29938448c2bf2ca406132547ed20e2c80aa11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/packaging/build_package.py: scripts/packaging/build_package.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in build_package.main at line 201. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- scripts/packaging/build_package.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/packaging/build_package.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cc68c89d02fbf318a78f9a58aa9a622eb1cf75aa3dad9840addcd7a956b802"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/past_calendar.rs: crates/datui-lib/src/past_calendar.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in datui_lib::past_calendar::guard_expr at line 332. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/past_calendar.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/past_calendar.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60363da35e8e03eebd6cc10f7f61b21706676927f3408a619f1818aa312806d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/analysis/sample_modal.rs: crates/datui-lib/src/analysis/sample_modal.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SampleForm::adjust at line 334. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/analysis/sample_modal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/sample_modal.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee51fc301085eefe2fb55fa0faf346cbc60ef0f162af99b429189b6d009af59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/textarea/edit.rs: crates/datui-lib/src/widgets/textarea/edit.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TextArea::position_for at line 387. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/textarea/edit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/textarea/edit.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"757f9576268d155c9c86be3dcdc77dfb7a3c3dd1c21e198206c98e753ba30d9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/app/applied.rs: crates/datui-lib/src/app/applied.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in App::apply at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/app/applied.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/applied.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd2da3b94c4a9c9eb73ff9b48cd06453c2de22f829ad9e3a0b254af3eeab1d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/docs/lint_docs.py: scripts/docs/lint_docs.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in lint_docs.lint at line 102. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- scripts/docs/lint_docs.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/docs/lint_docs.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6deb7d8c86e7e64a87c583888fb74e28ad8c1ca04a0fffb317083c70b2cd31a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/docs/rebuild_index.py: scripts/docs/rebuild_index.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in rebuild_index.collect_versions at line 109. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- scripts/docs/rebuild_index.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/docs/rebuild_index.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e50b495776c7201a97ec0a4070ac3ff1ca862e7b2f674fd99f6aee7121a697"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/render/hex_view.rs: crates/datui-lib/src/render/hex_view.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in datui_lib::render::hex_view::inspector at line 338. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/render/hex_view.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/hex_view.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"3080ccd56815265cde8a5a445f4c1452457f1eccd7084df03c2aab4767a82215"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/quality_intent.rs: crates/datui-lib/src/widgets/quality_intent.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in datui_lib::widgets::quality_intent::render_form at line 152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/quality_intent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/quality_intent.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5629436ad9fb2cab4cee120ee2c4214336ff4e5db2facd66c8a490298974c2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/formats/readers/csv.rs: crates/datui-lib/src/formats/readers/csv.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in datui_lib::formats::readers::csv::from_csv_paths at line 1099. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/formats/readers/csv.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/readers/csv.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7293b0c8b910bbe566055a3aefb6d2658390967f6a4e848fda804f3939934a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/formats/dataset_files.rs: crates/datui-lib/src/formats/dataset_files.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in datui_lib::formats::dataset_files::open at line 132. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/formats/dataset_files.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataset_files.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79e9c007319816166b30ae7cf201ba6c465bbd0e4caf7c5ed3069a1d5075717"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/render/help.rs: crates/datui-lib/src/render/help.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in datui_lib::render::help::render_help at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/render/help.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/help.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33d608e84df904832219b43431f68930c7fff3569824d959bf18aac9a420b73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/widgets/column_paging.rs: crates/datui-lib/src/widgets/column_paging.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in datui_lib::widgets::column_paging::plan at line 135. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/widgets/column_paging.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/column_paging.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e8f27ea067b1d03066e50f1c238fd7d1ff10f1c3afeb54ac2cd0b9dd3b7006"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/datui-lib/src/formats/spec_union.rs: crates/datui-lib/src/formats/spec_union.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in datui_lib::formats::spec_union::line_up at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-13..2026-11-11, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-13 16:45:14 -05:00\u0027 --until=\u00272026-11-11 16:45:14 -05:00\u0027 --full-history --no-merges -- crates/datui-lib/src/formats/spec_union.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/spec_union.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b69a8c10bcc640f826fe52be8724998dd42463768f807b644b408bb5b51a87"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060datui-cli\u0060 is a binary crate (\u0060[[bin]]\u0060 in \u0060Cargo.toml\u0060) and neither \u0060crates/datui-cli/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0102cb61d24b017f840e57dd32764b2ed586a02913a27f8b5c9518ff64aee090"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060datui-lib\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/datui-lib/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcf67251a318ac67c28c0a3ff9d0db918af51c716ed28293527e6ffd911d6e7"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060Cargo.toml\u0060 makes this repository a deployable product (line 26)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/datui-lib\u0060 (257884 LoC, 1133 module-visible types across 26 directories) overshoots its size bounds. 1 of 6 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 6.7/10. 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":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd1f25c3343347027141a1457f0708cd217082a99e14362c8a048fb0a57650a"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4dfab6fae60570a338debca386fb39959b1aa14da984a440f62dadf43d6c225"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a474c847f6221a0fac8abd3a83e48ed48e2e93072db5d88b866caed6421d6657"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29e32f7c355fc7a3f85a41036c7ab526d37a2c9122453ba1f896948f50035e02"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a9a14a780384ad8450aa662ddcad918eb3936172a6f8dfbc7a07e297dec8ade"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e4364beeb822f9b42c6d901c27eb9ca6457322bae161e2d75d02fa55af84394"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9a2eccb400e9e195cb588fdd8399bf5e33889ce2ffce01293d5ad900701633f5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63c4a60773b72c34dfa3b33bc7f9b31d39e5e461cf64d4244b9c3ebfe30cb5dd"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a31792ec24f3ff57022222c1d4851e31c9c2f033a0e279e10e351f70810c45b"},"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":"baed9421952d7d5067012740c90331b1b2bbf7accb22bf430466f8a76fd2992b"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac23b7404f331bddd49fe23420ea126d7282177984d692a2afeecce0dc770057"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45831621e6d3ea2037c981d4adbf1dc2633da1c205b8d6d22899b1750b811d96"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fb23ad95240b0f5fd30b626d971dcf126fc91ed63511d89fc8c9ff286396b7a"},"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":"21ec244fc51ee5a8eafc4885597d1bb9e2671c35c9c8176df0d89209d17d4aae"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fb343a1f8beed7159ac6735c8128020cae06a2b845d8bd093425b65a9b72cab0"},"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":"882641cce184e647c41a5d703d0d1a79ee7d40d10bbda0b7323fb35ebf97a09a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2966e931c8299b4948f564665be64e1afaa5ca5ed0a2028e59f8ebb91e247322"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32c61799ea12afd28b6135da666ec933b4279f8feffe94ac81501e920b038c11"},"properties":{"dependency":{"package":"arrow-data","version":"59.3.0","advisory":"RUSTSEC-2026-0442","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"59.3.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09aadcc6f21d12b1dc09249844a2aae646dbfe24d2ce9815fa31408b55cf97c8"},"properties":{"dependency":{"package":"chrono","version":"0.4.45","advisory":"RUSTSEC-2026-0543","severity":"medium","relation":"direct","declaredRange":"0.4","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f938cc11f85764fce30b1f82bc362efb62f4166d0359677f658198be78daac0e"},"properties":{"dependency":{"package":"chrono-tz","version":"0.10.4","advisory":"RUSTSEC-2026-0555","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e106c4a37c534c9e32845aef2971e66e913ae5bf8b36d4d5379f89664bfac34"},"properties":{"dependency":{"package":"humantime","version":"2.4.0","advisory":"RUSTSEC-2026-0542","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.17","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0340","RUSTSEC-2026-0343","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"severity":"medium","fixedVersion":"0.11.18","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.5.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0395","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0396","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0397","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0399","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0400","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0401","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0402","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0404","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0405","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0406","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e688554a3eea7b5d5f6e6bd04e0f08162d62b45836b11a22dbcf52172ba9f83"},"properties":{"dependency":{"package":"arrow-data","version":"59.3.0","advisory":"RUSTSEC-2026-0442","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"59.3.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39b5348c1d0bb0ddf34eb20fc240bcbf1d50e16d1d76d16a3873090f1791adbd"},"properties":{"dependency":{"package":"chrono","version":"0.4.45","advisory":"RUSTSEC-2026-0543","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c479d13e4e4b1c2f7b02f6924aaf335889f64b22f83fddac546c4dfedf29713e"},"properties":{"dependency":{"package":"chrono-tz","version":"0.10.4","advisory":"RUSTSEC-2026-0555","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba4cfb5f2fdd12b3ebb96f634e02afabb05230b9ecc479d2ea4e66c6afedfc7e"},"properties":{"dependency":{"package":"humantime","version":"2.4.0","advisory":"RUSTSEC-2026-0542","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6fd6a864780c4368aa3b399adb59ba734b9229df52be28bf8772952ab7af070e"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.17","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0340","RUSTSEC-2026-0343","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"severity":"medium","fixedVersion":"0.11.18","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d16385bc1dbf187e38abf6f4c30c3b66e9bfc2d487b2ff6bd2de285fa9de0d31"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.5.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad267069246ecbf406e21b9da8ccbcb1786ad34790a4ad9dc8d6972689212a1d"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1ca2888c6b8bffd6589dd960d88db444cc690259ae55d456ef78c1c04b71b60"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0395","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d76fe32222c344e69a23bd8ad2c6876b933b3335026eef2f17636360d016cfe"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0396","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"232a53a4244b25dd7eff311532c81ea96b8ec621d45d51f4c8939eaa750a707d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0397","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39982074535a4bc57d64e2723c9375588076ab4c5a91b70d7c24cdf145c36968"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0399","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"601a01c5ed4c97a32bc727e4ac88982bc12f39b89ca572dfae8d9bc7edf0ce17"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0400","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2976bc5572df2b7c46a8c45c11c1a312a587795f44001ed2a76f85a7e8d118d3"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0401","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"661dc667c621e3ebdb61ac1f67acc1c49374e0efc49f122623da8122dcb4d7c4"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0402","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0205eae6bb75cb64c18f3619ed8c19f431440f016215f413ee0d5fa9f8c55fa"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0404","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3d81b5ffe66b22344f14d58b29ab3ff9dffc9963e88830826ea9dfea0e6702b"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0405","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df3d2131cf4f9bbc88c03512c0011522735f56627b58e0d1e6b3aae2b228eb9b"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0406","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","severity":"info","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.39.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"severity":"info","fixedVersion":"0.41.0","relation":"separate-copy","declaredRange":"0.42","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","severity":"info","fixedVersion":"0.13.4","relation":"separate-copy","declaredRange":"0.14","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"severity":"info","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b05343e0e4d1cec914c85fe60db7abeeb64d77234690f0d5309730cf003e5b33"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","severity":"info","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"287a6dae16f23a0d72d7644506bff4b5333ea6a88f9858ac95ce1d9f5ad6373c"},"properties":{"dependency":{"package":"quick-xml","version":"0.39.4","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"severity":"info","fixedVersion":"0.41.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aaa6c2ee6847dce380dc26f7f67f970f2b5f2ca9fa6a66793d85016bf6e38926"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","severity":"info","fixedVersion":"0.13.4","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c214d8e98c4a8767d025fd3a3df4d63b8e62054f28d812b2d400f66c93b494a"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"severity":"info","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 __init__.py: \u0060crates/datui-lib/src/lib.rs\u0060 (context crates) and \u0060python/datui/__init__.py\u0060 (context python) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00603c037954\u0060 CSV dialect: --comment-char, --header-rows, --skip-initial-space (#59\u2026; \u0060e5dcccab\u0060 Python: view(capture=True) brings the viewed frame back (#308) (#342); \u006080d7618e\u0060 Upgrade Polars to 0.55 (#164) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff5fa2ffffb4668de5e62cedc55a628a3dbb4a08c2e36adac7e03e42f99d8af"}},{"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":"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":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","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":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run.run_impl calls \u0060recv_timeout\u0060: \u0060run.run_impl\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060recv_timeout\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/run.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ec632aed8054d4e3454c5e226aaa690c50b3d3c97f14c51dde9565d7c94e08"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Environment.current calls \u0060std::fs::read_to_string\u0060: \u0060Environment.current\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_browse.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e593b2b9c057679ebfff2e9e8b8ed167bff48fc2d9806f708f3ffb035f67f661"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Environment.current calls \u0060std::fs::read_dir\u0060: \u0060Environment.current\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_browse.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a246aa2190a77afaee55a5831b3ec79bc4ec80c4684728696374d114f9d8e737"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cloud_command.run calls \u0060thread::sleep\u0060: \u0060cloud_command.run\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060thread::sleep\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_command.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"5233de8e167b4faa6cabc40ff3b07e5a9a4de852897ce216c6dd56487c970aa0"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: source.expands_as_glob calls \u0060std::fs::symlink_metadata\u0060: \u0060source.expands_as_glob\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::symlink_metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/source.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6cc80e6ac0bed5cf7f9ed5237f6cf99de505dde1762f38bd51cf6c16920ebd"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ConfigLayer.read calls \u0060std::fs::read_to_string\u0060: \u0060ConfigLayer.read\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"74296509e39a8f952e290eec783d7b857e705f0fb3b7d34f7088fb90e5c28fb2"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: readers.head_of calls \u0060File::open\u0060: \u0060readers.head_of\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/readers/mod.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f982ee6a010da195889908daed3d29cf0b7bd3c5879c1d8c650e387ed5ec6e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: local_glob.walk calls \u0060std::fs::read_dir\u0060: \u0060local_glob.walk\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/local_glob.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3ea62c1fbae372f0ff340939c2e492d84ce5718779bac77c91652aa6ddf626"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: src.run_cli calls \u0060File::open\u0060: \u0060src.run_cli\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-pyo3/src/lib.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87ba1081f6b3c710c2460261008e9d67b0d887afad6b3a4bcadf2222185e804"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060use_copy\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"03007bc597b234cf8a7f188949308aab6e708d1a94ea112427a3da1a43ee0d5a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060no_variant\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"05905f44f7e36bef7ab0a191fd325318a2245812e53f9f83f36ea82518e05244"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060send\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/background.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"4092f398729938d4eb02a26dc468677615749f708a846c9a628ac074e63d0ab8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060send\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/jobs.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"8407979ad8183bc80bfa33bfcdd78c42160550b26382787da35f2052eaa4b63e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060bracket_pastes\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/terminal.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"38065c65b680a5d54e7f87ce1fe02b90a92f06f6e524478c52d0e59b89171eb2"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060follow_focus\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/terminal.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b03370811e61a60927d801c73ee7d2b8d3c5ef3d6ac3b5e57efe0f52fee4934"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060detail\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/sqlite.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0624141ef48ba1f5430e79e753010e933ffcfa714218da5962729d8e88cfb2e9"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060schema_preview\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/sqlite.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ec1e1421fd7d96d9a9c9a1e308af3e8e25f95bee792e4a2ec2a46a889a2e7e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060copy_on\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"f558528ad2d22350d2b95e1bf1195fa3da4d7b93c22b959f4c80f8b560a2daf7"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/4 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060crates/datui-cli\u0060, \u0060python\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P6","level":"note","message":{"text":"Changelog looks stale/thin: The changelog this check read carries 2 versioned entries, against a bar of 3. Counted as either the distinct \u0060x.y.z\u0060 versions it names (a link\u0027s target is not counted) or its version-shaped section headings (\u0060## [1.2.0]\u0060, \u0060## V14.x.x\u0060, \u0060## Updates in 8.0.x\u0060), whichever is the larger \u2014 so a log sectioned by minor series counts its sections, not its individual patch numbers. Entries recorded somewhere this check does not read \u2014 release notes generated at tag time from a generator config it did not recognise, or a log kept outside the repository \u2014 are not counted here, and this row is about what is re-findable in the tree rather than about how often you release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9a74c249fe67853238d9c15085f7f97d31f51bb82455046aa10c2cef82f67b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!ctrl \u0026\u0026 !mods.contains(KeyModifiers::ALT)\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/inspector/inspector_modal.rs, crates/datui-lib/src/widgets/ui/picker.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_modal.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9230b6d997164f5697a6509ec509338b0a278be63b18693b3fb3aab7abba4eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!row.contains(\u0027\u256D\u0027) \u0026\u0026 !row.contains(\u0027\u2570\u0027)\u0060 appears character-identically in 5 files \u2014 crates/datui-lib/src/render/view_sidebar/tests.rs, crates/datui-lib/src/widgets/chart/tests.rs, crates/datui-lib/src/widgets/chart_export_modal.rs, crates/datui-lib/src/widgets/pivot_melt/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/view_sidebar/tests.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6454b4112bd0bf6d3ff9a2c007509fc689307688ad7acaceefffb7007dda664c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060content.height == 0 || content.width \u003C 4\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/widgets/info.rs, crates/datui-lib/src/widgets/ui/form_view.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/info.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"790f496339d1d09472042408f3882861b1247519763827d445402f697c8b6365"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.counts.is_empty() || data.max_count \u003C= 0.0\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/chart/chart_plot.rs, crates/datui-lib/src/widgets/chart.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_plot.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda8802c5e83ff8bbe54962fb2fecb9f97b3fed3691ad34266483b500b4bb421"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected.weekdays \u0026\u0026 crate::analysis::data_quality::ExpectedWindows::weekdays_apply(every)\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/analysis/analysis_modal.rs, crates/datui-lib/src/analysis/quality_trends.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/analysis_modal.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"912af5dfebf5d7fbf0d3a113a47ccb3247292a3e332bdec2a58ebdf2c2eb8d25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003E 0 \u0026\u0026 (digits.len() - i).is_multiple_of(3)\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/app/modals/copy_modal.rs, crates/datui-lib/src/home/discover.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/modals/copy_modal.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5cf591f45e90f9fdb8fc2ed800c0a980b526c9e8ed3ab5808fa68df53a9cd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060relative_path_match \u0026\u0026 exact_schema_match\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/view/mod.rs, crates/datui-lib/src/view/view_apply.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/mod.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"857e944ee3d86c9c1f254e8adb42bef375b9869cc6c49049600f8d71040cf001"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.rows \u003C BATCH_ROWS \u0026\u0026 self.held \u003C BATCH_TEXT\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/formats/fix/mod.rs, crates/datui-lib/src/formats/sdf.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fix/mod.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"86655362579c4fee5bcde414e0544b8d69f60fb48f2d9ef0f849847a54654c9f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.view.grouped.is_none() \u0026\u0026 self.view.reshaped_lf.is_none()\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/table/copy.rs, crates/datui-lib/src/table/query.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/copy.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c39b855d1bee0a4bf2cd140a366f335b9c4da025fce58f4511177d5be49583"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.view.grouped.is_some() || self.view.reshaped_lf.is_some()\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/table/copy.rs, crates/datui-lib/src/table/query.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/copy.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"92304d00c483a5c2ab6a85e03b535dc237d220acf7a302a4b3f4d1f0baee69c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060settings.endpoint.is_some() || settings.virtual_hosted.is_some()\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/cloud/cloud_browse.rs, crates/datui-lib/src/loading/open_scan.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/cloud_browse.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"9444c75b40f44f96c9682e1f5054f3c173eddda083ada5a4f87c09564178bcba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060slots.contains(c) || \u0022\u256D\u256E\u2570\u256F\u2502\u2500\u0022.contains(c)\u0060 appears character-identically in 2 files \u2014 crates/datui-lib/src/widgets/data_quality/tests.rs, crates/datui-lib/src/widgets/quality_intent/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality/tests.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c278503199793eb195312afd02e27032ac877d25dcd7be04feed8930ebdd668"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060select_next\u0060 is public and takes a \u0060DataTableState\u0060 as its receiver from its caller, and it calls itself at line 9 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060select_next\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/columns.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2372810bc63efeb67701805d639d92a1b6ba1818aa7572cd14bc4642fe31a274"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060select_previous\u0060 is public and takes a \u0060DataTableState\u0060 as its receiver from its caller, and it calls itself at line 30 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060select_previous\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/columns.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7164e7c5c5bb82efdd0f63ec06c212986d86f1096b3535e1497dfda9fd34db99"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060indexing\u0060 is public and takes a \u0060DataTableState\u0060 as its receiver from its caller, and it calls itself at line 489 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060indexing\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/facts.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"074f43ef898921578e698fb3d21b8e6e26df52310a54f90999c97a241793a8fc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060notes\u0060 is public and takes a \u0060DataTableState\u0060 as its receiver from its caller, and it calls itself at line 797 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060notes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/facts.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ab8c0e145009f127dc9019b548d20a1836bc86d2acbc6973ab32efe6696cb6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060unit_of\u0060 is public and takes a \u0060DataTableState\u0060 as its receiver from its caller, and it calls itself at line 965 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060unit_of\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/facts.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2a6614d23f15505896b4d373fd02c2c3c9f0539573b438089d2287fca7dd7a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060apply_transformations\u0060 is public and takes a \u0060DataTableState\u0060 as its receiver from its caller, and it recurses at line 945 through \u0060reverse\u0060, \u0060build_view\u0060, \u0060filter\u0060 and back with a piece of the document (and at line 968, line 991, line 1032, line 1076) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060apply_transformations\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/query.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"12908d419b39a9eb293269517d2d3d4b34e0b5048887fe726627bc55bb670ab9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_expr\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 745 with a piece of the document (and at line 773, line 774, line 775, line 776, line 777, line 778, line 779) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060to_expr\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f671bfabcd5bcebbe4e73bab84b6fc03e2eaa734823640ac1d81e54d104a16"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_predicate\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 788 with a piece of the document (and at line 789) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060to_predicate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"997eb35fab070ce8492ea4debe551388bb673984d4c368e56c407bf1158867a5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060python\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it recurses at line 1033 through \u0060python_operand\u0060 and back with a piece of the document (and at line 1037, line 1038, line 1041, line 1044, line 1045, line 1053, line 1055, line 1058, line 1061, line 1065, line 1066, line 1067, line 1069, line 1076, line 1087, line 1088, line 1089) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060python\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef66f718727fb28a1b7fcd1c2b5b799b1f9abf99471818f4a1aed6757d896b8c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060without_aliases\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 813 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060without_aliases\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"05387c2877ac55bce1c4eff788966c93f6d6c4fcba0ebf7d77030bc11acd38b0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060resolve_time_zones\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 828 with a piece of the document (and at line 829, line 833, line 834, line 837, line 838, line 839, line 842) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060resolve_time_zones\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db898d51438005dfc34c73e09af35041cfdee06b6327e968f2cf1b7939dbdf8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060resolve_types\u0060 is public, takes a document from its caller (line 940) and hands it to \u0060is_boolean\u0060, which calls itself at line 926 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_boolean\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f757b3565aafc38945d690a4108705d525be55a588bedc667e406b4056f436"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060resolve_types\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it calls itself at line 943 with a piece of the document (and at line 944, line 947, line 948, line 949, line 951) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060resolve_types\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"5123e4ca4c9ebdb2b6b7e8a983b769ab4beeab9c7acc4ca285d6cceef3d35cdd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060build_local_lazyframe\u0060 is public and takes \u0060options: \u0026OpenOptions\u0060 from its caller, and it recurses at line 3118 through \u0060read_directory_files\u0060, \u0060dataset_dict_split\u0060, \u0060read_with_delimited_spec\u0060, \u0060read_spec_matches\u0060 and back with a piece of the document (and at line 2701, line 2966, line 2976, line 3001, line 3075, line 3140, line 3180, line 3214, line 3228) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060build_local_lazyframe\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":3118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d148b853bfd24707909f3865a75618cc5421f0b31abb46fc4a458360e53a7378"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060shape\u0060 is public and takes a \u0060Node\u0060 as its receiver from its caller, and it recurses at line 87 through \u0060len\u0060, \u0060is_null\u0060 and back with a piece of the document (and at line 81, line 125, line 126, line 127, line 129, line 130) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060shape\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_drill.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2908635dbb3f874bec3bf52b703b4b58383d11e0cad3caf51d01f50f42a804c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060write\u0060 is public and takes a \u0060Encoder\u0060 as its receiver from its caller, and it calls itself at line 325 with a piece of the document (and at line 326, line 327, line 328) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060write\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/mod.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"07343db741795bda080962f3b49521ebac46a7c1a0fdf329cb1375e4ba4d1217"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060flush\u0060 is public and takes a \u0060Encoder\u0060 as its receiver from its caller, and it calls itself at line 334 with a piece of the document (and at line 335, line 336, line 337) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060flush\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/mod.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6e6370495630c2056195e0b072ae34f3a29371a114ccfad1bfd6c09a5ba208"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060shows\u0060 is public and takes a \u0060Overlay\u0060 as its receiver from its caller, and it calls itself at line 72 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060shows\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/overlay.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa178a4f6f67418728305102672a10afae249489a23ce7da33b8dce20bbd77b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060build_report\u0060 is public and takes \u0060results: \u0026DataQualityResults\u0060 from its caller, and it recurses at line 932 through \u0060get\u0060 and back with a piece of the document (and at line 853) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060build_report\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/quality_report.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"091b5b1cba24f7bff5cb6abc2a1cf71ea5d6c9636b2a39a8915c307aec2a4be1"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060std::mem::forget(terminal)\u0060 (line 133) takes \u0060terminal\u0060 out of Rust\u0027s ownership: its \u0060Drop\u0060 never runs, so whatever it holds \u2014 a descriptor, a socket, a buffer, a lock \u2014 is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with \u0060into_raw\u0060/\u0060into_raw_fd\u0060 and reclaim it with the matching \u0060from_raw\u0060 when the owner is done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/terminal.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6605f370f5418ff426f2c0792cf06a1450133d439ae5c467a2f9e8dce5a528"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DatasetShape.taken_at\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cache.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4f36dda0c98600229c8117c0d0a1f046d7c8d926bae16b9022b9c48c74385f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chip_key\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"632e699711afed7b80e5e626fdd30b864f7cd5129175ceff0088d9a58b1e8edb"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chip_label\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"355b922fc8c15bd10e5e7ffd24cce493fee458c01b646e6d9c282e33f45c566c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.surface\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05c59abaac41592e1e88d338d4710848c59537b5cabeba1f669798ac179d5f0"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.table_row_numbers\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1569}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeace21d014533a4ecadc342c5a00096ee53b9d2e73d9e92b5b5eb140cfef4c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.table_column_separator\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55917d9e4700f327f71dde24b3bc16f6779b849de3710cdb734fc1d8765f662"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.table_column_cursor\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6f81457e6da1c2defa1af54ef32583e4b32477c85d2fb1c4eb2652bc9c1bda"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.table_cell_cursor\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"09da49ad118170422625ef73c8458aebb811f4f55291e951ea7b36d001d4d97a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.table_alternate_row\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"7904947843a010ba99d450d3b6e47db625e921d6fe1813b28c68d71cf3b86d01"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.sidebar_border\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ac394356c1fff7a39a9a4e728c2fb11cf6fe039889f54d9c1f62c1cb417e48"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.distribution_normal\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"249ed9f9e02e9d46253df52e8a6b540321757e48e632296c09b5abdae151db62"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.distribution_skewed\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1d63ce1eb3f99a3e0b56906f25d2951b12c6efdaf0cef811900297ab83c69b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.distribution_other\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbba6172e3faf0cfc6a097c27385e0d473ebb9c04118f3e09c3b901512a47b35"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.outlier_marker\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceddd46dc5b055b1297d5e79ccfd75b0127d10d106548601b779daa9a707c4d9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.input_cursor\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"8953f11f5892f3559e32b34456559db7bd308f3721e504d8f56433a09eec870d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.input_cursor_text\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"e14a0f0f179ff6d2b82962b5bed8ab041ed788c08e004f888499584a87014324"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.type_str\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bca067476c1a23ebc75306e363761756e80682a4820c30dddba34baf90d618d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.type_int\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"5956aeb57e6c5e03f4f08091f87f2f6d2d427d410415c225f17fa77fc9ebf737"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.type_float\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"075adb7fdb19d4777ebc20b6a999000eff4c7d0287e259bf240aaba64658daae"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.type_bool\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf5f9e66671294a5e77f4d4ec406e190903e9145bc453b6b6b02c1dbd7a6a12"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.type_temporal\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"565ddd70438438c8b35de0b6b0911c35baab4e810075caff9b55ebcd2ea4b321"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.type_binary\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1597}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a2a00e899c5b59c16d1728988aa18a1463fd1302ab6a465778d659c171bcd6"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chart_1\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"775d88770d2b3199218cbcd4b107f93363bde58cf43b094fd9539cce55be6fa4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chart_2\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a93249b840e47de5e67b71e88f575260ae23074248455f3ed585f01fcbc8902"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chart_3\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1601}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41476f2fc77dd7e25ad0112867db3d47845e03d36a10dca65f67d72eff6c113"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chart_4\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedc7e3146327ce0ba2f92f574268a066dfa49c75ab6275014cad86192487850"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chart_5\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf42654419167655a18305146124b44b5f6afad9447b6a72e2a3a3014480488"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chart_6\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69426cd6c1cf1b558f5197f22d3a75ce0ceffe64dc5d99fab419bb116cfa0b3"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chart_7\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90e2611fce7ca5a6971c3ad0f384f9e656c9f5abdd28e2f3073e102a9fc0120"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chart_8\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"e597cbf113ff32dc001a19134a14b359fc01ee4c3deedaf7e3f28f60bd87daeb"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chart_9\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"008bed2a92d09f642b1ef2c9c70a43c74c34227a876cee5069126e7bcc5b2973"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ColorConfig.chart_10\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a006810e8dcc2fe4fb924ddca5b82810fe4f7872e8610e8bbcb49e614dc626"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DataTableState.source_hold\u0060 is offered as a builder setter option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/mod.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e8652c34cd0baf9ea030241648bf34395c5fcdaa4313dad7924677fb8c99f5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MatchCriteria.schema_types\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6c9aad8c715057c4e421c15533770ca6f647d7e3f14e3c1adaf2febb72f0cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060names.split_first()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_dataset\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/notes.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dccc45fa4e4b757413f872b4cc63e814964f61976edef1a6c6a347cfb61192a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NaiveDate::from_ymd_opt(1970,1,1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060epoch_date\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/typed_value.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f8450135348aa56df4fd48e6f4223841dc2139bb70f2522cd99285a741c668"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.by_name.get_mut(name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060entry_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/column_widths.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"922987347eeea11c7119d20bab745e6536140e5f6ba6529633b55d2bb847087e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lines.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060pack_facts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ddc6894f7ccfa122bbb848ef80726bf7f63a94dbc936a24a1c8c8767b66502"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lines.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060pack_facts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/data_quality.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"af66e1e296c0d1e5ab6fb931f8e438cc5e52ff133b5bc5466116aab9e5af5fb5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col_data.get(row_index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060format_cell\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/table.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2198f5aed60b1b2c79eacc140890c9384a318890bc3a195a2c4819e7ad27d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.screen\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/ui/hintbar.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef5302ec6d5c03cf8ee92ddf2caa3e2f33063476403b3468ac945a0c72b4190"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.screen\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060key_as\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/ui/hintbar.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1112cd0025f00ac74cdb721065d8b9ac9cf55eeb06237546894255a28f69595"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ready.get_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060deref_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/mod.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7a02c8dadc6dab5f2e1d412b714cf2ed34e245a6f888d2aee7bc0075ec74c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(2..).map(|n|format!(\u0022{base} {n}\u0022)).find(|name|!self.view_exists(name))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060suggest_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/view/mod.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6648819eccd62767eac2d6a0d6b7732456239bb2dcec0395d0bead5a9b35e4b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::iter::once(Self::SOURCE_FILE_COLUMN.to_string()).chain((1..).map(|n|format!(\u0022{}_{n}\u0022,Self::SOURCE_FILE_COLUMN))).find(|candidate|!taken.contains(candidate.as_str()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060free_name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/copy.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4371b708bb94b88b2c3df7fbc5863ea083fab39001c9f94511b91472c2ac3567"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060string_cols.iter().map(|c|col(c.as_str()).str().contains(lit(pattern.as_str()),false)).reduce(|a,b|a.or(b))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fuzzy_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/query.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a44b3c94bbf0fe4184c44a295b36a037693a7d3730590486801f1ce55b8dba3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060token_exprs.into_iter().reduce(|a,b|a.and(b))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fuzzy_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/query.rs"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c941d8de7b3d110aefdc6482c99fa61e6bf52af00da4a3ded44d81a59bd76e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rows.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060chip_fact_lines\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/home_view.rs"},"region":{"startLine":2224}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b2218a0e2e12b09b1a92861680369a4e9e0000f0b90f45d611c6859b5edce9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060filter.editor.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060render_filters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/render/sort_filter_sidebar.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"8549fe5cf3e2d8612cef0b8ecb1575950f528cdda96e4244dee59c4cbf3ddcba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060result\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060min_max\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/mod.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2bfa4e015d7a474562a092c013ac7029f0fb39fdc9ecddadf226d3b6dc1e87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::num::NonZeroUsize::new(100)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060scan_lines\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bb08645c3e62fa9bb8c784d64b82b7c8c382de82d84ccb5b2bd1591b3e5acc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.load.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea282ccb6f686f4fee1116cdc86311e700cb9cb3a313ab6134bba74c13197112"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.load.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060install_prepared\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"842ea9581b2be6f57029f789550c27f4732dea9ee839661a0739012652a5d3b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.load.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060first_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"01cbf0bf4e049e36a06df546c1a411242d478a1e7f72e9f1ce7f39d49c193a31"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.load.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060first_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f4ead84e38fb72a955031f02c2e3ec486035daca9ad884541323501b29942c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.load.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060first_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e80627fe92482da4a17cd4cde1db7b4d69c6f53da04badd6ac35428f5c9d75d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.load.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060first_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c7cb9e6eee9504b2f5fae6f0518bba65a61d95f2d646275fc9c6a1c7fbecc5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.load.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060first_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd70445f4571b741f230caa7db397510c04cc1077d5a087bd7400994efa3b38f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.load.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060first_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c670e7040606cc0d82ec912748f8fba51d65585598928e24c68fa82eacbe3e87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.load.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read_download\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b02852e3ce491575fefb2f1ba0d3589caafa87b20d5229f003ebb179d9c9be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.load.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060answered\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/mod.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5ad714536a907afc951b861e10786b69f611ab9423786b9187c41396aecd6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_load_step\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"101d0c89537dacf190ec43b39398bfefd1db06b517273245a1d36488e3bd7bd7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.start(\u0026df.schema().to_arrow(CompatLevel::newest()),None)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stream_messages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow/stream.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5f2a416f9b4ad8f8bab045f4f15c1b2981fa3ddc5052f169b0fa690d112fb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writer.write(\u0026batch,None)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stream_messages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/follow/stream.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"143578738aaa737ffabf712a406cb830820f262bf26972d019d67bee5b255415"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.levels.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060level\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_drill.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"113497e5ab965ae34166ec6a1dc82a6a11e4e3cc71db6eda54824e65a18aec7d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.levels.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060level_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/inspector/inspector_drill.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca13860b5633b3379c3c8c675b56a509c5c81347a83dce747c800a3b38a8b1b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(2..).map(|n|format!(\u0022{base}-{n}\u0022)).find(|id|!taken.contains(\u0026id.as_str()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060id_for\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/catalog.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff1b38772edaf38e0b181f29e13f755d9b831f1fa59218d59d507a71c80b1b5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060view\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":4511}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5664a2147f1ca591d6f3ef99648fafcf649e2331199830aedb06c3003e4671"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sections[*section].door.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":4534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3cb7a1c2292eabe3d2bdfc26d7e1e89317fac0dfcf37272d5c8c0ddc08e1a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060specs.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060route\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/command.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccd0cca0d901f31b701646d8619389f8c5f1284665563e91a8742f5d1b56c98"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.names().into_iter().find(|(n,_)|n==name).map(|(_,id)|id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataflash.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de21b612dd326a0fe96a9525338bd1e084cd5f96174e0fc59689c67bafa27a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Listed::new(source,files,SkippedFiles::default(),fingerprint,meter,remembered,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060counter_for\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/dataset_files.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9ab121f43ce901d69d0c4a0a786b600c857cbaa2fe3ee9b1065e8f96025a2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NaiveTime::from_hms_opt(0,0,0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060excel_parsed_cells_all_midnight\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/excel.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27912352137a3548f78b486dbf104982bd6feebb01aed09bf04b91b660943fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060d.and_hms_opt(0,0,0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parse_naive_datetime_str\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/excel.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"5292ffdbfe3e7a8913af13edbc67bf625ace1adf997e458cfe7ea0e4c02bd648"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NaiveDate::from_ymd_opt(1970,1,1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060excel_column_to_series\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/excel.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0a47926c54849ce0cf537059d24c483812c8f6cadbd861673dbfec4c5d63b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chrono::NaiveDate::from_ymd_opt(1970,1,1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/files.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5d8c9d830a4453bb0ac1653e6f3a1341f22543d732c9c7c1b12197c3c892dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060spec.files.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060open\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/files.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9e9edd951fdaddfc1fe721d0b153d2740377a1795b75d41f09d8510f18cc5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060at(i).try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060decode_values\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/fixed_records.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"70062b11d292b4ef698b8b427d0777e04870dbe285a390334d1839a487c0f8b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.size.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060field\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"0324cdc9b9ed6f7cd82a3033c9b1c88a9001a30bbb70a624ba1489bd81fa62cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060records.fields.iter().find(|f|f.name.as_deref()==Some(name.as_str()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060open\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e026f485c181b34eba9e57122bd2ee5b7ed24cd35d968ea9c0085e12eead7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060scope.slot(name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060open\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/framed_records.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"567e700a0a7a4e1d6cb4ce87edaec77f7df759652b79ce2d6d2ce3cdf2d4fe17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.out.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060batches\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/ipc_stream.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d0b61cc77dcd6023453004a4ed63b43c909094e8a96de296b19878dfc7bcf6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FrozenCategories::new(LEVELS)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060level\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/journal.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"405e65cd83a4a20224d2bf91303537453f681d4802eb766b628ff908141bacaa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.schema.get_at_index(column)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060column\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/lines.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ce787cc22a3785867ed1bd914e6645223ac7325cff38caffe63022dff6a31d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060segments.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2d69c51401bdd149eafc6adc5e709fe754472f2e5c042457e11d23b29d0f64"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060segments.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/midi.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"1502374852480bd9abc54efe9fbafdcac7f250cc5a82db234d1071e0a7a1d724"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060head[..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060looks_like_safetensors\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/model_files.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dc9fb56a668d8d5cec7e041d758588e413eb4f092cc0f962458427e6c8286f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060items.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060value\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/numpy.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"561188bf57981d7746eef45154c00c456896e67905f39e93aa8fecb308c51865"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060head.get(8..10).ok_or(\u0022the header is cut short\u0022)?.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060header_len\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/numpy.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd5bc34b98f2d8dde75aca082664c15146e5ab4e32a4b47dbf1b738597ea6cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060head.get(8..12).ok_or(\u0022the header is cut short\u0022)?.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060header_len\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/numpy.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73093fff72be685088793b9b6923d403ac0570e2f4abdfe4d4d017f30359e58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060members.iter().find(|m|m.name==picked.name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060scan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/numpy.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70359099272a62ad90fb2fe6b148667718d21161e906a6c9d23a0414953e71c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.file.clone().or_else(||field.name.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060open_columns\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/open.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8e5926c08f70e9d47b142e7e8ac27aee3561ae32efd037746f011b3c8b6570"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.at.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060open_columns_file\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/open.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b82017c44b54c46356d73bef9c7149b6dbb1310b07657c6a1060137a037a05"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target.name.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060amount\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f3e50c096aad0f5920757bc3c30d34da2e6f4dbba96aa5b9a30063dfa11245"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060keys.remove(\u0022offset\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060field\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"d748505f8d14fb3dcb6a1f6a86086a9f46cbade6b8576b1ef5067d0fe4b08e99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.iter().find(|f|f.name.as_deref()==Some(type_name.as_str()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060records\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b27d9584dbc41b1dacfc17db636a2dafbd2f9d1b8414682b3f5d38ae61213a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.iter().chain(variants.iter().flat_map(|v|\u0026v.fields)).find(|f|f.name.as_deref()==Some(field.as_str()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060records\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/parse.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"18007e902a4b6c3e23b3e5b30cef2b3b56f9bd2b156e69ba02f139e852b0336e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.open.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/segments.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab109f73779e935ef670e30c7a8587abb7e18592d3a0b3b912cf8a2f59b9373"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060frames.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060finish\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/segments.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25fed7d8c9837ed1d03a32a7edf4ecb5f47b8937f70857a860464700d8676c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060subs.remove(\u0026id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060index\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/ulog.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e92a77473c85a1acede2b740bea6737994b330de8c3426c687a4e09db71960b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stack.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060end\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/gps/gpx.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d28262b70695dce7348a5e7b76233ef543ae7c0f844f8ed519611a312d216b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(2..).map(|n|format!(\u0022{base}_{n}\u0022)).find(|candidate|!taken.contains(candidate))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060avro_names\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/avro_types.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d078b5bca7c5abaf7d841a4f8dc5e022fb41cc8454920906c801fa8037e58aa8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serializer.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/export/avro_types.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baaae628be9dc38beafee0f5cc07dff39640d73931946a281cce6487ae94059"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.as_table_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_overrides\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/config/mod.rs"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad35b20915dd07eb9f18f7b38a982af6d4b77987d59c304203155af220ce2f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tokio::runtime::Builder::new_multi_thread().worker_threads(1).enable_all().build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060runtime\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/download.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4db9470984e5a7ec1190be741a2001c6672ea266b556283cbf931c7249a2084"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_dir(dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060files_in\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/download.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"476cdca2f1d4fdbe928ac17f9aa0a2ff5c822c641a49346cdd5ac3ff22dd4bc1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_dir(dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060files_in\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/download.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"76789ae44edf1e82c22acd7d4f55dae8db2d781ec85dd5df2ed2e58ce9e6a095"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::net::TcpListener::bind(\u0022127.0.0.1:0\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scripted\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/remote_model.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c54bf4f5e8054a6c4d2aaccbfa2ca65de2f7f270562e5bffc744fde3f294ba8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060listener.local_addr()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scripted\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/remote_model.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ea268042b74a6bf1db8c07ce2b39c9bc58cb5483cd7f6e5f8a0d9a555d03cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stream.try_clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060scripted\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/remote_model.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ea2ef9053a85e893b856fc008e4caeb90aecc4f5e3505143f8da71b225d573"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060request.lines().find_map(|l|{l.strip_prefix(\u0022range: bytes=\u0022).or(l.strip_prefix(\u0022Range: bytes=\u0022))})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060partial\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/remote_model.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"be298cab0fffff51b288dac805cba5c54dacac3e0e599bc74ff6f745a4163046"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060range.trim().split_once(\u0027-\u0027)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060partial\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/remote_model.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64adbce9ea07d52b39f41560a0fe8e69c02823e5730a2e0d2e308b81177c498"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060partial\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/remote_model.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b6d54c47e4c43fd5d9564c287a86069d684711f39c668327787161cb18c36c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060partial\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/remote_model.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"616136986f2ff0a575b43ff1039338a7cbabc6cadb1631119c99ec744d0dbf8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tokio::runtime::Runtime::new()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060store\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/remote_model.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ef2f23968657b1288e5c41b96e0336ecbbd13ece5eb8353aa0da297b70b34d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060store\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/remote_model.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca46806a01369cb6aa3884826300a28a5ac8826a4730411efa4dc3861f89c5cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parts.into_iter().map(|p|p.fill_null(lit(NULL_LABEL))).reduce(|joined,p|joined\u002Blit(COLOR_JOIN)\u002Bp)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/chart/chart_data.rs"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2ff1b7a1de61e77e2605b9bd0c8128a67647a70a49f2513e5db241bdfa1393"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060datui_cli::keys::chord(self.key)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060key_event\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/context_menu.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"3156d60fac931631e76f824072da6e9edfa5a95c4369d998345bd08cba698c7e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060of\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"758ee3acc051168cfd6e5c36585de948324f975a55b1bbc23a25fa72dd68fc87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060readings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"782025f062b63ecf37c4aaf29fe3d26bdba182822113c438dde81a83aec4d820"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060readings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"3776b102e6c789d5ab5ea84337db62de418dab55983ae9be2f6bf889ccbf5c8d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chrono::NaiveDate::from_ymd_opt(1970,1,1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060readings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ef1568ed20ffd3609fee0849e378cf46bac31b34ca53aef4e4452fdccdca1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chrono::NaiveDate::from_ymd_opt(2000,1,1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060readings\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9c05e6f51b2db575aad2fc311667577c0b338e8e5d66c97ed1d267a226ea37"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sentinels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a91502adc1da870be7fc77dc5eb63e19475c5fb2f5ae70f43505b657750757"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sentinels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/hex_view.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"b377a12637422d2b45d0f68b6fcf70805579f116ad6abfdc94ced455f4f5ccd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rt_guard.0.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_impl\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/run.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4804a205529a90b7885287ee634e4e79cc7f625d4aabee20d21d281458758a84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060draw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/terminal.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0de3248c630a9d4a19f9b6a2374f2a73749cf689185fab770825a1ca1668d3a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060clear\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/terminal.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01196a8d052997aa401cc0748ddec73f4f09c9117e24c01fd9659f9b958f0ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.external.clipboard.as_deref_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060copy_destination\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/app/keys/copy_keys.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c64b3062e796d50eddd8317112fa6660a221b8233bb92a421118643436a7ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060names.iter().map(|name|col(name.as_str()).is_null()).reduce(Expr::and)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060profile_shared_nulls\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ad83bbb6dd8514f7ce62b83f02434d4cfe143d91e0eda9aac19a0363f282e8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060[\u0022%Y-%m-%d %H:%M:%S%.f\u0022,\u0022%Y-%m-%dT%H:%M:%S%.f%#z\u0022,\u0022%Y-%m-%dT%H:%M:%S%.f\u0022,\u0022%Y-%m-%d %H:%M:%S\u0022,\u0022%Y-%m-%dT%H:%M:%S%#z\u0022,\u0022%Y-%m-%dT%H:%M:%S\u0022,].into_iter().map(|format|{text.clone().str().to_datetime(Some(TimeUnit::Microseconds),None,strptime(format),lit(PlSmallStr::from_static(\u0022raise\u0022)),).is_not_null()}).reduce(Expr::or)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parses_as\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":5058}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b78e4dbac07435d4b2dbd136d0c8e276ff8f029ee09c5324a5dafbf72b2fc7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SCREENS.iter().find(|s|s.context==context)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060screen\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/keys.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f658e5d3a5c4bbcb5ed0a2c6a27300c5974183100c3d605bf54e5b08a5796a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060EXAMPLES_TOML.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060examples\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ab5b9e1bd6bfc3dc8a3ce3984b22d7b4a957e7db54c4795246cd33069ace2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file.get(\u0022example\u0022).and_then(toml::Value::as_array)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060examples\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4be6a7252cf77cf025d7f8f124e1a206b7b2863495c9a3c75da0ab4d9901e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.as_table()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060examples\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"987a8c09fd229c00fee0021e09e2224fb684d20ace56832922376be32565e47b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060text(\u0022command\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060examples\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d898a1ca8b8f46ea6cb14a29b3f2798666d9903f87405e16db2be38b5f4e2691"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060text(\u0022description\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060examples\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"72459225308b00c61a2ed9da67c054df7308e6bdf638a787a4db6e1dac6eef02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pages.as_array()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060examples\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7786d6ca036d19bdb62af79efaf64d0ac6bd5cfc83831aaed3dd4b6c46437e82"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.as_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060examples\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83beecb500d879253f2082b9cbef9f92174edf216b60e8ead0bc8a750384b43"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060read(\u0022scripts/docs/doc_datasets.toml\u0022).parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060datasets\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/mod.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f05abd4234bdd6cc10e3cb51b20ce3b1862ffbe80dee872ba8cc19d6ae1fc5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060cells\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/roff.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fbf03180bea9724e3d1aadfe0b90e5fa84e52218b9f39d4cf4e99ec5e3903c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060cells\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/man/roff.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe58bbe5d8176aa5da8eb4265079c4488055ebf32952b080b1b8748a54ec630"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060doc.get(\u0022channel\u0022).and_then(|c|c.as_array())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060channels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/docgen/site.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a7962e59596bd53f7e20ff3e3acf3f0f25eb41bb31151de72f7a9ccd32ada3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s(\u0022id\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060channels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/docgen/site.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e159b875d129da33c29f678d5a48c4aabf6021a2c1e2a67d235afd213b0d11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s(\u0022label\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060channels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/docgen/site.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fe87c2018b2006f5b7552aad61f82bf1e0cba208839d8253774b99dbc7f103"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s(\u0022name\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060channels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-cli/src/docgen/site.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7412507b08552c3a138d105f6ec46dc4f53df7a1ac7530c5fc6130537fb44c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060observed\u0060 turns every \u0060Err\u0060 into \u0060ObservedReads::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e74d7abc7c98345d87b4cc3b07bb7e72eae1d2aac81fa86518fbc3cb4abc7d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cache/store.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e701a7dbce609848c2272c7c6de8681348837c949a6ef94e65b7d3499293dd7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060open_defaults\u0060 turns every \u0060Err\u0060 into \u0060OpenOptions::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/open_scan.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd19250b17b51ab8b1721092b96577ebb58c91e39c863d0028406ecb89ac409"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060write_magnitude\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/numfmt.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9d9c677a6b4ffb822810529632f5a151998fe4dfa7bd42399b84521f762e66"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060display_drift\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/copy.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ef5de88d8092a5069b8be2b5a47d2db1c4ef190db9b0f8dfbd20d0a56a58bf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060values_on_screen\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/table/query.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f2965eb2738b55cd4fb7ff06ed7dc2b7bbc450d7b80cf02b47715ef96f6ed6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060duplicate_examples\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/analysis/data_quality.rs"},"region":{"startLine":3472}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abb9cc3349dc28de182f80e6de39608023b1268435a9eb5817a71c179fbc25d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_mc_config\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/cloud/s3_tools.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c1fd9fa70793f834f1f837fc59325db2365b0d839424d2e6dc7f593c76d89e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060text_table\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/command.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8837de378b3c8a59517d9c2c14d123dbdfc7bcd40b1e221cf3b68cef5825e5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cache_splits\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/formats/hf_splits.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa78ad6901737a31fbbb1acf21e1cd83df6d95778342ee830c28df67fc1a033"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060desktop_recent_dirs\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4862c9f34c2ae71d34e4e0d6f30bb19561126466d66780b00760c17afb89d7d4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan_dir_with\u0060 turns every \u0060Err\u0060 into \u0060Scan::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a2b153260c1edf039670fba8a0feb06433547b1ad6d15fe3f099632e79120d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060database_rows\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"211af64d07f16bc18b6fb7a2a959f8505be79c0a17831bb6e10ab62f79317683"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060format_age\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/home/discover.rs"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91694b94d92c8d465f6b32b8b19e035b4aabf7b7d49bc3ef56586096a429c9f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060expand\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/loading/local_glob.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"438dbf43b516991839be70ee30d0878eee659aed3438df0cc657181a92b62a91"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060passed_through\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/query/sql_group.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af480581f23ddf3da4174c8f515387590d2f502ed1447381f91598b3b99c304"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060json_value_text\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/widgets/inspector.rs"},"region":{"startLine":2606}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cda6e6c5d755e2f416676377a9ce9f5b49a0936f81a23db92edc8b220cf265"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060msg.contains(\u0022No space left\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060msg.contains(\u0022No space left\u0022)\u0060 also satisfies \u0060msg.contains(\u0022space left\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/datui-lib/src/error_display.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e0f759dea568fe88f405affc622f79cd0eba403ed38855650ab5a4c5433416"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"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":62,"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."]}]}