{"$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":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"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"]}],"properties":{"cwe":["CWE-506"]}},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"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":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"App::dispatch_action (cyclomatic 102): App::dispatch_action has cyclomatic complexity 102 (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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/tui/app.rs holds 4 of the 22 functions over the threshold \u2014 including the worst \u2014 and 118 of the 320 points over it (37%), 2.8\u00D7 the next-largest file (src/fuzzy_matcher/fzy.rs at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5eb28fab6799c18bbdc2eaee3f9b067b1ca44e19e92616980f036f2f66177c"}},{"ruleId":"D1","level":"warning","message":{"text":"App::handle_event (cyclomatic 37): App::handle_event 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/tui/app.rs holds 4 of the 22 functions over the threshold \u2014 including the worst \u2014 and 118 of the 320 points over it (37%), 2.8\u00D7 the next-largest file (src/fuzzy_matcher/fzy.rs at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ca47ae95810c45c79dc74d20a4681c1ab62dc59407f13d25938216d703bbbc"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorTheme::set_color (cyclomatic 36): ColorTheme::set_color has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/theme.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1453a162e2f495c7b61bcbbb6eda595020ad01596ffd90bbc052b2f9b5b782"}},{"ruleId":"D1","level":"warning","message":{"text":"skim::fuzzy_matcher::arinae::algo::range_dp (cyclomatic 35): skim::fuzzy_matcher::arinae::algo::range_dp has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc38e16a88001262b50eccd2a01b9f75f14445fe9b11d0b422aff136fa2517f8"}},{"ruleId":"D1","level":"warning","message":{"text":"skim::fuzzy_matcher::fzy::fzy_score_typos_full (cyclomatic 35): skim::fuzzy_matcher::fzy::fzy_score_typos_full has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"1907609df9766a393b8a45c7ab40a18929e5fe9e6e0faa99faa2384f675f44a1"}},{"ruleId":"D1","level":"warning","message":{"text":"Preview::spawn (cyclomatic 33): Preview::spawn has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/preview.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0999c48218da23e080060757943fb6b6ff3d1250151a85f517cd1eaa0e0065d"}},{"ruleId":"D1","level":"warning","message":{"text":"skim::popup::run_with (cyclomatic 33): skim::popup::run_with has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/popup/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ecc02574abccd242315156c8343e66c9f4528616354a69ab0f4a2c628cd90d"}},{"ruleId":"D1","level":"warning","message":{"text":"skim::fuzzy_matcher::arinae::algo::full_dp (cyclomatic 33): skim::fuzzy_matcher::arinae::algo::full_dp has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"05627be81c6b3b9ddc118dbc775de583eaf63271475c98d771e59a2d120ad453"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultSkimItem::display (cyclomatic 29): DefaultSkimItem::display has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helper/item.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c92ef4ae300ac8422e77af59a893e5d19f747378777ccd97a0d87b75fe6621"}},{"ruleId":"D1","level":"warning","message":{"text":"skim::fuzzy_matcher::fzy::fzy_score (cyclomatic 28): skim::fuzzy_matcher::fzy::fzy_score has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b2e963a1d56a092df428eecb3d23b6f9af9ca61450b043966cb651c7af97f5"}},{"ruleId":"D1","level":"warning","message":{"text":"skim::binds::parse_key (cyclomatic 27): skim::binds::parse_key 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":"src/binds.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b895f97858717d5e2b30967c0ed0f1087e8a52bab68ad5584a06b660b0e892f3"}},{"ruleId":"D1","level":"warning","message":{"text":"skim::util::printf (cyclomatic 26): skim::util::printf has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b0c941f476b733be7637c694a1297cc0477241f8ebf1e9b4d88f3dc2f15896"}},{"ruleId":"D1","level":"warning","message":{"text":"ItemList::render (cyclomatic 25): ItemList::render has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/item_list.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"e401da4cf5629c77cfe87524b264db644d90300c39a046aa1f06a1bd66618114"}},{"ruleId":"D1","level":"warning","message":{"text":"skim::fuzzy_matcher::fzy::fzy_score_typos_rolling (cyclomatic 24): skim::fuzzy_matcher::fzy::fzy_score_typos_rolling has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"911cb3fec3651384617ccd39adc3f61fddaa08c9defe0ffb514b577887013e1d"}},{"ruleId":"D1","level":"warning","message":{"text":"skim::tui::util::detect_image_picker (cyclomatic 22): skim::tui::util::detect_image_picker 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":"src/tui/util.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a2ecc595e1e4d852f2a9b4f4bd9bb38df68de2307823c5dfaf03f5efb26ebb"}},{"ruleId":"D1","level":"warning","message":{"text":"App::run_preview (cyclomatic 21): App::run_preview has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/tui/app.rs holds 4 of the 22 functions over the threshold \u2014 including the worst \u2014 and 118 of the 320 points over it (37%), 2.8\u00D7 the next-largest file (src/fuzzy_matcher/fzy.rs at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76d9347cf7c1978b0f0e752dc9ccaafdceaec5ce15eb6c13a8ac10218bb5810"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutTemplate::from_options (cyclomatic 19): LayoutTemplate::from_options has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/layout.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1115403e5cb33c2727dda0d2fec9bff23eeeb80b8ed6fe455868cdb15dfb769c"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultSkimItem::new (cyclomatic 18): DefaultSkimItem::new has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helper/item.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de959291f9cc4bceca83147b402bbc4279aed3898d7652ab9acd6cf33c18c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"App::handle_mouse (cyclomatic 18): App::handle_mouse 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 file is where this pass\u0027s cyclomatic complexity CONCENTRATES: src/tui/app.rs holds 4 of the 22 functions over the threshold \u2014 including the worst \u2014 and 118 of the 320 points over it (37%), 2.8\u00D7 the next-largest file (src/fuzzy_matcher/fzy.rs at 42). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ce0089172d7315f9f092c32f29cdf847c993ee50d435c51a060176b5880779"}},{"ruleId":"D1","level":"warning","message":{"text":"SkimMatcherV2::fuzzy (cyclomatic 17): SkimMatcherV2::fuzzy has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/skim.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91d9160f4a35ab6c4861b1d97d3ed820f68ca0792ea2bf7e9c29bf95713601e"}},{"ruleId":"D1","level":"warning","message":{"text":"SkimOptions::build (cyclomatic 16): SkimOptions::build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"000d311731a38052b089aac8e084d5f4ceccb5d26c57491f0b694506cc90dd99"}},{"ruleId":"D1","level":"warning","message":{"text":"Skim::should_enter (cyclomatic 16): Skim::should_enter has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skim.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd464844f1546556f8a307d2f4200388386ff9a5047f385a7b4fa2e992be5466"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::fuzzy_matcher::fzy::fzy_score_typos_full (cognitive 115): skim::fuzzy_matcher::fzy::fzy_score_typos_full has cognitive complexity 115 (threshold 15). Drivers by points: if/else 31 (101 pts), loops 7 (11 pts), boolean chains 3 (nesting depth added 74). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"2596e2d11911ed9d0e7ba6451906a2ea717bb170836062810ad827bf3ca3a76d"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::util::printf (cognitive 88): skim::util::printf has cognitive complexity 88 (threshold 15). Drivers by points: if/else 19 (65 pts), match/switch 2 (13 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 60). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c912e4224519241a09dd4ca70be01c1b87319a642281911e2a54e046183fc010"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::fuzzy_matcher::fzy::fzy_score_typos_rolling (cognitive 85): skim::fuzzy_matcher::fzy::fzy_score_typos_rolling has cognitive complexity 85 (threshold 15). Drivers by points: if/else 24 (77 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a344d2fa42dd24dd8698e2c61f5290d81ec37dd9074f92069a744ff904c067b1"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultSkimItem::display (cognitive 83): DefaultSkimItem::display has cognitive complexity 83 (threshold 15). Drivers by points: if/else 24 (60 pts), loops 6 (21 pts), match/switch 1 (2 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helper/item.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"e580b5fed77d8dd31bfecefdc21e6d381f8c9d127f5edea7c9857dccff539887"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::fuzzy_matcher::fzy::fzy_score (cognitive 78): skim::fuzzy_matcher::fzy::fzy_score has cognitive complexity 78 (threshold 15). Drivers by points: if/else 24 (55 pts), loops 7 (19 pts), boolean chains 4 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e59e46b1184366341867363be52a041ef0011f2a0f7dc3c1b4155a6f4dcb0e2"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::fuzzy_matcher::arinae::algo::full_dp (cognitive 75): skim::fuzzy_matcher::arinae::algo::full_dp has cognitive complexity 75 (threshold 15). Drivers by points: if/else 28 (53 pts), loops 7 (15 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f36f9fcb65745b0a66fe3cc5056e57c5a045211080b499ad40b02721689e41"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::fuzzy_matcher::arinae::algo::range_dp (cognitive 75): skim::fuzzy_matcher::arinae::algo::range_dp has cognitive complexity 75 (threshold 15). Drivers by points: if/else 29 (56 pts), loops 6 (12 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8872b9b4eb59eb6100de855204d322cd89cd4e398754de43a91935f429929103"}},{"ruleId":"D2","level":"warning","message":{"text":"App::dispatch_action (cognitive 71): App::dispatch_action has cognitive complexity 71 (threshold 15). Drivers by points: if/else 30 (52 pts), match/switch 9 (17 pts), loops 1 (2 pts) (nesting depth added 31). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb84f3a8d33bcdfa632abd071175a14741275245b6701e7f5181492d33b9f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"Preview::spawn (cognitive 67): Preview::spawn has cognitive complexity 67 (threshold 15). Drivers by points: if/else 23 (46 pts), match/switch 5 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/preview.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba0352c0964d8a1118a4c4ea19ead4bf240e905d207c9b8835d84762219047b"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::popup::run_with (cognitive 54): skim::popup::run_with has cognitive complexity 54 (threshold 15). Drivers by points: if/else 31 (42 pts), loops 5 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/popup/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"304c0a4af7c8c841e2c31d6b263b7384fd52230bea809c441fe67b874e49f313"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemList::render (cognitive 46): ItemList::render has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 5, loops 2 (5 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":"src/tui/item_list.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"8319a6af9138a6efb8f25b1ff03d823395723603925f8561fa4fb3d0f59f4115"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::helper::item::strip_ansi (cognitive 40): skim::helper::item::strip_ansi has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (24 pts), loops 3 (11 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helper/item.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"71eef07bc873d423e20b18bf930958b88255dcb2b62487dcadeff016bcdc3d5a"}},{"ruleId":"D2","level":"warning","message":{"text":"App::handle_event (cognitive 38): App::handle_event has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ea5c930ed262c2565715f08757e824e83ea20a412261bfb29dbe86ad2799c4"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::fuzzy_matcher::clangd::build_graph (cognitive 35): skim::fuzzy_matcher::clangd::build_graph has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 4 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/clangd.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3924007092aa0eed8862401c4f503496cd7c03e77fcaeb890c2d08303004e85d"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultSkimItem::new (cognitive 33): DefaultSkimItem::new has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 3, loops 1 (3 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":"src/helper/item.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08a2ec93097abd63118e1ad50c50a246060df7183c2f3e2d77919335f1f60ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Input::render (cognitive 33): Input::render has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/input.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fbc8598a259b0ba1096f79282d8a143af61e86b13cec275f1d65fdb69c5b15"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::tui::util::detect_image_picker (cognitive 32): skim::tui::util::detect_image_picker has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (11 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/util.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f971c021422d9cb00282d0caf0cfdf4babe95547e4361f3a7a07a4b8fab6ae72"}},{"ruleId":"D2","level":"warning","message":{"text":"Skim::tick (cognitive 28): Skim::tick has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 3 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skim.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d22602c56b6c8feadb92dc15966542ef1528fd7c91fb0332d009d92120b1050"}},{"ruleId":"D2","level":"warning","message":{"text":"SkimMatcherV2::fuzzy (cognitive 27): SkimMatcherV2::fuzzy has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/skim.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"e333f508dc9362e9cff36781ce82848b169714ab8f2f41f149753035a27bffc2"}},{"ruleId":"D2","level":"warning","message":{"text":"App::run_preview (cognitive 27): App::run_preview has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 9 (12 pts), boolean chains 1 (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":"src/tui/app.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"3428c7ebb4c5068f9e472b87acde17bdcfa573a8ab6fe0f1e62491904a12f8b9"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemRenderer::apply_hscroll (cognitive 27): ItemRenderer::apply_hscroll has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/item_renderer.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bbfbeb289176886f6eced1d55271f0aad36e64d3031bf8f069826598b08f16"}},{"ruleId":"D2","level":"warning","message":{"text":"Skim::should_enter (cognitive 26): Skim::should_enter has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, 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":"src/skim.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"578f85a5d52038e542022763c30a57b734db0e4ae12567cf4d97bb009aeeaa0b"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorTheme::set_color (cognitive 26): ColorTheme::set_color has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/theme.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f0b2419e8e8f85634fbe775de97fc11911e1e84980864bff1d8842b38416a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemRenderer::calc_hscroll_for_width (cognitive 26): ItemRenderer::calc_hscroll_for_width has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (22 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":"src/tui/item_renderer.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5b6a7bc86665a2398cb1424a82033cdce9337def456a218f02c6734dd1f982"}},{"ruleId":"D2","level":"warning","message":{"text":"App::handle_mouse (cognitive 25): App::handle_mouse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4401261cf2f0a8d61e1d96bea3063431250259477d8d0b0436430db444259d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArinaeMatcher::run_range (cognitive 23): ArinaeMatcher::run_range has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/mod.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b8252d276b16c64c91555cb71739ac1b4154924ab16e0dc8acb50d8ec87ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"Header::render (cognitive 22): Header::render has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (14 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/header.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae3828dabe0ff7f778185bb8ef387174d4b7f5fb23028e5149ec9242d6382b9"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutTemplate::from_options (cognitive 22): LayoutTemplate::from_options has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 4 (7 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/layout.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d574451259d57acb14760c034ceccf02db373ae549d28379ce4069cb2eaa6cff"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutTemplate::apply (cognitive 22): LayoutTemplate::apply has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 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":"src/tui/layout.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83ced68307d70cb6ba7821cd8a743eb3a807825c8bbb9eccbf9b844c3c45c22"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::tui::util::wrap_text (cognitive 21): skim::tui::util::wrap_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/util.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c6da8604f5ac2055b7ce8483e8e092d1cf8a31071ac0799002466837a1eb5a"}},{"ruleId":"D2","level":"warning","message":{"text":"Preview::filter_and_respond_to_queries (cognitive 20): Preview::filter_and_respond_to_queries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/preview.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a998944c2547734141b2637832e1413debe8ba846e8a20c6550aa39defb932d9"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::binds::parse_key (cognitive 20): skim::binds::parse_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 3 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/binds.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"55417614cdec90b1e5bb5eb4563e54f43a3a04fdd24d388498d710af773aa0d4"}},{"ruleId":"D2","level":"warning","message":{"text":"App::restart_matcher (cognitive 19): App::restart_matcher has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"43aaa2f8fc9a974271ee9047da5833a86dc6e83d01f67d48348f30603353e58e"}},{"ruleId":"D2","level":"warning","message":{"text":"SkimMatcherV2::build_score_matrix (cognitive 18): SkimMatcherV2::build_score_matrix has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 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":"src/fuzzy_matcher/skim.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0745e1112cfa8ad37f34c7781fcff5e9ee6b70551609829dfd84a30bbac99e"}},{"ruleId":"D2","level":"warning","message":{"text":"SkimItemReader::spawn_io_reader (cognitive 18): SkimItemReader::spawn_io_reader has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helper/item_reader.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c1b7449812b534f6fba1afef75c7d8f606837b9e45675daee70eed15c2e03e"}},{"ruleId":"D2","level":"warning","message":{"text":"PreviewLayout::from (cognitive 18): PreviewLayout::from has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/options.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"527eb053513d57993f52d84e5b5ecce0e264fba75a3d934f09fecaafae2cbd14"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::util::unescape_delimiter (cognitive 18): skim::util::unescape_delimiter has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/util.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"986acc313898e54c607f05068303bf84a7b2a004c0d9a3cfe7268f4d715fe5cb"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::thread_pool::parallel_work_queue (cognitive 18): skim::thread_pool::parallel_work_queue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/thread_pool.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5fb7bd92383ab4da84f81c3e0d493cce9d4ac80df34ed2d226951315a36d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldRange::to_index_pair (cognitive 17): FieldRange::to_index_pair has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, 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":"src/field.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6040eb69f544a3cf5639b823bf768c7b640254bd28669f472ff02d431f996cfa"}},{"ruleId":"D2","level":"warning","message":{"text":"SkimOptions::build (cognitive 16): SkimOptions::build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, 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":"src/options.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"222ba4ff5979698bc0e0542f2ee51f04ce8c5ff74184e1f89662e89979b5bdc2"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::bin::main::main (cognitive 16): skim::bin::main::main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (5 pts), 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":"src/bin/main.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"799dbf28fd60a44bd568e04bcee88d047b78040d2e9aa8fc68a648826ac42dab"}},{"ruleId":"D2","level":"warning","message":{"text":"skim::fuzzy_matcher::fzy::can_match_with_typos (cognitive 16): skim::fuzzy_matcher::fzy::can_match_with_typos has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9386834d6a73df0a2315c01b059cf444d2115d96b1e434882cde8214a2ecf45"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SkimOptions: TooManyFields \u2014 152 stored fields beside 4 methods. The bar is 30 stored fields; this is 122 over it, 5.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e28db8d9b20d74f565e0ff0dba0d1f3549891dcdfb3a75d042765179c92046"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.dispatch_action: MethodTooLong \u2014 dispatch_action runs 316 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 216 over it, 3.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e762c166a8f6404907a84a133bcc4e1e42e1aa75353e4491a4423f84c2ffea9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 1015 significant 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, 4 blocks, lines 50-1622. The bar is 400 significant lines; this is 615 over it, 2.54\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"36605d1ebd74f04ae36040dc46fd7f4c9e70358c496c5c48213681f1031a4fd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/app.rs: FileTooLong \u2014 1053 significant 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 96% of them inside a single declaration: App (4 blocks, 50-1622). The bar is 500 significant lines; this is 553 over it, 2.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a000424cdeb2ca4cafe0ee6f7088062926c7e681f1708b9ef6b08018a34508"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SkimOptions: ClassTooLong \u2014 753 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 3 blocks, lines 135-1523. The bar is 400 significant lines; this is 353 over it, 1.88\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bf103e520b312f623904e498c4f56887f24d5bda32a7027e797898b425048b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Preview.spawn: MethodTooLong \u2014 spawn runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/preview.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cb2e104fe679ee370740565ec859456d5a8d52f59fc046fcb4ac8b791b5b43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/options.rs: FileTooLong \u2014 849 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: SkimOptions (3 blocks, 135-1523). The bar is 500 significant lines; this is 349 over it, 1.70\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb50c811e029f36383333faca969a9321a9d9574cdeb0e10cb507955096895a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SkimOptions.default: MethodTooLong \u2014 default runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc8b5853fe037fd9b4bc4c5f94b3368aacf4eef7986b1ee9c8e7e46e718cac5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: skim::popup::run_with: FunctionTooLong \u2014 skim::popup::run_with runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/popup/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36a219401e791e174c22e351bc9574f0ff811f8734f420db719077fc1236ded"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: skim::fuzzy_matcher::arinae::algo::range_dp: FunctionTooLong \u2014 skim::fuzzy_matcher::arinae::algo::range_dp 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":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1013114087738985e19d59b39bb3a32ccf5a01cbfcbaf0f6aa0946d7a6945e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 43 stored fields beside 28 methods. The bar is 30 stored fields; this is 13 over it, 1.43\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"406d4b3fbfd5e16634d3bedf07eadd3cc12ef63d40757fb9ca87194f56b6909f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: skim::fuzzy_matcher::arinae::algo::full_dp: FunctionTooLong \u2014 skim::fuzzy_matcher::arinae::algo::full_dp runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef251af139e5216eec16b939df1d9f5dc4ca14d2cf8e7916c7c5edc3ff21b32b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Preview: ClassTooLong \u2014 479 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 5 blocks, lines 154-886. The bar is 400 significant lines; this is 79 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/preview.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5515107c07347d824c33a52da608037ea31fd11793f8122cfc81fb1e811c9bb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: skim::manpage::generate: FunctionTooLong \u2014 skim::manpage::generate 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":"src/manpage.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"884419e1f950cfb6c72cd54f0d38cbff78dbf33dbe2df033330e7fea021d9459"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ItemList.render: MethodTooLong \u2014 render runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/item_list.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8214a7a1aec639b1ba204fe4340d3bb1f7fccec8a58e14a22c52493489ff17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultSkimItem.display: MethodTooLong \u2014 display runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helper/item.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be6ece4383f65b7108c00d26008879be2c6345b35e7cf9037606739d3d0200d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/preview.rs: FileTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: Preview (5 blocks, 154-886). The bar is 500 significant lines; this is 78 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":"src/tui/preview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31b33d78268c64b1bca08974465f3328296db46b1406b132330e5d5f177f937"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fuzzy_matcher/fzy.rs: FileTooLong \u2014 553 significant 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 53 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79451d42d59ef1f6b146eb464989f13ddf9d5cad63b42cbcb68700b18cc30927"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ItemList: TooManyFields \u2014 33 stored fields beside 24 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/item_list.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fac8000befa8831e41d3e5122cf29b56bf41408ec79711b77b11f602c156ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: skim::fuzzy_matcher::fzy::fzy_score_typos_full: FunctionTooLong \u2014 skim::fuzzy_matcher::fzy::fzy_score_typos_full runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"897b12bdd7c8706e44952b48e1a32495002362c5b77480e8eeeaa6ecbc32cc00"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ItemRenderer: ClassTooLong \u2014 402 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 2 blocks, lines 27-605. The bar is 400 significant lines; this is 2 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/item_renderer.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"415194b1065248c9d4617b900e7c8865010d25959d09911c30f172042ea2d9f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 20 shared lines): src/theme.rs:173-199 | src/theme.rs:201-227 | src/theme.rs:229-255 | src/theme.rs:257-283 \u2014 These 4 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/theme.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3840e91c8837746d829eed0d7edcdfe95793680d49bd21943b8be3daa9653c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 6 shared lines): src/theme.rs:118-134 | src/theme.rs:136-152 | src/theme.rs:154-170 \u2014 These 3 members are variants of one another: a block of 6 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/theme.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bef34ed1e1693c2399baf74bed5e9af0e9aa3084ee70448f0f2771fc70bdbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (123 shared lines): src/fuzzy_matcher/arinae/algo.rs:124-363 | src/fuzzy_matcher/arinae/algo.rs:382-598 \u2014 These two members are variants of one another: 123 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fab466f1bd4689bf99ec5b493be36a3c3f0ad11f1b641a99f06e571a98dbf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (52 shared lines): src/fuzzy_matcher/fzy.rs:376-490 | src/fuzzy_matcher/fzy.rs:505-662 \u2014 These two members are variants of one another: 52 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadad76199321067fdcdf244942fff747850bd8032bcfca42eba6a75bdea2f5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (52 shared lines): src/fuzzy_matcher/fzy.rs:781-864 | src/fuzzy_matcher/fzy.rs:866-945 \u2014 These two members are variants of one another: 52 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb63f971503dc25774f179efcbaa4d9d4bcbec395b26bbf6fa8e6e8f425ddbe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201346 lines \u00D7 2): src/fuzzy_matcher/arinae/algo.rs:125-170 | src/fuzzy_matcher/arinae/algo.rs:383-416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ad1f06e86e8789d7023d9eace13f5be47b6b59b9526a89ebdbaf9da8680dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): src/helper/item.rs:421-459 | src/helper/item.rs:469-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/helper/item.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd346c2d2c0ce3a5a6547698703df5dde893dd80c73a345df45a09cad40a757c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/fuzzy_matcher/fzy.rs:808-838 | src/fuzzy_matcher/fzy.rs:891-921 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"410e0c9ea45ad7d7850a4901d728e65961f2086b6ac47fdb26dea5846a6d4e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201328 lines \u00D7 2): src/fuzzy_matcher/arinae/algo.rs:205-232 | src/fuzzy_matcher/arinae/algo.rs:455-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac1be6488d58db46779e4103e4c8c62e7fd2bf4281292bfb8c1a447b4ad4fba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201326 lines \u00D7 2): src/fuzzy_matcher/arinae/mod.rs:172-197 | src/fuzzy_matcher/arinae/mod.rs:253-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb9ffae178eab0018ec3864ed0a4754f2c1df8979ab8b721ea55abe595ab6b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201326 lines \u00D7 2): src/fuzzy_matcher/arinae/algo.rs:179-204 | src/fuzzy_matcher/arinae/algo.rs:430-450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9096baf43289e8aa66d3427d62ff3e4a606b555df45a7d370cb08d343f86e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): src/fuzzy_matcher/arinae/algo.rs:241-266 | src/fuzzy_matcher/arinae/algo.rs:482-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f04502ed390e4181738c4a5c8d3d4c93ff91de526de03e08b54b5e546e0b66b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/fuzzy_matcher/arinae/mod.rs:228-251 | src/fuzzy_matcher/arinae/mod.rs:271-294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"da00c1a9d1d70a1c9dd00f74c8b24aa807ccb68402dc49d6770057b95cf3989e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): src/fuzzy_matcher/fzy.rs:444-465 | src/fuzzy_matcher/fzy.rs:567-585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d5bd0d28ff4b33091ed85a4978eb2a86395cc31983c5fc4599ebd32bd657f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/tui/app.rs:1040-1057 | src/tui/app.rs:1138-1155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d65600404407c92fb56a05f5bcd841b16b477fa45bf29f2ccf55e3f5de73a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/fuzzy_matcher/fzy.rs:426-442 | src/fuzzy_matcher/fzy.rs:549-565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea654479fc24eb753686802a8b6339dcc03acd70f758c0c1ce83899c72abcad4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/fuzzy_matcher/clangd.rs:111-126 | src/fuzzy_matcher/clangd.rs:181-196 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/clangd.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23ddbdc7ec4c7b1f15f33e63a3bdcb8491a796e90b5e9904adc26506eb49e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/fuzzy_matcher/fzy.rs:408-423 | src/fuzzy_matcher/fzy.rs:531-546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"0196d182db85609f4365ecef92cc52b0ca98b88347b3ed959d1dcbd99c86c8a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/reader.rs:123-136 | src/reader.rs:151-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/reader.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df907a7637f1592ef201093fb77ecbda7ed165ac2e2642a2fe19926b9df8293"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/fuzzy_matcher/fzy.rs:849-859 | src/fuzzy_matcher/fzy.rs:929-940 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"b708f89cd8bf50dfc6ba8b85ff1458f475c7a0ae54170dc746591b80b53ace8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/theme.rs:189-199 | src/theme.rs:217-227 | src/theme.rs:245-255 | src/theme.rs:273-283 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/theme.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf37ad837ec42fb79ae69b7eef69c89bd1d8b2ca1f656a5d675862a8a5dd24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tui/app.rs:246-256 | src/tui/app.rs:319-329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba591c328ae98268d9b919e17960c4c75816e5345eb4a3ca33040f6d7b24e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/fuzzy_matcher/arinae/algo.rs:320-330 | src/fuzzy_matcher/arinae/algo.rs:559-568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"011c18f22b682dc70ad15f2875d7d1d7745b66290ee706f1a880f337cf1dcf6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201310 lines \u00D7 3): src/fuzzy_matcher/fzy.rs:785-794 | src/fuzzy_matcher/fzy.rs:870-879 | src/fuzzy_matcher/skim.rs:606-608 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ad7eaa2c387cccc3e427a5568e4a85b7670112d70728596f69b1a86234573a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tui/util.rs:299-308 | src/tui/util.rs:389-397 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/util.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"233abaf81aab18d7dea3f3ef85c8cf7e1136b5616f80f7e7d8367ff5af717c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): src/theme.rs:180-188 | src/theme.rs:208-216 | src/theme.rs:236-244 | src/theme.rs:264-272 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/theme.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"4559910b9f20ecd2b78b8f94ea874954f35182fc1d0c0fa029ddef6c8847ca8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/fuzzy_matcher/arinae/algo.rs:276-284 | src/fuzzy_matcher/arinae/algo.rs:524-532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3c7b54f3e3c4041f4b14725260db4e8077ce37f394d17ff24379cdb5a93c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/fuzzy_matcher/arinae/mod.rs:148-155 | src/fuzzy_matcher/arinae/mod.rs:194-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/mod.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4c8927754b53284e592129a13e763162d33051a9767508609c893e5e55b8dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/fuzzy_matcher/clangd.rs:162-168 | src/fuzzy_matcher/clangd.rs:205-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/clangd.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f00fd7790893ed9d0f600341d71de75e4b53befed1d5dfe8824ad8fc9ecb025"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/fuzzy_matcher/fzy.rs:582-588 | src/fuzzy_matcher/fzy.rs:625-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/fzy.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90f892d2d4b9250748cead83fc913d044079984eca15ee54ac8d736f88919f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/theme.rs:129-134 | src/theme.rs:147-152 | src/theme.rs:165-170 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/theme.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb06307002b7baee3020515be4952fcedbb9460ed285f363646e5f3d22b3804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/engine/exact.rs:112-117 | src/engine/regexp.rs:68-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/exact.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c0d65f94fef20e3f9bb5cf5293577b8251bde107a3a5d6dcb9b732616bedd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/engine/split.rs:58-63 | src/engine/split.rs:75-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/engine/split.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfb9297c88822ecd9f7ecafdc925935c0aba849aeb95dbb4510a0d783bed175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/fuzzy_matcher/arinae/algo.rs:233-239 | src/fuzzy_matcher/arinae/algo.rs:474-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/arinae/algo.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f051fe83d3732d610a1f7474dfec01b91b21656701bbf03c8bdbb872cc9482b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/fuzzy_matcher/clangd.rs:97-103 | src/fuzzy_matcher/fzy.rs:771-777 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fuzzy_matcher/clangd.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c4710de6f0bd50bb865e44b034735466f0b363690e4f963c2d048abdda9886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tui/app.rs:571-577 | src/tui/app.rs:578-584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"351d688630af23243a7d2c58cb48cd29bb6da11f1bf8697982f2f0b04d8dd2de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tui/app.rs:588-594 | src/tui/app.rs:595-601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bcde62b215cfc33b405e319fe5178a5a6016a4a332eb655e55ed8ed1a97bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tui/app.rs:377-381 | src/tui/app.rs:384-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"effe0afecb4583685e215a48a32a4e75d0c0c32ba5fe5617e242b22f5c4d97d5"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::ansi.test_ansi_flag_enabled: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f65ac2266a6f02dfc336a4d1ed4c703fb0831117b92ae875fe69e80dd6f80689"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::ansi.test_ansi_hide_nth: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f02f95218090dd6eaee0371cc5662f441f38825469c221782370981c71c8376b"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::ansi.test_ansi_matching_on_stripped_text: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c9cd76b4f643c8c431b83e87c1c3de7ccc0f7e8aa88eda667c0b7cecc9df27c9"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::binds.bind_act_prefix: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f760cf28454a1048e55895b72ae9a1ea8d391b23f9c09d6b3647524f24075073"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::binds.bind_append_and_select: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cf3899cafd61baae3ce382e041384844956b86932f91e80ade0a39825a7e4c8c"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::binds.bind_set_header_change: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cd93b20684359bf21fc0c5bf09baddbab2ac39ec29adb4345d6594442bad459d"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::case.case_ignore_different: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d6424e941f7e3b25ddc830020c65e6bdce75bccb754159390cd32a03947e83c3"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::case.case_ignore_lower: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"60ef0f0ccccc19a0b3bd3eadb10d360b6e25fcb8ed1ca84ad54ea6a4fbd39c7a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::case.case_ignore_no_match: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a4e7e7e5ff24254ebdca598886a29822931fd5eac90fbd40f3d20f9062f6a6f3"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::case.case_non_ascii: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6d123c27fd19237e37118763d7052792def889e81239b48593aeec91112a052e"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::case.case_respect_exact: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"248e2b111e04225850c5be8db87dbe12d2bf45be61e09a0e0a81598b7e89ce55"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::defaults.vanilla: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"08c829819ac5a07f7c4ea4ec1b5987500f854e9c1ad02d2e86c92efa8d02dc76"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::highlighting.highlight_split_match: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4da79cc9c90bc6d0b084f1bb3582b357f1183a23ace7d3663e03c24f276639d1"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::keys.keys_bspace: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c921e4b39e9443f00fcfe9c600e6b40075f9df6431e9c4581c6f7cb5a46ac995"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::keys.keys_btab: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5703a17dfc8e9bbcea342dd7fe71a026ce7bf71129b2d501c8bc0a69ad76f7bb"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::keys.keys_ctrl_k: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e0f898dd20d6f288eaf6b6ec32a77c6c16bd0e0e48e77447279952081eea55d2"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::keys.keys_ctrl_w: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f89e96f88bf8c0893ccbf710cd92f39cbfc566a23ca1abdb717ec986366b1cf1"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::multiline.multiline_custom_sep_colon: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"61d1f3a46cc8d584eec66248b0eb90ac514bcb102334718c11b072dc84f60834"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::multiline.multiline_empty_segment: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"23a80625bad872eb11276b2fa5ebc18a12b4f2aa5e90759bd4611c71b2cbb25e"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::multiline.multiline_layout_reverse_border: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4dbe13bab235af86962261e7fed35574134c42e06ab968a7c818eca12e70584c"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::multiline.multiline_read0_three_lines: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e268f28f24c9d71dca94639bd55562b58475f7d7686456ab649964ca44b80307"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::multiline.multiline_tabstop_default: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b437f1820b054e9a1fac1f7bb99e77329b4c2ff6fd15873499c30437e9354d70"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::multiline.multiline_with_header: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"87697a39e0ea095840e075546e54c5c39bae51c1277f9c6f706f50b2cce671a6"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::multiline.multiline_wrap_both_lines: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"500b3b34b7e058951fde1db44550763b4b71ff1da13b9772b2a288348de37354"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::normalize.insta_no_normalize_accented_item: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"743ad2cbccb3c33b368ffb4dd9e25e339d950872a03c4f6f4f5e9ac9f1aae472"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::normalize.insta_normalize_accented_item_unaccented_query: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3bd9120a1101ef265982bde26ba49b36f4ec18b1c4705e277aee80170e1edd67"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::normalize.insta_normalize_umlauts: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a8bdf342f407e05903993d51092b68280d89da4764c2dfe97669f5db96220506"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_border_double: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc151ec273dba31285be80f56fc406d1e7c6fc95503b8c12c26ee0743377c9fa"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_border_none: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"15bada9aed6f3d8fcdff74d82f05fa20d4fba5bbc8ff55cc99da9b59f8595653"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_exit_0_enter: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"838ee5e4f422e4599e118187df37b15eb43394c67194a14686bf1d9cbeb9ff4a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_header_inline_info: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2c6338bda25beb9e897f96b5a97da96c5cb7a65d30ea371cd89edae3d7fd7f49"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_header_lines_1: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e51804387a68e41f44e8c625f3f91138663360b4fda5b4766360b322dfe14a54"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_header_only: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a05002805e5972cd254f60ec33a281e60f070532d69ee5ab6beaf26abd4aef7d"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_header_reverse_inline_info: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"947f982352291e2feeba0340bc8c9ee40986a58e4d2e145700a094ba76b7813b"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_hide_nth_last: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"afa0424ab4ee5adc2a3bb3a8b5fe4746d525f2522799ad4995ddc534845d1321"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_hide_nth_multi: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fa42682d083b3381657f31e1f850fd9956aab6f87ce28d7bd1336c036fcc426a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_info_inline_right_custom: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5048b1c88e241111e01a5e0e7b01a5b05a3f3dab9d0c620a487f5ffdaab56926"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_multi_selector: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6bd45c289605b7340463a19e8b496fffaf220a7c3c72f17aec84b22823822cfd"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_multiline: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"24e71f5a6fedf2e51815df212713173cb3a958e1792bff0e13895020c3c82529"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_multiline_custom_sep: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1c9fc05171c12513739fccb71ba71000a04967495dadaac2c348463aabb4cda8"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_multiline_scroll: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f9951bc42d67df1aaf3b3c3a0fabbb8ad80818734164aba4c42d990f11b4827"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_multiline_scroll_incr: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"078b19764a92dde360a90ac5fcd56dfdaf52396657f3a5bab72266cbb76ee521"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_multiple_flags_combined_with_nth: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0d24a581874226f44380687b6a3c9f81422984999e8136957f2a49a80d0aa5df"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_multiple_flags_interactive: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"48c153fd2b80950f24413ea001b06ee3a1e540d22fe0a1dd7d8e134224e7bb10"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_multiple_flags_layout_and_reverse: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6498702b73d30478b733545303b5f40a3bd5cbe06e884a13b93d2511891bdbab"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_multiple_flags_prompt: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7e38589672e076a37e54770ce03c90c1bd85d78540de94e216fc7f9c1745d66b"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_nth_neg_2: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"acf59be524d51665818d5de0d8a437f1eb78266e4721957ea83e6764cbde2e2f"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_nth_neg_4: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4bd824c4ef22bc372f46b1f6f384199daa323c5a0e197f65d657545f35ff6fd6"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_nth_range_closed: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8a3e14313e5d5096db34e5134de56d74d42473914385b308f3d12fd8a658c313"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_nth_range_dec: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"30da0f5a413fb732ab2a12c4cabafe844631b65657e63e7eeaf11e456f4e88e0"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_nth_range_to_end: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"baa435b70a2d2624027243562d733fe88ef8ba0912f2193e6cc12f7de3a73df2"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_null_delimiter_nth: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"159df3380edb8bbc8aa9b24adf7585f12cf98f7031bbc70f57dc6018c5f801e1"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_null_delimiter_with_nth: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"056a21d22bc8fc31ec0f8a5eea228be284de345b2d204ae287c28d09b225a465"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_pre_select_n: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"933766240f72a60f8ff9745873260c96377252325182d082b3f197e1e02a2a93"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_read0: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d72172eaf1714fee4d1263546a1842f68f7f7e964e4a6d597f12cb647d15c4c8"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_tabstop_1: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d15c6bcb62d5716142978ae8e35df499fabeeff313068f0d37335d993707edda"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_tabstop_default: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a86f3b5df3621f8abda33cfd93b76235ae6c769cbb8b2e65d7788f55577be2b"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_with_nth_neg_1: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ff6404238edd153bba304942de07f1b4c5da5bef3bf90a98a87861d9e089dd77"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_with_nth_preview: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4cae94935c1c120cc05d4db2d7c254daa272274604bace00e4bc1547f2b8b3e6"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::options.opt_with_nth_range_closed: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"298233125d05048f168f8ca861f1c453fc0a213a28591d43160e4ba408a232c1"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_image_missing: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"15ad0bf4ad086df857b52971c1f6613b83ca79dbc4090a35d41d7b0f37bf93c9"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_image_window_down: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a3e1a77f7c902ce03ea4b90f0fbf8b16637b4655b35c9a68963e3a94fa953deb"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_no_pty_linux: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0eecf953812e71390594922735c40db3f6eec3413b2b0ee90887245a557deca9"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_offset_fixed: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d7c0bc2cd3ad7bf42d9b9f20a1192fe34d2583b28d700dc1eef879382a57b193"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_offset_fixed_and_expr: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"86edad47b7796e5362170f0dc5ffc4772653afdb5f8dadb619959ed1aeb29f68"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_plus: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6369f9950d12c6d12bf4021f8a7e74c311715491c63d42a22924f08776576bc"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_pty::preview_pty_flag: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"61ba1cc6134452fdd8e1f123dad819f52aa57b0addaf4f351adfd50181578c76"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_pty::preview_pty_navigation: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"76c884887f675e91159c06c5024c787057c514db00a80e9741a4f34f1f941969"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_pty::preview_pty_offset_fixed: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7aef6ecfb67582c2ede8aa1df21234b715b9ee8612f64e069169102768070809"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_pty::preview_pty_preserve_quotes: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7be1771392410a8f70ceef77fcd66a5ec1a742e786a13ca4b0a945a3c617695e"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_window_down_neg: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"573a52edd70c76a2028d0def2fb704d1f6d9c0865ee02de270ab8ba963945d3a"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::preview.preview_window_left_neg: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5e899c892d290b16e12232977af04bd4316038e1a5f3cba3b6f7a343aa02b163"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::split_match.split_match_delimiter_in_query_not_item: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"090fe7811686506eb445d31dc91e309631536acce24b67ab4b9e575c4e85a6b5"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::split_match.split_match_or: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fabbb67d288f64ca89370ca6ccb6ec83550fee4f079771e374d3915b3300e713"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::tiebreak.tiebreak_neg_end: Passed 2\u00D7, failed 1\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2defde80508e9928dc06ce8bedc39a88884a1ef11cc66179fa59aa44e1db3477"}},{"ruleId":"D11","level":"error","message":{"text":"Flaky test: skim::tiebreak.tiebreak_pathname: Passed 1\u00D7, failed 2\u00D7 across repeated runs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7078bcd3e1c55a45fba4a78837dc6b4e0d124a9426c5877fc731113023bde2e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tui/app.rs: src/tui/app.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 102 in App::dispatch_action at line 879. 5 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 12:42:15 \u002B00:00\u0027 --until=\u00272026-09-27 12:42:15 \u002B00:00\u0027 --full-history --no-merges -- src/tui/app.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/app.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd06346454061c25b77a2d52203754bfe277b7c58c9bdf7dc5fb891f7dcd00d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/options.rs: src/options.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SkimOptions::build at line 1334. 3 of those changes were fix/bug commits, and the other 11 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 12:42:15 \u002B00:00\u0027 --until=\u00272026-09-27 12:42:15 \u002B00:00\u0027 --full-history --no-merges -- src/options.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/options.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85d64d73dba3dc42467a7e77a6e96f4317073e64393faaad3831a248fb43d5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/skim.rs: src/skim.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Skim::should_enter at line 439. 4 of those changes were fix/bug commits, and the other 5 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 12:42:15 \u002B00:00\u0027 --until=\u00272026-09-27 12:42:15 \u002B00:00\u0027 --full-history --no-merges -- src/skim.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/skim.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a7db670f4763d5cb4c7d09498e9b9f9f62601559c679e73a04a7d7beb0daf2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/binds.rs: src/binds.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in skim::binds::parse_key at line 226. 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 12:42:15 \u002B00:00\u0027 --until=\u00272026-09-27 12:42:15 \u002B00:00\u0027 --full-history --no-merges -- src/binds.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/binds.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"96870ebaba20c3e46a7a2f620cb99c38a493fa8445dc9d448a3af112cb1f1a59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tui/preview.rs: src/tui/preview.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Preview::spawn at line 406. 1 of those changes was a fix/bug commit, and the other 3 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-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 12:42:15 \u002B00:00\u0027 --until=\u00272026-09-27 12:42:15 \u002B00:00\u0027 --full-history --no-merges -- src/tui/preview.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/preview.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45bf4b2cccf5ca12b0d39abe1fe6d2d3ef1660a023ae9545c8edd9a35cca4f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tui/util.rs: src/tui/util.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in skim::tui::util::detect_image_picker at line 259. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 12:42:15 \u002B00:00\u0027 --until=\u00272026-09-27 12:42:15 \u002B00:00\u0027 --full-history --no-merges -- src/tui/util.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/util.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"0302599e26b649d7aa6f0b11af18a180ee660162ec689a62f31645eb3864ca7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tui/item_list.rs: src/tui/item_list.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ItemList::render at line 480. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 12:42:15 \u002B00:00\u0027 --until=\u00272026-09-27 12:42:15 \u002B00:00\u0027 --full-history --no-merges -- src/tui/item_list.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/item_list.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba959b7b6e4c0bac5296e59e9b4df45a66bd9c5410ea0bc4b54a4619bf97622"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tui/layout.rs: src/tui/layout.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in LayoutTemplate::from_options at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 12:42:15 \u002B00:00\u0027 --until=\u00272026-09-27 12:42:15 \u002B00:00\u0027 --full-history --no-merges -- src/tui/layout.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/layout.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c882247957b39b21235d53e55bbdc221a3abad13715a9d5c9273bd2c86c1e49"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/tui/backend.rs: src/tui/backend.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is Tui::start at line 235), UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: make min-height work again (#1168)\u201D; \u201Cfix: do not panic on push/pop keyboard enhancement flags failure\u201D; \u201Cfix: allow execute actions to run interactive commands (#1132)\u201D; \u201Cfix: kitty keyboard protocol\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-06-29..2026-09-27, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-06-29 12:42:15 \u002B00:00\u0027 --until=\u00272026-09-27 12:42:15 \u002B00:00\u0027 --full-history --no-merges -- src/tui/backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tui/backend.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8291d69af9a2c45ea7f82cd4cf667b20a8d071f84b602f42f75e42b3cb14e7fd"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 32 significant file(s) lose their only recent owner: src/tui/app.rs, src/options.rs, src/fuzzy_matcher/fzy.rs, src/tui/preview.rs, src/fuzzy_matcher/arinae/tests.rs, src/skim.rs, src/fuzzy_matcher/skim.rs, src/tui/item_list.rs (\u002B24 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"41e86c447001fdafec91b2b224b94f46812a8eeda63842f0c03bfcf348c23617"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: automate listen tests on windows \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/listen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49286522144e5a7fe95fe205439a1a7689661185b4a17a6bc8349dc81287a046"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no project overview: The opening line \u0027Life is short, skim!\u0027 is artful branding but does not state what Skim is or what it does for readers who have never seen a fuzzy finder before. Replace the first paragraph with an overview sentence explaining that Skim is a Rust terminal fuzzy-finder designed to replace tools like grep and fzf by providing fast, accurate matching of attacker-controlled input."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dbf18d06aa983c06246108610908ba99aae6784280b3aacd1a6655733d71be"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d2bea044ff79d7d275f5a91a6e2f548586178eaf480274c33960ad020c854631"}},{"ruleId":"D22","level":"warning","message":{"text":"Redundant methods for setting the thread pool. \u0060with_thread_pool\u0060 returns \u0060Self\u0060 (builder pattern), while \u0060set_thread_pool\u0060 returns \u0060()\u0060 (mutator pattern). This creates confusion about which method to use for configuration.: Remove \u0060set_thread_pool\u0060 and keep only \u0060with_thread_pool\u0060 to enforce a consistent builder-style API, or remove \u0060with_thread_pool\u0060 if a simple mutator is preferred. (signatures: SkimItemReader.set_thread_pool(pool: ThreadPool) | SkimItemReader.with_thread_pool(pool: ThreadPool): Self)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"aed1cb88d931e6fda5a2524cd894f0ae2d485867154ea19ab4c08e0631d10ec0"}},{"ruleId":"D22","level":"warning","message":{"text":"Naming inconsistency between \u0060hidden_fields\u0060 and \u0060hide_nth\u0060. Both configure which fields are hidden, but one uses the noun \u0027hidden\u0027 and the other the verb \u0027hide\u0027. This breaks the parallel structure of the builder methods.: Standardize on either \u0060hide_nth\u0060 and \u0060hide_fields\u0060 or \u0060hidden_nth\u0060 and \u0060hidden_fields\u0060. (signatures: SkimItemReaderOption.hidden_fields(hidden_fields: FieldRange): Self | SkimItemReaderOption.hide_nth(hide_nth: T): Self)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"005e204702c84a026e26a578c58b3ea29fc6980c9b14974bc5336056c8b02938"}},{"ruleId":"D22","level":"warning","message":{"text":"Ambiguous boolean flags with similar prefixes. \u0060no_clear\u0060, \u0060no_clear_start\u0060, and \u0060no_clear_if_empty\u0060 suggest related but distinct behaviors regarding clearing the screen/output, which can be confusing to users trying to understand the exact scope of each flag.: Review if these three flags can be consolidated or if their names need to be more distinct (e.g., \u0060clear_on_exit\u0060, \u0060clear_on_start\u0060, \u0060clear_on_empty_query\u0060). (signatures: SkimOptions.no_clear_if_empty: bool | SkimOptions.no_clear_start: bool | SkimOptions.no_clear: bool)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"86940945f12d16c6a13efd907146177c07eb9ad0850346e24fe89f51cf15ad5f"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (21977 LoC, 128 public types across 8 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"8a36f713038fec27c8fd71411eb77f0f59139b9f2f530817933a628f24a14b7c"},"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"}}]},{"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":"3dca6ebdc91c785198f909b0e3e739d3a433f6ec4e6e2269c1dcac302e7e0031"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"b5b52056351106a0f413fb6a7ed6f1a86554a34d439d2fbd3636fe84453604ac"},"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"}}]},{"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":"b7ba6c9c0f4685e100392e00ce05a1eef219906626eae17ff9064612d806cd02"},"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"}}]},{"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":"e9ee95c413ba5ef658435195d42b9b22b61736afa8c8a8e6c4cf1531467befdb"},"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"}}]},{"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":"02dc87e1ac499733e44794fef61864b297a5c6b092d7a01f467511257ffe62b9"},"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"}}]},{"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":"66239c0c500be64b5a6045756ae5586c30fce0f4d8f62e0db71e63d5dcb39770"},"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"}}]},{"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":"eaeb141e3bb18056c696db27848bc740333bfb7b8f28484f762b94119c4caad4"},"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"}}]},{"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":"1abf9980ac8a3ae9a473fa3b283d4205e1ae1d97a156a5a8211cbd7a01fc8c93"},"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"}}]},{"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":"4fbc6df3d72864219648f8a5e2a3fe4857d204776cc76785ab693bf45ade35c2"},"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"}}]},{"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":"40dd401b9c2b3b90fba5758908039531c828c86adaba0a5e1a72e93be2b2075d"},"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"}}]},{"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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"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"}}]},{"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":"06daafe2709e468287b505c00bf9feb366987173d1ade4b317a3c3dfe35f4e51"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"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"}}]},{"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":"f1b966c70d2e5f6ab697ac6d268d54938c60e802d8ea58ea6ff9cb7e10a35f70"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"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"}}]},{"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":"fd34071f0a37397b22950926e6e7d533f19a1ab2e35c80a3ec230eef7195ce4c"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"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"}}]},{"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":"f4c98c98541a54b0a01af4adaa864ceaab9a6f71372985da44cfe686401ae741"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1de4e8df69f8ea88743a72dc79ebdff0df14ccb12667fe14ae5c33266501ddc5"},"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"}}]},{"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":"64478662fa5e1544368a8d37a73d78bfc90ea789fe52460bc2794d70b8e273b3"},"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"}}]},{"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":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"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"}}]},{"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":"5a0307a0e95589e470722eaa1f6edefde899ff9d045423b92eaede73ef396b02"},"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"}}]},{"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":"59bdb5a1e8e9e2536fc49c741fcb4259a61a8678fc811d3adeb596662203897f"},"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"}}]},{"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":"04b15c1d822501a1f3b0513e178960337673a790f4f183f2453907ced2d2833f"},"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"}}]},{"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":"a5a94de598d5f66dcc4ccfd4adeb9bbd82d59e61120ddfa86a1354ef816f7094"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"fb4a23173542d7a1718b502d857067e50a3ab2bcd9e6cbc8252c0d9b2bd57371"},"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"}}]},{"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":"9e05a9afdb159c3b4e03fba36ee6c997dfff609cf8e7411f86b673ca79d09a53"},"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"}}]},{"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":"1d11b483dfcf915b1cf80342d758e26c1a3f32b269afb2615b61f8aa4d116443"},"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"}}]},{"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":"5820d2832b24c301dfa745945b6d73762e17d6f8190921e1bba42ea7ccd769f9"},"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"}}]},{"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":"d3863a2595bb228753ae718bfb2db02eb99929aa10f09e1bd606c6259c16041d"},"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"}}]},{"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":"94112b1d706b2f9d9118c577518290919c2d702aa0b944fa06a5bcbb51101185"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"5cd6ba725d4cfdefa0b9a1fc9a630396a4a700aff93699a8233f4a088607d6d7"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a77a628c056f00bc475a03de6d7c923f8e07a855e9b4fc652986cc61cd3be665"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"d2542699b904854fe2d3bb29c559aae2c03652694d5ce26390e798fe91bdf8a8"},"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"}}]},{"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":"66ce8dfb819631f6d056573d18570093e2b6808c89f49165abd76106d4c7720e"},"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"}}]},{"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":"51deb5f11d29da72484d112de68af7e38e0a51818f441a6e0dd487a6031a58d2"},"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"}}]},{"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":"34a8293d9fb14c46e0497422ef889e4c64de1cd5e4d22d33dcf12e1d2f6d5905"},"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"}}]},{"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":"101aea76057fce59420cb6c212119cd272b66eb0842832e04d83b6a6cb33ede3"},"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"}}]},{"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":"bfb28272ce7e2410af5f234719e46b4712b0b0d1091cf5509cd2132366584836"},"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"}}]},{"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":"42c858b994f82dad63658b6fcdafe07700cf1119bbe964f134e1097a2b34a9c8"},"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"}}]},{"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":"a696d57ce735ce27db2d98e3da91dba5e0c4b908723c40f579e1b8bd224f411a"},"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"}}]},{"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":"048871090f1c175eb1d34116b2147bf3a72741b37c29c7ced0c6e574455cbfe1"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"0771808a11368bb70fbaa89c1452e80397738a58b122fea65b1baf5deb01e71c"},"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"}}]},{"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":"2278283c9217d6395a24fce102a9da2df91bf7e8d0bf1cf803c9bdb17ff026a0"},"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"}}]},{"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":"3fbadb2d6d12bd90e4b1f4767a80690b96e53a601539986f1e723999186ef13b"},"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"}}]},{"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":"b8bd4c354ef9e08c46add8c6685082375f773d13562d225e539717dcc76ddfee"},"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"}}]},{"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":"291eb8cb970c93af4d07952c7d689c7ac75a34342e24ff57dc897aa076bdc26d"},"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"}}]},{"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":"dbbdcd01ba14a20c4f323f861d9b1c6f5c856f31875e90c3f8c5133e3b722c14"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f1de24607e04a062d703be65007e1b3a815489fdc094038d8939fa51135297c0"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd84f6db67ad5c3f54f59b04511539ce82e10014ddae931b2bc89dcacb1e08b0"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e599fc59d303356e950b446904eb2cc5f931824d8be1ac46b3847ae0c50981f"},"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"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"41cdfdef4521a5b003bdd4b6bbb69bf4b53fdc88020da351adeb0f3c61a174b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"}},{"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"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"}},{"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":"23242335439540a7f0752c9def5c038b557d1cb0f8e6f7b448b5f69adcab3c1d"}},{"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"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":"d068c977b62d9a977df1bb6f53e8b00b586c3abee955f91d715f92b8e019d624"}},{"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"}},{"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":"35f64a0396611dfd8e0191313b0d7cdc759890497b52affaaa727cf6ce876cfd"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060out.contains(\u0022--query\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060out.contains(\u0022--query\u0022)\u0060 also satisfies \u0060out.contains(\u0022query\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_tests.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aecfff94f3c5d6d0a3bc8d48c83d5c6173438d117bc6110ee4a22a22b912b54"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060out.contains(\u0022--multi\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060out.contains(\u0022--multi\u0022)\u0060 also satisfies \u0060out.contains(\u0022multi\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/shell_tests.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"346ad39aeea2d9ce8dfbf8f31e4ab328b10d6114dd2baf43ef5d2848385e4731"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"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":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"CWE-522","shortDescription":{"text":"CWE-522"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"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":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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."]}]}