{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED1","name":"Handler temporal coupling","shortDescription":{"text":"Handler temporal coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/ED1"},{"id":"ED4","name":"Outbox / dual-write","shortDescription":{"text":"Outbox / dual-write"},"helpUri":"https://codehealth.canine.dev/dimensions/ED4"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"Exec::handle (cyclomatic 124): Exec::handle has cyclomatic complexity 124 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"278697490be24e9feb93a46b2fe68b574c824e2f563afcd2e574116d3f610f98"}},{"ruleId":"D1","level":"warning","message":{"text":"Dom::dress (cyclomatic 111): Dom::dress has cyclomatic complexity 111 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0f05f5d4c93439c1c5adeed39639eb09181c58fc3bf2eb41d43d6acce5b685"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpsectl::commands::run::applets_run (cyclomatic 66): glimpsectl::commands::run::applets_run has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/run.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b79a37def9ca2b636467eed59f8a7e39d64acc4497b0c5d2a960f0e2711ef0"}},{"ruleId":"D1","level":"warning","message":{"text":"Run::wire (cyclomatic 62): Run::wire has cyclomatic complexity 62 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01e8f6e69a4d08867f4eaf3846ef8f021c7b5d2e21fb244a5c81e830dab5aea"}},{"ruleId":"D1","level":"warning","message":{"text":"App::update (cyclomatic 54): App::update has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdcbf0ed9a56c8ce46ae5a95a7191b80f8ceba30f65235c2cedd2d8f5a95b3f"}},{"ruleId":"D1","level":"warning","message":{"text":"App::ingest (cyclomatic 44): App::ingest has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/app.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d181bc476441a0d2b642865d77a44187b87a6ee5387b30f412849e25926ee573"}},{"ruleId":"D1","level":"warning","message":{"text":"Dom::build (cyclomatic 42): Dom::build has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a91f602faccee851f96f0dcc6cca260d8cff595fc2c07409d7780068d11fbd"}},{"ruleId":"D1","level":"warning","message":{"text":"Network::merge (cyclomatic 39): Network::merge has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"49932192b661852f568d7d3a371c808424ec8fcfbd74dfd9e45601e1b80d2705"}},{"ruleId":"D1","level":"warning","message":{"text":"Network::handle (cyclomatic 34): Network::handle has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"811f84ffe3b653f5b6c19571d636fa63790276a9213f03d9d55eb55f0e9df26b"}},{"ruleId":"D1","level":"warning","message":{"text":"Tray::handle (cyclomatic 31): Tray::handle has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/tray/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1daf4685ca2a022c0971a512c7792923bf0723d9b00e0e8ee6a0863f6207cfa6"}},{"ruleId":"D1","level":"warning","message":{"text":"testing.render.commit (cyclomatic 31): testing.render.commit has cyclomatic complexity 31 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/testing.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4818f2d6f0f2a691ca2953f1720fb62e242434fda11447aa1ede8ba98246dee0"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_shot::headless::capture (cyclomatic 30): glimpse_shot::headless::capture has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/headless.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac775bd6251ab4fc6a90c8f78a7afd132c36b043de0ffb8b7a619a18dc807945"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_dbus::clients::idle::follow_provider (cyclomatic 29): glimpse_dbus::clients::idle::follow_provider has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/idle.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e53a6cc0f57e76b98979f9e046398c3e3a52e6c4ce48ed98543b975a03c64a"}},{"ruleId":"D1","level":"warning","message":{"text":"App::update (cyclomatic 29): App::update has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/app.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"519f62efccc9afeff7aa283b42a34cb3de42fe9f1db4950939be7c2dbdafe4e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Notifications::dispatch (cyclomatic 28): Notifications::dispatch has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/notifications.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2fe59d3d1c4b8a44b10175275d60204968c4f16dbf638ff171c01a097b466f"}},{"ruleId":"D1","level":"warning","message":{"text":"session.session (cyclomatic 28): session.session has cyclomatic complexity 28 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/session.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3809e1f4f9f0dd79bff9fd9184289471639e037a2a64cdf4e95c1a5e035693"}},{"ruleId":"D1","level":"warning","message":{"text":"Network::run (cyclomatic 26): Network::run has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efd2f1ab86b000e99db1cb50221247fee2ec0118340e279173b5174ae6ae621"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_compositors::merge::apply (cyclomatic 25): glimpse_compositors::merge::apply has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositors/src/merge.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb38f5a0498ce74aa9f67d031ec86cbe5d238712e96d65370b7e9a0a00fcedb"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_dbus::clients::follower::follow_snapshots (cyclomatic 24): glimpse_dbus::clients::follower::follow_snapshots has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/follower.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab0a53cc8c546ddad65fb6fa83e4943f4606b8da0b1c7b41e254122d2f7f3ec"}},{"ruleId":"D1","level":"warning","message":{"text":"SlotStream::read (cyclomatic 24): SlotStream::read has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/spawn.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b5307c29642c2b75f821f1a38b2a7fd6b8a04135f5002d90d8b5c0e0bb071d"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpsectl::commands::panel::applets (cyclomatic 24): glimpsectl::commands::panel::applets has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/panel.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb392822318f3db6c494959c2ac2eaf05bcbaf98697937f3545918c9330fafc"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultFace::wire_keys (cyclomatic 23): ResultFace::wire_keys has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa1553ed3d5cce32f6f02115f585fe113b56c97e3a2e09d705d820805279e2a"}},{"ruleId":"D1","level":"warning","message":{"text":"sdk.run (cyclomatic 23): sdk.run has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/run.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8b39b8f08dc964c4fa9c1a6c573db5e170352e37f956d8decf3c17d89007c3"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentDialog::show (cyclomatic 22): AgentDialog::show has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/dialog/imp.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ab1708515722711d57d71f86736006fc82a82bb7af9f7f85bca429d13a3592"}},{"ruleId":"D1","level":"warning","message":{"text":"Agent::defer (cyclomatic 22): Agent::defer has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/polkit/agent.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cecfdba0e9ded4f3a89a28d81c97febba7153c610b35858221b52d70bcacee"}},{"ruleId":"D1","level":"warning","message":{"text":"Exec::subscriptions (cyclomatic 22): Exec::subscriptions has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b496f40390944869e2bfa9f09ba8160427fcce6e219d1bff0b70eedf4ecfd7"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_services::services::audio::pulse::run (cyclomatic 22): glimpse_services::services::audio::pulse::run has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/pulse.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df05ce34ac0836cf70dc759958716264a9e5418cc276eb13a585fa505f498f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Frame::upright (cyclomatic 22): Frame::upright has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-wayland/src/capture/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"df76d9d0f46fb4a047b061e74664bb58d9fc0e419c39f178b9dbb1b43f244fd1"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.reconcile (cyclomatic 22): Session.reconcile has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/session.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9669475138611b71232072422fd530063f24d48b46cf40039207635483f98404"}},{"ruleId":"D1","level":"warning","message":{"text":"Removable::handle (cyclomatic 21): Removable::handle has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/removable/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb6b93b889dee6a85095035f6fdf18a504931464b312d06f4c0bc101c6c7d87"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_sdk::run::run_inner (cyclomatic 21): glimpse_sdk::run::run_inner has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-rs/src/run.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ffcca840ee177d2100354a14ba089268a931114497a722bebf428b73a7a2ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Lifecycle::handle (cyclomatic 20): Lifecycle::handle has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/lifecycle.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1967fee1df845c96dd514c2774ac5103ff75c35d0e37b7f140c3c5d4a2e773da"}},{"ruleId":"D1","level":"warning","message":{"text":"Dom::mount (cyclomatic 20): Dom::mount has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: glimpse_panel::applets::exec::dom::element_class (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1788821f1add2fafd48067f0b121881ddf73bec62fa3d385437ad2689704f06"}},{"ruleId":"D1","level":"warning","message":{"text":"Bluetooth::handle (cyclomatic 20): Bluetooth::handle has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0f5331590ee5142a640a2c9207546740264b0d596892d3811a2d801538a279"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultFace::wire_pointer (cyclomatic 20): ResultFace::wire_pointer has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"97344040c824f84a972ce24e0264fbb2eebb9a014ba50207396a205b00105f1c"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_lens::lens::connect (cyclomatic 19): glimpse_lens::lens::connect has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0987ec295c695cd3c7b6e4b5cec6b3b15d70a285173080b30b973a160cec3e"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_lens::session::connect (cyclomatic 19): glimpse_lens::session::connect has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/session.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf77344bcdc65eaf40d331f6a1193ba780fd04c395804a72e37fbf78954ec517"}},{"ruleId":"D1","level":"warning","message":{"text":"App::update (cyclomatic 19): App::update has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/app.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0324541060f698dd14b50172e583399beb809d8fbac9d408f0078679f9b05b0"}},{"ruleId":"D1","level":"warning","message":{"text":"AppletRuntime::update (cyclomatic 19): AppletRuntime::update has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/runtime.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d542dcfd0658335a063fed47a5708a0ae3a94befea156451a916828e0e8b9e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"Audio::run (cyclomatic 19): Audio::run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/mod.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb36e8a8be24f602a789048588dce6594eb4689c0e47b9901457a00c9c58f09c"}},{"ruleId":"D1","level":"warning","message":{"text":"Printing::handle (cyclomatic 19): Printing::handle has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/printing/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"304ff3d53d530f1f371752f330ee522b677b5848e0c3ced187422147ddaa08c1"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor::release (cyclomatic 19): Editor::release has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23f8e50391652c13a7d454bf8834974292ddae89bcdcf81cdf957777753a711"}},{"ruleId":"D1","level":"warning","message":{"text":"Prefs::build (cyclomatic 19): Prefs::build has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/prefs.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9831ef57ea3726bf6ad0f36f6aa97c1d926f513e5c777790ee051f63a9516d"}},{"ruleId":"D1","level":"warning","message":{"text":"Session._reconcile (cyclomatic 19): Session._reconcile has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-py/glimpse_sdk/session.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45365661b922260b00dd7868fb53576d40002044962b66e87bbcee040b66222"}},{"ruleId":"D1","level":"warning","message":{"text":"sdk.clean (cyclomatic 19): sdk.clean has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/widget.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"738c0d443c983f1af003695a277f0b470636a27d89ed1185917a2a93c30a96a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Exec::refresh (cyclomatic 18): Exec::refresh has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d823d1de0043e6b97b7676cf19845edef5d868bc224a3e45d9f9b8d56a879b87"}},{"ruleId":"D1","level":"warning","message":{"text":"wire.wireProps (cyclomatic 18): wire.wireProps 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":"sdk/sdk-ts/wire.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e2cea57073a3119dc20153d3617661d22d752afe611e4359515cb89adaa506"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_agents::obex::notify::follow (cyclomatic 17): glimpse_agents::obex::notify::follow has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/obex/notify.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeff7fc12911de924577239fb402cc947b04ab6f890255b2388ac375593ec1b"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_dbus::clients::settings::follow (cyclomatic 17): glimpse_dbus::clients::settings::follow has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/settings.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d698507c88a50feb920e61ff9a93ff5822be09a025c3a65bc7c1b36cff1f3c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Weather::handle (cyclomatic 17): Weather::handle has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/weather/mod.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a931e94706851f9410bb10e2447e04126490ab0e95dd3006bf179d52ab9286a9"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_shot::cli::validate_annotate (cyclomatic 17): glimpse_shot::cli::validate_annotate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/cli.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"025ce341ec7bfcff5492a79bd4700e0543f1cee0dbf78776c2e50b2a4866dcbe"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpse_shot::doc::redact::pixelate_stroke (cyclomatic 17): glimpse_shot::doc::redact::pixelate_stroke has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/redact.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b87b215dc4e76ce1850b8cc5928de065af01eec070c0a80191315ab500c4d4"}},{"ruleId":"D1","level":"warning","message":{"text":"OwnedPanel::start_with (cyclomatic 17): OwnedPanel::start_with has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/dev.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b4641a5b67924f1ae1f7211633fc4d30a6954fe7e6a2d1709649be39800016"}},{"ruleId":"D1","level":"warning","message":{"text":"glimpsectl::commands::idle::idle_inhibit_child (cyclomatic 17): glimpsectl::commands::idle::idle_inhibit_child has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/idle.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"146fa18cadc450c03db5bb46bba5cffb7054012c28f4b6aaf5c15c30abc050b0"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.handle (cyclomatic 17): Session.handle has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-py/glimpse_sdk/session.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"3215b0b30929664f8c81bf9d854d5316d5c3a012cda58c0c55605e98b4393396"}},{"ruleId":"D1","level":"warning","message":{"text":"sdk.applyStructProps (cyclomatic 17): sdk.applyStructProps 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":"sdk/sdk-go/sdk/widget.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce177756dbd785c4fb20cda205bd708cd51d206de25329349d81f243a2e2fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"Logind::follow (cyclomatic 16): Logind::follow has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/logind.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d2720471772b8f1d8fd326f03154c61698029cf7eeb5a16d2b9c276488bca3"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopMode::handle (cyclomatic 16): DesktopMode::handle has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/desktop_mode.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"df53787c4ffbcbb03173875ba1e9031da322d252193f827f7d0b3586476a3d06"}},{"ruleId":"D1","level":"warning","message":{"text":"SlotStream::start (cyclomatic 16): SlotStream::start has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/spawn.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a661e669adb6710021eb024ab469b98c8ce4404f216fde2ff0022a2a56e78ba"}},{"ruleId":"D1","level":"warning","message":{"text":"CameraSource::next (cyclomatic 16): CameraSource::next has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/privacy/source.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2617a8f87b3164d250a95c3597badb0990740147011a05038f47220d3e5ba24"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor::cursor_at (cyclomatic 16): Editor::cursor_at has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"84950cac47a23ca1abf0c77b609b51982f7803f222fddcd51f2c35fb39746688"}},{"ruleId":"D1","level":"warning","message":{"text":"Editor::preview (cyclomatic 16): Editor::preview has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bdf8509201d248cad45bb442343853705bc92fbb3fcebd4fe4ad6e7379badc"}},{"ruleId":"D1","level":"warning","message":{"text":"Run::perform (cyclomatic 16): Run::perform has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2b74284b0f361be13497f18a74d603e5b54c153cad69380b9ec94172c35090"}},{"ruleId":"D1","level":"warning","message":{"text":"ResultFace::wire (cyclomatic 16): ResultFace::wire has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe58735d6e305ebec4283a3d3d0d62a86a6e36908d667963416a7204499ba2c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Sparkline::snapshot (cyclomatic 16): Sparkline::snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/sparkline.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"558207fb4204a420429b587e760b35774f698b10965adf5b9bb9f85e4e311ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"Exec::handle (cognitive 230): Exec::handle has cognitive complexity 230 (threshold 15). Drivers by points: if/else 75 (178 pts), boolean chains 23, match/switch 8 (18 pts), loops 4 (11 pts) (nesting depth added 120). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2c0007f01e5b5036624bbca391bbebb8bdbfd15e1309b26521858ef15c911c"}},{"ruleId":"D2","level":"warning","message":{"text":"Dom::dress (cognitive 160): Dom::dress has cognitive complexity 160 (threshold 15). Drivers by points: if/else 61 (133 pts), match/switch 6 (13 pts), boolean chains 12, loops 2 (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"7745aca14c1d3529ffd54a327041e79ea777f713202bb24e9735bed927879517"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpsectl::commands::run::applets_run (cognitive 142): glimpsectl::commands::run::applets_run has cognitive complexity 142 (threshold 15). Drivers by points: if/else 44 (93 pts), match/switch 11 (35 pts), boolean chains 7, loops 3 (7 pts) (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/run.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a150af02c1602b0c26d9bf55efdb565c3cd10a0089406c664abcf19b2554c5"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_dbus::clients::idle::follow_provider (cognitive 85): glimpse_dbus::clients::idle::follow_provider has cognitive complexity 85 (threshold 15). Drivers by points: match/switch 14 (50 pts), if/else 9 (31 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 59). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/idle.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d67cd7e9c474152061840ef6647b8bdd930f817baecb553502dab3b1c5ab58"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_dbus::clients::follower::follow_snapshots (cognitive 65): glimpse_dbus::clients::follower::follow_snapshots has cognitive complexity 65 (threshold 15). Drivers by points: if/else 10 (33 pts), match/switch 10 (27 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/follower.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8931030234efa87e94e77ae95761bebb2ceaac2b062567cce99f0177c95d4a9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Run::wire (cognitive 62): Run::wire has cognitive complexity 62 (threshold 15). Drivers by points: if/else 39 (46 pts), boolean chains 12, match/switch 3 (4 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb8c21c8f0cd66bc46492a0531b9a55ea7a2ace0f36ef6ffc9440dbf6e93e59"}},{"ruleId":"D2","level":"warning","message":{"text":"testing.render.commit (cognitive 61): testing.render.commit has cognitive complexity 61 (threshold 15). Drivers by points: if/else 20 (45 pts), loops 5 (9 pts), boolean chains 6, ternaries 1 (nesting depth added 29). Of this number, 55 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/testing.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"913cb8e25eeb9df379c50c41b4343abbce398b3664417e54bf2bcca9d681bbd6"}},{"ruleId":"D2","level":"warning","message":{"text":"Network::merge (cognitive 55): Network::merge has cognitive complexity 55 (threshold 15). Drivers by points: if/else 30 (54 pts), match/switch 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ad5feea92ba166f36bb7036582e5d4d8ca767e5db1cab545eec0fa726b498c"}},{"ruleId":"D2","level":"warning","message":{"text":"App::ingest (cognitive 52): App::ingest has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (41 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/app.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46fd0b6cd9ec6fe57aa0652a48f49bef88c1e910d50234147fd917abbb57ad5"}},{"ruleId":"D2","level":"warning","message":{"text":"session.session (cognitive 52): session.session has cognitive complexity 52 (threshold 15). Drivers by points: if/else 7 (22 pts), ternaries 4 (15 pts), loops 4 (7 pts), error handling 2 (5 pts), boolean chains 3 (nesting depth added 32). Of this number, 49 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/session.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fe89212127f69178fa08987e545c32e35ca832f28630c479667deede0923e3"}},{"ruleId":"D2","level":"warning","message":{"text":"App::update (cognitive 49): App::update has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (40 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f606c2d2bd6eb7022665635c50c8885c9d66ea1fbdd711f86d744dd0d3a8a928"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpsectl::commands::panel::applets (cognitive 49): glimpsectl::commands::panel::applets has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 7 (15 pts), match/switch 4 (5 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/panel.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"439f450a3280a3420ef3515c1abd0f845305aaa94326e336b5af5c8e5a9dca75"}},{"ruleId":"D2","level":"warning","message":{"text":"Exec::subscriptions (cognitive 43): Exec::subscriptions has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 3 (10 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6807fa1e00acdac396ff376cbb7fca639fb9508a0df937b37311b5d01bccea5"}},{"ruleId":"D2","level":"warning","message":{"text":"sdk.run (cognitive 42): sdk.run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 4 (6 pts), match/switch 3 (6 pts), jumps 2, boolean chains 1 (nesting depth added 20). Of this number, 35 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/run.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4595b92548c8a958fe03a598490cc395d6199005f050d94d8967e13c6e5d9e1"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_shot::doc::redact::pixelate_stroke (cognitive 40): glimpse_shot::doc::redact::pixelate_stroke has cognitive complexity 40 (threshold 15). Drivers by points: loops 11 (27 pts), if/else 6 (13 pts) (nesting depth added 23). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/redact.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9475a3d136ab073b2235eb7f49917a6987a7cfd20fa49396962a32a40e57d529"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_services::services::audio::pulse::run (cognitive 39): glimpse_services::services::audio::pulse::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 5 (12 pts), loops 3 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/pulse.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfb68990c4a2047c033fa6835997e3662c20dd517bbaafb291cf23af610a583"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_sdk::run::run_inner (cognitive 39): glimpse_sdk::run::run_inner has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 5 (14 pts), loops 5 (9 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-rs/src/run.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5030938b2a51ffcbb62dc73c0b6078824ae54907afaad9de412ea467f676cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Network::handle (cognitive 38): Network::handle has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"7748bb67969c059520827244f1e19bd41b3a9f5aa47906521e9bed93d338ddd3"}},{"ruleId":"D2","level":"warning","message":{"text":"Frame::upright (cognitive 34): Frame::upright has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 4 (9 pts), loops 4 (8 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-wayland/src/capture/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b547cbf139e85cf31caedf9858c371f840b751658b4a287ee36038dc5f64d13d"}},{"ruleId":"D2","level":"warning","message":{"text":"Dom::mount (cognitive 33): Dom::mount has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 5 (11 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54c14d163b43cb80fe29f6b6ea38ef8eb0b476b22bf5d6caddb1cbea618b2bd"}},{"ruleId":"D2","level":"warning","message":{"text":"sdk.oversized (cognitive 32): sdk.oversized has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 4 (10 pts), match/switch 2 (3 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/widget.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c028d7898fa92f7fc4f8a17ba885860fa33bf6b202b0f0a73b69075e67b8b3ea"}},{"ruleId":"D2","level":"warning","message":{"text":"sdk.applyStructProps (cognitive 32): sdk.applyStructProps has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/widget.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79927b1d9c14c4e2213a14bbe2fb59ad67900df7e81a943544a8ef0bbabb778"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.reconcile (cognitive 32): Session.reconcile has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 6, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/session.go"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac00043dc7b5b4dbfece9e726d9db7fd0b68a99d260c9bf9dea20672459bb86a"}},{"ruleId":"D2","level":"warning","message":{"text":"Notifications::dispatch (cognitive 31): Notifications::dispatch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (5 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 15). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/notifications.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55512f9d7d255cabfacfb7087aa14a3fe20f72bbb1b5df9e0e10fa29a61654d"}},{"ruleId":"D2","level":"warning","message":{"text":"_Connection._dispatch (cognitive 31): _Connection._dispatch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (7 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-py/glimpse_sdk/runtime.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4965a698f74ee14611aa05c48f0a509f9afdcdad17d37d653d01e9d00d6418"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_dbus::clients::settings::follow (cognitive 30): glimpse_dbus::clients::settings::follow has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 3 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/settings.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c7f6e1081409b3e8f83fa9ea150f99e0ba66951ae77d643b23811b112f3698"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpsectl::commands::idle::idle_inhibit_child (cognitive 29): glimpsectl::commands::idle::idle_inhibit_child has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 3 (7 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/idle.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"746d09631aa6041c3bc1f4ccc1aa30334c27c49d230a9f650f7a2fd8fffc7c7a"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_panel::applets::tray::menu::install (cognitive 28): glimpse_panel::applets::tray::menu::install has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/tray/menu.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68963a88f61a19778eab04a863d39f92c46ff046d6d12139aaa531c1fbf8e73"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_shot::doc::redact::redact (cognitive 28): glimpse_shot::doc::redact::redact has cognitive complexity 28 (threshold 15). Drivers by points: loops 9 (28 pts) (nesting depth added 19). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/redact.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"12962cfde9ec4a3c47464dcf494501cd20d9d8fddae393db813c59bb7b130d18"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_idle::inhibitors::login1_observer::start (cognitive 27): glimpse_idle::inhibitors::login1_observer::start has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (9 pts), match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/inhibitors/login1_observer.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea630a22bd3481d52ee4a41980612f65a647638c1c5f17a4b77705f07a1b3a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Audio::run (cognitive 27): Audio::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/mod.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"273fd30ceadca9adc4f5fe002b4ea2cc23a67ba2658d122208afbd96e160081a"}},{"ruleId":"D2","level":"warning","message":{"text":"CameraSource::next (cognitive 27): CameraSource::next has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (10 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/privacy/source.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b4caf0fc798b1e9ce852c17edf6512d0f9e51cb7d8b0aefc22fed0c8056d31"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultFace::wire_keys (cognitive 27): ResultFace::wire_keys has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"10002528722d0f47e2a77f7ca4e72c2fc2a73c32a4aa6332927d0d07f5dbb3a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Sparkline::snapshot (cognitive 27): Sparkline::snapshot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/sparkline.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"82762b32999c7faaab251d6830586779d0f6ddfdb2f2f9f26c81f796ad113495"}},{"ruleId":"D2","level":"warning","message":{"text":"sdk.clean (cognitive 27): sdk.clean has cognitive complexity 27 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 4 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/widget.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"718f9fcd34028b4e758118c5f8b49057503b7c2913300ca3cc0a286dd1124ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"Network::run (cognitive 26): Network::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6243c7b87d33aa53cafdabc4ab7931cf8cc1ecf0f51995563539082ea4e9f99f"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_shot::headless::capture (cognitive 26): glimpse_shot::headless::capture has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 7 (12 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/headless.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48296c97109e8b75f3d090f7b70dd82703f7b0e0f16f335bd57f455f0314924"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpsectl::commands::panel::panel_list (cognitive 26): glimpsectl::commands::panel::panel_list has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (6 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/panel.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b346dfe1784b6384251e78db004a4fdce3efbe1bba5f1c8023986788a11259"}},{"ruleId":"D2","level":"warning","message":{"text":"Session._reconcile (cognitive 26): Session._reconcile has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3, boolean chains 2, ternaries 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":"sdk/sdk-py/glimpse_sdk/session.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"953dcd6b79fdc7330b98132ea34b2ca0796bdb62e3e10f83cf9d20e942f31054"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_compositors::merge::apply (cognitive 25): glimpse_compositors::merge::apply has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 3 (5 pts), loops 2 (4 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositors/src/merge.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7801a7fffdbc7b64e73aba0e510ab5cc5ab562659d51927122a51d3415e73b23"}},{"ruleId":"D2","level":"warning","message":{"text":"Exec::refresh (cognitive 25): Exec::refresh has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1a4729a6dc439dc88b8c785b4f2ddff4fa394f0f8ec364205efa081afdde6d"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_settings_daemon::provider::start (cognitive 25): glimpse_settings_daemon::provider::start has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-settings-daemon/src/provider.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd8e25a83819e58a79ca2392adc060705e7b7f21dc049eb0b6d7b058849c5c7"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_panel::applets::tray::icon::choose (cognitive 24): glimpse_panel::applets::tray::icon::choose has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (4 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/tray/icon.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36745d87de60360e337c7813cdac2c524b6ecbe02565e5a808eaa9193c0512a"}},{"ruleId":"D2","level":"warning","message":{"text":"Tray::handle (cognitive 24): Tray::handle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/tray/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c64ed5805767389f3fde7a2b3deb1e9dc652838f2376ed5f24a6b4adbacb1bc"}},{"ruleId":"D2","level":"warning","message":{"text":"OwnedPanel::finish_units (cognitive 24): OwnedPanel::finish_units has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (7 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/dev.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b17a94f1328a188ede743726279222ab02ed2075ec16c63882f257d8682514"}},{"ruleId":"D2","level":"warning","message":{"text":"Watch::next (cognitive 23): Watch::next has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (8 pts), match/switch 2 (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":"crates/glimpse-config/src/watch.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e819f7ff70b7a4dd92973db9919ebc4cf6844d93ffd17c5d7e2f3a60fea50b4"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_idle::inhibitors::screen_saver::watch_disconnects (cognitive 23): glimpse_idle::inhibitors::screen_saver::watch_disconnects has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 1 (5 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/inhibitors/screen_saver.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"295659ef2d8ecd86cd6c580e550f9bdddb3e1f0400c6ef3fca6881b0241d89c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Exec::regroup (cognitive 23): Exec::regroup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2fdfbed4b0e51f106d8602b40735badf770227b6746a8d87c07ce5118204fe"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpsectl::commands::watch::watch (cognitive 23): glimpsectl::commands::watch::watch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (5 pts), loops 3 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/watch.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"287538179bd442a7a75ae33a96d989aa9fad7412706fa7af060d28279ddd6e2e"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent::defer (cognitive 22): Agent::defer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/polkit/agent.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68f12ffd9c9fabb8f96702291a3c235e7a67266ab9f4c72c26b9dbe423a63f1"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_compositors::provider::follow (cognitive 22): glimpse_compositors::provider::follow has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositors/src/provider.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf079a86bdcbedb714f18b11755fe38bdda45b98cc19a030bb6739dfae79aeed"}},{"ruleId":"D2","level":"warning","message":{"text":"Logind::follow (cognitive 22): Logind::follow has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 2 (7 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/logind.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e69199ea5b651c017bcdaf5e3b0e09909cf746eed6493339b98a0b8f27bbdd"}},{"ruleId":"D2","level":"warning","message":{"text":"Weather::handle (cognitive 22): Weather::handle has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 3 (5 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/weather/mod.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c1c3990bd982d9fb6bdcdf901a56ed895e326cbd82305beb9359cc0ed0eabf"}},{"ruleId":"D2","level":"warning","message":{"text":"Shell::choose_image (cognitive 22): Shell::choose_image has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bea53e3b69b76e158b038b62332ae87a4b0e6d17583fdaa0ef887ae478e586"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultFace::wire_pointer (cognitive 22): ResultFace::wire_pointer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17 (19 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e57a65016e389526b0e48e6e3677416402a8f55249fc8bc76a6d9e3e9970c2"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_widgets::notification_image_body::bound (cognitive 22): glimpse_widgets::notification_image_body::bound has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (18 pts), boolean chains 2, if/else 2 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notification_image_body/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c594fffecdc16a3b6227a7190acdf3b47ab8ad501c2fcc1b84db3b74e28e973"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentDialog::show (cognitive 21): AgentDialog::show has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 4, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/dialog/imp.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfacff696f8c1d77e599deee8178c002fa83ba0070f6b3f6505ad5d2222ffc2b"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_dbus::clients::provider_owner (cognitive 21): glimpse_dbus::clients::provider_owner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/mod.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c9b42b16439a606966b202c2a56abe18e020e87c1e3944517d14c8c8d3ec9c"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_panel::applets::network::render::details (cognitive 21): glimpse_panel::applets::network::render::details has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/network/render.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44fb3c9ff3d8f281c51f8d078b82a7a76fed6423f48d780e0594405cc77a295"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_panel::selection::run (cognitive 21): glimpse_panel::selection::run has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 2 (6 pts), boolean chains 2, loops 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":"crates/glimpse-panel/src/selection/mod.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d041dab2e06376a987cb37d279d236f61601cdbaded12afacd4eeb3c75807f60"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::cursor_at (cognitive 21): Editor::cursor_at has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"7020e79069a3332219cc13daf5570d5c76bb8c8415da8538d7c42dad635cd308"}},{"ruleId":"D2","level":"warning","message":{"text":"Prefs::build (cognitive 21): Prefs::build has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 4, loops 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/prefs.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"518270f4e1343e78e1ab0e6d448b173d49e943dc9b1a7aba073d5139dcc62bb8"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_shot::cli::validate_annotate (cognitive 21): glimpse_shot::cli::validate_annotate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/cli.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9d43eb436b91d4d39c7fcc53fa06aa8384f5aa30255af090b92bbfc78fa268"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.Rebuild (cognitive 21): Session.Rebuild has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). Of this number, 18 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/session.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ccf9438b44dcf8c255a151c523c7e64112f428abad3602dd571355c84ba0ba"}},{"ruleId":"D2","level":"warning","message":{"text":"wire.wireProps (cognitive 21): wire.wireProps has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/wire.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fc0b75cd7d747074790a47a8c3da92467beb4ed83af34d3b5cd275cb827cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"testing.render (cognitive 21): testing.render has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts), error handling 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 8). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 159). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/testing.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4d4cb50dec6682d1ce7099857a1b0daaf93c20d41b99cb3376d39ebf031bc7"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_agents::obex::notify::follow (cognitive 20): glimpse_agents::obex::notify::follow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (7 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/obex/notify.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa6904bb145744c3e965fa6b7f26e7667d9c4f348233fee0435e13b0e34fbd1"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::next (cognitive 20): Reader::next has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/watch.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"464a84d39774f9de66b1f9ed3bd75efcf536175519dbcee4244cd4862f8ff26b"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopMode::handle (cognitive 20): DesktopMode::handle has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/desktop_mode.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c58163c7e353f8e35855c84183fdcdef76e455563a224a015107eed26f3fd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_widgets::raster::evict (cognitive 20): glimpse_widgets::raster::evict has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/raster.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9244bfa401468b815b1c1a468797fee38a44684cf9179d9149ca62746c4f54"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_services::services::calendar::expand (cognitive 19): glimpse_services::services::calendar::expand has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/calendar.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e95364fa7779fd4c905ea16e785ad9b70f3ca88f3ebf91bb55c3327f104d7d9"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_services::services::printing::subscription::parse (cognitive 19): glimpse_services::services::printing::subscription::parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/printing/subscription.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a33b9151553b52bc30f49f3cfb2cbe4a19b72f8d63e6c7df3f01f3f2409cbd5"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_shot::doc::redact::box_blur (cognitive 19): glimpse_shot::doc::redact::box_blur has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (16 pts), match/switch 2, if/else 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/redact.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53c746821d80de4fdbbeb5a32dc25c438f97ad85cc7e2d18ebeeddce446732d"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.Handle (cognitive 19): Session.Handle has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/session.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fe0f3d0357496d060a41606f77042c959c1785fb0a5019209c5ca429f06eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Lifecycle::backend_ready (cognitive 18): Lifecycle::backend_ready has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/lifecycle.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6f113fe5aabd15ec27e2add23a12efc8ee6d1571108eda033e9556991eb687"}},{"ruleId":"D2","level":"warning","message":{"text":"Printing::handle (cognitive 18): Printing::handle has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/printing/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf426fd9f1d23bacba909be964651fd7d7b0d71da85861687e27e81bf6647f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::release (cognitive 18): Editor::release has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"07307c1d2c7639067a7c17a676b3078f0ba24176e85ba3fddc31f71ce28ef247"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_shot::cli::editor_option_after (cognitive 18): glimpse_shot::cli::editor_option_after has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/cli.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a29ac41ee7d75f0485b068f59ae6931344d80631a0d7f9d51c39f1bc517780f"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_lens::lens::connect (cognitive 17): glimpse_lens::lens::connect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edeaeb739f189da1e66f021f23d91925556a317c6241be075ee26ca6db0d4b3"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_lens::session::connect (cognitive 17): glimpse_lens::session::connect has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/session.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"194fdef2e2fcbb931bab6a201a52a338e55d6fc66bd61996b0c098607fd6bb33"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_panel::app::reconcile_panels (cognitive 17): glimpse_panel::app::reconcile_panels has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/app.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a0cb5485106ff479512800a1b91e9532e777a4b4a12d828c1f146d5d051e17"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_panel::config_alert::spawn (cognitive 17): glimpse_panel::config_alert::spawn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/config_alert.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b407aa0029231508e0a38bd37d5e45a88bed5de0311fc95388f684141b4dfa83"}},{"ruleId":"D2","level":"warning","message":{"text":"Exec::sync_aliases (cognitive 17): Exec::sync_aliases has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"e427b92c81c0b9516d6db652ead1fdf69dc92ba7b1528048dcd630d9f3ceaf73"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_services::services::exec::catalog::expand (cognitive 17): glimpse_services::services::exec::catalog::expand has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/catalog.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6343ef3fb00f696f28b14c90e1247fa08df1f949142a4b735940e2d2db09402a"}},{"ruleId":"D2","level":"warning","message":{"text":"OwnedPanel::start_with (cognitive 17): OwnedPanel::start_with has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3, loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/dev.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee189b7275d3eeef47757b2029ac2dda585532cd2e6c025d2344a4464f56282a"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::reconcile_children (cognitive 17): Session::reconcile_children has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (6 pts), match/switch 3 (6 pts), loops 4, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-rs/src/session.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b750c5104aede14a4539e7ac1250c1fe67cb9bc77f1ebd14b5a871da09334d"}},{"ruleId":"D2","level":"warning","message":{"text":"W.__init__ (cognitive 17): W.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 3, if/else 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-py/glimpse_sdk/widget.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"638a934d94c3c71874c65424a00be8cba815c7624e5029407186e8c57dc470a8"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_agents::lock::watch (cognitive 16): glimpse_agents::lock::watch has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 2 (5 pts), loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/lock.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"882b2365c3e14828b0654d31019a0bb503c5c787a1a64f08986b07cf4ba5ec2f"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_agents::polkit::expand_short_command (cognitive 16): glimpse_agents::polkit::expand_short_command has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/polkit/mod.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"528c7c121b7e882bd213721b7302908f8edfbd3856c17560d5dd0add810bd378"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_agents::polkit::helper::drive (cognitive 16): glimpse_agents::polkit::helper::drive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/polkit/helper.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd4d4459bf857578513d595cefa020a59876c8869c4a600da53d468acb3e5ae"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_config::load::load_files (cognitive 16): glimpse_config::load::load_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 3 (6 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/load.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d53d8f98890e0e2f9be43c9f782030f954fa057e3754bcf2680d7261826ce40"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopMode::apply (cognitive 16): DesktopMode::apply has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/desktop_mode.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04fd3de48ca0f884334ac68ae61f1706e92427abab78435bbd514f7befb36b5"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotStream::read (cognitive 16): SlotStream::read has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 4 (7 pts) (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/spawn.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5ce956f359549af1471629202b651218d180f7f87bea9e2eb10f079e0efb45"}},{"ruleId":"D2","level":"warning","message":{"text":"Removable::handle (cognitive 16): Removable::handle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/removable/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d15f11e76edf9aff689576331a1ecce2b512cdff78f7c228e16c315d0643ec5"}},{"ruleId":"D2","level":"warning","message":{"text":"Shell::dispatch (cognitive 16): Shell::dispatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8755709431b33a5bc119df5e9ac1fbe4faa2c8f8bab6680b55fdc73881819b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor::preview (cognitive 16): Editor::preview has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"19aeeb939ec4a6488ad1ee95e93ff5975264be956d78c9106cba69273abc0ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_shot::cli::validate_gui (cognitive 16): glimpse_shot::cli::validate_gui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/cli.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ba02e2cf39ab20d2bc7317c95e5a2c677517eafa31fef33794fef525d47045"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_wallpaper::portal::notify::changed (cognitive 16): glimpse_wallpaper::portal::notify::changed has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 2 (6 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-wallpaper/src/portal/notify.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fe09efc80fe34fa58d43d98801650ed1d9df2f50443ebdbff459f7bc07289a"}},{"ruleId":"D2","level":"warning","message":{"text":"glimpse_widgets::sparkline::runs (cognitive 16): glimpse_widgets::sparkline::runs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/sparkline.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b5231bd8bfccfef3c253e78c2024addfeb6e1569c51182b2e28262bcdac041"}},{"ruleId":"D2","level":"warning","message":{"text":"sdk.appendStructValues (cognitive 16): sdk.appendStructValues has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/widget.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7e81b7a17e9769f9927222849bdf8676bd8cf8d997c97db2b192f0c557ae36"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.render::walk (cognitive 16): cli.render::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"website/scripts/cli.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1319c5bdd1b745d2e85e45d300b3ac1f89c2c24330974ef707a1166fa4b0cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Exec.handle: MethodTooLong \u2014 handle runs 517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 417 over it, 5.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"305f46a0519fdd26ac2730cebd6e9ce5ae37e9dc354adf2cda2fa95ce4ae2a9c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ServiceEndpoint: TooManyMethods \u2014 105 methods, declared across 23 files: exec/mod.rs (13), network/mod.rs (12), bluetooth/mod.rs (10), services/notifications.rs (9), \u002B19 more file(s). The bar is 30 methods; this is 75 over it, 3.50\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/service.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4e40d6c3107588d64fdc354d90ab970d5501accb2d29976b37bca879de2808"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/elements.rs: FileTooLong \u2014 1673 significant 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 1173 over it, 3.35\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":"sdk/sdk-rs/src/elements.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2d0da905ca15061e0e7663184fc60107ba15f26abb212477b132b28740be3b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dom.dress: MethodTooLong \u2014 dress runs 334 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 234 over it, 3.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba66f138548ca28e6bfe1da494ace3b44d6875417cd4733ac72f64b893e6e18b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Dom.build: MethodTooLong \u2014 build 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":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c6a372dbaeed48972be38b4494e76b392dba7d2b4b9e79832b9ca5315c0b28"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: exec/tree.rs: FileTooLong \u2014 1574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 65 free functions. The bar is 500 significant lines; this is 1074 over it, 3.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ae1d739ca911b10f84b2ee59eb17bb8d3ae71913d3a6fe22f18ea8cb7a3bb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gui/overlay.rs: FileTooLong \u2014 1351 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: Run (2 blocks, 100-1502). The bar is 500 significant lines; this is 851 over it, 2.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":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dca5b174b8bba2eabb49e7570932137828b848f935cc7f6ec9054ed4b040e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Run.wire: MethodTooLong \u2014 wire runs 266 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 166 over it, 2.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0e7afe797332de9cc2e20f787d795431f0bc63a23469b4af5bad44bf31cefd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: exec/mod.rs: FileTooLong \u2014 1308 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: Exec (3 blocks, 472-1699). The bar is 500 significant lines; this is 808 over it, 2.62\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"884705819dc570988b2adc3c75d24b7a2ea5792081632ad2c53deb74ad12e4fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glimpsectl::commands::run::applets_run: FunctionTooLong \u2014 glimpsectl::commands::run::applets_run runs 248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/run.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5542eba287208d488b9d1054815e897a6e662e4e0b646d617a5b26d6b1357192"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Dom: ClassTooLong \u2014 990 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 3 blocks, lines 62-1333. The bar is 400 significant lines; this is 590 over it, 2.48\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e46ef21bbf427884927b43b77256e58012597c6687dd0a20e56fcd1c68036f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Run: ClassTooLong \u2014 983 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 2 blocks, lines 100-1502. The bar is 400 significant lines; this is 583 over it, 2.46\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebe39a9da46930a8b560baaa95dad4b68ade0fb208a66ac4defd9064a1d804e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: exec/dom.rs: FileTooLong \u2014 1226 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: Dom (3 blocks, 62-1333). The bar is 500 significant lines; this is 726 over it, 2.45\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"940ec85885eaa310e8328084e9c7e1e293133ebb6a43c55eb487211e3fea2471"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Exec: ClassTooLong \u2014 915 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 3 blocks, lines 472-1699. The bar is 400 significant lines; this is 515 over it, 2.29\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb70551d683396e09394dbe322664609556cd80f8772a097c9fabf8670d91001"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 1108 significant 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 608 over it, 2.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c742ee2cd4a4d25c95782ae07f50c701eaf66198ad2a3cf1376d448672cd4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: network/mod.rs: FileTooLong \u2014 1100 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: Network (3 blocks, 400-1524). The bar is 500 significant lines; this is 600 over it, 2.20\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6193f7c9a4c82467c61243cec46339282c84dee91cbda6e12b9ecda04de379"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gui/canvas.rs: FileTooLong \u2014 1063 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 563 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a162d7aa470e439668dc236b8029ef0773dd98e4649623df36f15609d7e07960"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gui/result.rs: FileTooLong \u2014 933 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: ResultFace (2 blocks, 65-1170). The bar is 500 significant lines; this is 433 over it, 1.87\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3564de4a5864aa9375961ec983e2fbca3d36ede8629d65d72cec858336458746"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ResultFace: ClassTooLong \u2014 728 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 37 methods, 2 blocks, lines 65-1170. The bar is 400 significant lines; this is 328 over it, 1.82\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b334ab71e710c6df35ef7c4ac9920d39fd119d8d52cb16a9fec202f3629e090"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Network: ClassTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 3 blocks, lines 400-1524. The bar is 400 significant lines; this is 312 over it, 1.78\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae49e204fc6b9ccbf522a55404d6851efbf141fa958ffb2ddd37c7a1bbe8fd74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/notifications.rs: FileTooLong \u2014 879 significant 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 379 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/notifications.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"668845c17e76b5a77c7044009a8e628f787ff7f92283eb6e6484293ad65a199c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.update: MethodTooLong \u2014 update runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b12a872118e11dc0b83455bbf6371ac6b56f64574a01e7b5415f7b23d6868b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gui/app.rs: FileTooLong \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 66% of them inside a single declaration: Shell (2 blocks, 202-959). The bar is 500 significant lines; this is 360 over it, 1.72\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1394c59e2841cc3f73b7be483d593320cc6f9c71452f48f0bf0e23916701e832"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glimpse_panel::applets::build: FunctionTooLong \u2014 glimpse_panel::applets::build 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":"crates/glimpse-panel/src/applets/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"963b9a9469b029572eedb5154ecd5cc6a8836f56cfa060df47ec8191b6d8fd53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Network.popover: MethodTooLong \u2014 popover runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/network/indicator.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09eecdc62cd7147f49675885cd559cb0872bd7c2da23a0ba3b6ba4329bc85ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: brightness/mod.rs: FileTooLong \u2014 821 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 321 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/brightness/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4634e46976e97539ba628d4c0ef7b565d22ecf6d36951b9e7c3cba6d5b7b1a70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: glimpse_sdk/elements.py: FileTooLong \u2014 818 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 318 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-py/glimpse_sdk/elements.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da39e5d33d3e953d6e1e7215445af04406572bfc940a3e38d38ecf63cc09d93"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 793 significant 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 60% of them inside a single declaration: App (3 blocks, 148-794). The bar is 500 significant lines; this is 293 over it, 1.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a486b2caf8ec362368f149fd85928e499744c5e353a6112a65653e7a84fc35b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Network.run: MethodTooLong \u2014 run runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"71709ddc705cc51d247989f926be3a3fd9f5fca24f1cf0cf83b4558df83692e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/calendar.rs: FileTooLong \u2014 770 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 270 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/calendar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca7e44abf19a474de645936d88c923f85f5e141d5116255b854c55d0ae7b9e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Display.popover: MethodTooLong \u2014 popover runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/display/indicator.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c062008c95cb03254446b649bdaf3880a30c55a35c9c1300a2854abe3e057bf6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Audio.popover: MethodTooLong \u2014 popover runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/audio/indicator.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd81f685b367b9d3d221c53b39b0b7ce0ae7901149a9a44c7410eb935a2e5fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: audio/pulse.rs: FileTooLong \u2014 739 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 239 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/pulse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff13924230c40db3681ce6084d54b791699f562204bcc227a504d11524faaa7d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 588 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 3 blocks, lines 132-906. The bar is 400 significant lines; this is 188 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d732c73c9b3b22361b5527aa9593b89d3780b6cb63cd057785e79d7ad5c980"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bluetooth/mod.rs: FileTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 235 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cbaa746c264783ad2b6865995e5798e5b71a886f9a2d31b0b2044811b52b35"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Run: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"0036145c63f6b5a3b6b439b5e0e573fa0fe373fd3d47ce41815610b4f1111281"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Clipboard.popover: MethodTooLong \u2014 popover runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/clipboard/indicator.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dc3898dc754dabf114ec0dc746f2883d966fe3fe8cd10f5186e669f25895bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glimpse_dbus::clients::idle::follow_provider: FunctionTooLong \u2014 glimpse_dbus::clients::idle::follow_provider runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/idle.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae20ef17ddd3fa4ae0be4cf2ca66b061f762735cf42608fc10f479d1f66019b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Shell: ClassTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 2 blocks, lines 202-959. The bar is 400 significant lines; this is 167 over it, 1.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7174698c25a3ec350733c4a9fda45f2f81dfba592dea15c8c7acbeeeae2b6159"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: glimpse_config::load: TooManyFunctions \u2014 42 free functions. The bar is 30 free functions; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/load.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2107b7e459490b30a30cd591a74364974924ef17c3d31929f1e5a24b482336f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Editor: ClassTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 40 methods, 2 blocks, lines 122-893. The bar is 400 significant lines; this is 149 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3160602c7ed511dab9a957af03a99407facbaf81653f992f83a0258c083f1a80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PanelServices.start_with_buses: MethodTooLong \u2014 start_with_buses runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/services.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a1eb7f04343c35bd8256e0ae1641db4cf10f13474791ff35647c1d58c3de3d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bluetooth.popover: MethodTooLong \u2014 popover runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/bluetooth/indicator.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d9534bab830b19c7b3cea020c7681e843bbe7145ba7bc1e840d777f8cfc98c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glimpsectl::run: FunctionTooLong \u2014 glimpsectl::run runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/main.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"334b9dd5af2fe4078b02686faacbd30bcdb12173405af77a9fb01936a478a0f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Editor: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"18227e31f8d393ffe63b4009a2b7ae8d35956a690d6d57b8efabeff4d9cf81e8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ShotToolbar: TooManyFields \u2014 40 stored fields beside 33 methods. The bar is 30 stored fields; this is 10 over it, 1.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_toolbar/imp.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa85a5bbf51052215da858d81b2728477b17bf5d57aae955a9d6425405d7209"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glimpse_shot::doc::wire::to_mark: FunctionTooLong \u2014 glimpse_shot::doc::wire::to_mark runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/wire.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"5418fa4a04f2244ad90ad9767c139e291f01d5df091d366a7ed670aaa4239513"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glimpsectl::commands::applets_author::new_with_catalog: FunctionTooLong \u2014 glimpsectl::commands::applets_author::new_with_catalog runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/applets_author.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31f7a226bc8a730578191d5253b377cf2d4149c9a92566456e85c69d637a49f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clients/weather.rs: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 137 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/weather.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"753b2489087b4888d206e6536a41609f90a13702eb8bf20d6520dcf3fc8feedf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Run.open: MethodTooLong \u2014 open runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3126cd31df9c9e0800e973ffb82f30be3a2efec015024a968427b9f17270d2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: removable/mod.rs: FileTooLong \u2014 625 significant 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 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/removable/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e01366f6245b2e1fcd1ef622aa2e71532d46a8fec08586faec796131c03ec0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cli.rs: FileTooLong \u2014 625 significant 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 125 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8501244d40df54ddcbf7afd31aaa09c0ce9b325c0928faac4e75a0695631f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/applets.rs: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/schema/applets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a08892e50f0b8a4a8c13049ef9d7c975675d3286b923152e8cc6bcac2b6bc91"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ResultFace: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5becae31c0f80d8af2845a6ff95142e2a09c452cb33dca04668e0d60da73b782"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 37 stored fields beside 18 methods. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65ec3819085bdf767ed1cd4df28a3da634b49ded4de19b3823100150b485a18"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: testing/tray.rs: FileTooLong \u2014 611 significant 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 111 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcfb6002ed98db1a986834380443380b44bf557c91a69707765946c1a6f13da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glimpse_services::services::audio::pulse::run: FunctionTooLong \u2014 glimpse_services::services::audio::pulse::run runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/pulse.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0520e2007b37b9fcc10d529c8d543235fbe8faadfc8134f21701936c6949987"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glimpse_shot::headless::capture: FunctionTooLong \u2014 glimpse_shot::headless::capture runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/headless.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8829ef40b3d838cb065ba27b77d80b8bae10b84ee8ccec0d35b615221e065170"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 477 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 3 blocks, lines 148-794. The bar is 400 significant lines; this is 77 over it, 1.19\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/app.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6bd647ca4dcf4fa538f0a8d62754ca2fc2aeab7a14d8fbedfe899884ddd9e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/package_manager.rs: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 63% of them inside a single declaration: PackageManager (2 blocks, 68-717). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/package_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2489f5d08a5e5b41301713a2d737d83a782983b6ef51c14096182fe991d3fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Audio.run: MethodTooLong \u2014 run runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/mod.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cef36eca562b763a3ac850e60eadea44ecc9f5ffd0a4899dd2a902aaf60725a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Network.build: MethodTooLong \u2014 build runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfa5b7205910840b7d07e7a24f2781667f6728f197d6502d49bed08e59b8fa2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LockStage: TooManyMethods \u2014 35 methods, declared across 2 files: lock_stage/mod.rs (23), lock_stage/imp.rs (12). The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lock_stage/imp.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7488ed3de9d372e3770b48d176912fcb9eb52f327caecda083d0186dbf00d002"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mpris/mod.rs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/mpris/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff08ccd01e01e9aea3d6a57e53d42036f65243682edd7d61daa7adde3bf22f1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.ingest: MethodTooLong \u2014 ingest runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/app.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7910cdaced616354b002f1f39575529aecb4574e6362ab3100c3dcb25f72ca22"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Network.handle: MethodTooLong \u2014 handle runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a09308e16b66c80003a7101b21d24a1a2ad454105b3f5ea8213724aebd6c476"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: App (3 blocks, 36-730). The bar is 500 significant lines; this is 65 over it, 1.13\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae871cfe10b4368dc095d6e5e467deee2780ebd16a46526cca688dad3a8436e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glimpse_lens::session::connect: FunctionTooLong \u2014 glimpse_lens::session::connect runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/session.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7332cbe1d3186790ededee9aef66e5511f9b5b223ebc5c4d88506f991402312"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResultFace.wire_pointer: MethodTooLong \u2014 wire_pointer runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c97f28698349264f9a9faa6b7c700bd2df081aedd878298570889af2531d569"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LockStage: TooManyFields \u2014 33 stored fields beside 35 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":"crates/glimpse-widgets/src/lock_stage/imp.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d290006d261b8e1ffba632135a1fca014b1de0effc39a028f1caffbe9be36e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ShotToolbar: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_toolbar/imp.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e464d0362c39ad78673abb1a9d04ac62cabb47b264d8c0f9d534a46f71f6612"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/panel.rs: FileTooLong \u2014 546 significant 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 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc5da3e3c816ebc3b32937df102a84c6b9625d5ba21cacb5ea807a9d92762f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: audio/indicator.rs: FileTooLong \u2014 545 significant 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 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/audio/indicator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48461c5550d2870efa8bc14e57aad808a22553608f589230e4159b57be1cf863"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: clipboard/indicator.rs: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: Clipboard (3 blocks, 36-731). The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/clipboard/indicator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee658769c8bcfd910b6c74149f7c2b95e0c4fcf267569401fab274d7e5b67fae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cli.rs: FileTooLong \u2014 544 significant 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 44 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a47eb78e1a6116207897b4c88faa59b0239b1e77a41b7133b5e18024201256e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/hyprland.rs: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 41 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-hyprland/src/hyprland.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5036bd38c4ddbb548b6883dded6a6b659aeb848631be77afa10f0e630eb14c36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: host.makeHost: FunctionTooLong \u2014 makeHost runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/host.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fcea89d5db717cb58801ed623726d83658ba67832c618b246188065c32d77e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExpanderRow: TooManyMethods \u2014 32 methods, declared across 2 files: expander_row/imp.rs (24), expander_row/mod.rs (8). The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/expander_row/imp.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"864a716ac86b572b0169998df0d10912b62accc0126f2003f6a575d816ad1dcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/provider.rs: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositors/src/provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6ec2042e247b1ca15ddfe0939889cab3af3f9021bc9d575831535a5e7f5eba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ResultFace.wire_keys: MethodTooLong \u2014 wire_keys runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"41813c6d1067d8e346a22efe3c01cbf0fe14ee9bbfeed58d1933e04cdf73a6ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OwnedPanel.start_with: MethodTooLong \u2014 start_with runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/dev.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9486cee760660f97a69db9e2f1178bbe21d4bdf5f4fca9a3bc3684b911f974"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 418 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 3 blocks, lines 36-730. The bar is 400 significant lines; this is 18 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/app.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cc79c76991748d93c6583f6eca88b60c75264e35a7efd6002e4e6ff1627f19"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Bluetooth: ClassTooLong \u2014 416 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 3 blocks, lines 277-952. The bar is 400 significant lines; this is 16 over it, 1.04\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1319194424b90c228cd273c395f42302b93867535802461b1bd67df5b432cea0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: glimpse_dbus::clients::follower::follow_snapshots: FunctionTooLong \u2014 glimpse_dbus::clients::follower::follow_snapshots runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/follower.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9042e9ca8e850af5789bba793e10a3210c9501d715dfd605702c1c34d1ca3238"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: applet/runtime.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb784ff8fa8bbe49a076c8fc3bff63fdf1e2c9957c8c533eecbbf72f36704ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: NetworkPopover: TooManyFields \u2014 31 stored fields beside 30 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/network_popover/imp.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9247851f1f37ac202eb506450a831c5fc1e07c777c4b67666eb70802cbb2fc23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/surface.rs: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/surface.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1930d855ff033f748513ae02afa751c3a2c586e2cac20fdd06f710f1bd7b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/glimpse-widgets/src/clipboard_list/imp.rs:37-55 | crates/glimpse-widgets/src/clipboard_popover/imp.rs:55-78 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/clipboard_list/imp.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b33621a06db0a739d19253981d1741776ad46ffc574c1a44ff3b7220ba1326"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/glimpse-calendar/src/main.rs:31-76 | crates/glimpse-idle/src/main.rs:33-92 | crates/glimpse-settings-daemon/src/main.rs:32-83 | crates/glimpse-sunset/src/main.rs:32-92 | crates/glimpse-weather/src/main.rs:30-77 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/main.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1053621747601001e1021a2a54775411124b1ab71164f19f76d5a9cf98b35d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/glimpse-calendar/src/main.rs:19-29 | crates/glimpse-idle/src/main.rs:20-31 | crates/glimpse-sunset/src/main.rs:19-30 | crates/glimpse-weather/src/main.rs:18-28 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/main.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c832e7caa0a07937708ea2cd8390f46cf614d3a8b3590afe4e580a773433bf6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (117 corresponding lines): crates/glimpse-lens/src/lens.rs:182-298 | crates/glimpse-lens/src/session.rs:323-463 \u2014 These two members are one piece of code written twice and then edited apart: 117 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c624d4658819088dbca5107a1753fb55972f7fa55e425792703397abcfa632f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): crates/glimpse-shot/src/gui/overlay.rs:216-287 | crates/glimpse-shot/src/gui/result.rs:1024-1091 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"964aac9a5097ef12e1eaf397a504a39aab8e4243e3aa601e1be6087e192b462f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/glimpse-services/src/services/battery.rs:447-498 | crates/glimpse-services/src/services/session_actions.rs:273-312 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/battery.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1b8e5af8c4e5133b2eea5b6c4f4bfc776b7e5152df57aa23a1e68e83af0e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/glimpse-lens/src/lens.rs:48-86 | crates/glimpse-lens/src/session.rs:138-176 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd03608533e66d534396ac283446075f999ff6bb680375341f06694c22ce892a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/glimpse-widgets/src/bluetooth_popover/imp.rs:130-174 | crates/glimpse-widgets/src/network_popover/imp.rs:152-217 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/imp.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"670871beebedb6aab331c7639e4c08666778aa430144dbc0b387e40c1f233777"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): crates/glimpse-lens/src/lens.rs:96-142 | crates/glimpse-lens/src/session.rs:186-229 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37128cf521a27a2f30763df2543f85cc3ecd9ecd4177f02808c9fc32ae9598d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/glimpse-widgets/src/bluetooth_popover/mod.rs:234-264 | crates/glimpse-widgets/src/network_popover/mod.rs:321-356 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"37845caa614c8745c4cb176b6926cad78c0decd36c11a085339a8673dcc00e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/glimpse-compositor-hyprland/src/hyprland/outputs.rs:193-228 | crates/glimpse-wayland/src/wire.rs:123-152 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-hyprland/src/hyprland/outputs.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c81205f2b011745493bb806f62a569b3b27fbfeaf7ac6d68c15e3c65a2e7ad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/glimpse-services/src/services/brightness/mod.rs:367-398 | crates/glimpse-services/src/services/brightness/mod.rs:423-454 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/brightness/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"772c09323ad6e81627f433b4dad4c7a58b7c340093eb2ae11dbd61981a411b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/glimpse-services/src/services/bluetooth/source.rs:95-124 | crates/glimpse-services/src/services/network/source.rs:117-140 | crates/glimpse-services/src/services/removable/source.rs:90-113 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"019f87e77f0930c4c72643e106f6a1309d78b7849713f553fa96391d1cc28ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/glimpse-notifications/src/main.rs:28-54 | crates/glimpse-panel/src/main.rs:34-64 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/main.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"70dc67e0c2b6cc515aa5a11468393fb17c21c01c8a8bf8a6aaef62e302edb944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): crates/glimpse-services/src/services/bluetooth/mod.rs:683-713 | crates/glimpse-services/src/services/removable/mod.rs:436-472 | crates/glimpse-services/src/services/removable/mod.rs:482-516 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ca437b7a7588e5333c886b5ccb82171c8ac3f74b3c8f9023a96de52fa87110"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/glimpse-services/src/services/bluetooth/source.rs:72-93 | crates/glimpse-services/src/services/network/source.rs:94-115 | crates/glimpse-services/src/services/removable/source.rs:67-88 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"56423f4005f8c68c4e323634a3febbf4b2b04bddc6860401b9c7f9ffecc95a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): crates/glimpse-widgets/src/bluetooth_popover/imp.rs:102-128 | crates/glimpse-widgets/src/display_popover/imp.rs:99-127 | crates/glimpse-widgets/src/network_popover/imp.rs:122-150 | crates/glimpse-widgets/src/notifications_popover/imp.rs:57-79 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/imp.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bd208432488a58ac7dea77e7c7faa63df5157c8bb0dfeddecc74ab3815825d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/glimpse-widgets/src/bars.rs:141-169 | crates/glimpse-widgets/src/sparkline.rs:171-204 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bars.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8d989f76d1378723732a80ce7a56a6c5db791bbc80eec099398c5056a859c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/glimpse-widgets/src/mpris_popover/imp.rs:81-98 | crates/glimpse-widgets/src/popover_shell/mod.rs:134-152 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/mpris_popover/imp.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f24158c11128e12f81f70e5fb64fd95c85610a14f73550df19bc18feb805cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/glimpse-agents/src/agents.rs:37-66 | crates/glimpse-agents/src/obex/mod.rs:319-344 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/agents.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06453254a8c75ecd38f9784e9788d5615a1f428b90cf1b7e0664271707b6d6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/glimpse-widgets/src/choice_list/mod.rs:63-92 | crates/glimpse-widgets/src/player_list/mod.rs:67-88 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/choice_list/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c0b055d964bf8d6300a379c515de90865ae993fd2ab750aa85a4d6f92d105c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/glimpse-services/src/services/audio/pulse.rs:550-572 | crates/glimpse-services/src/services/audio/pulse.rs:574-596 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/pulse.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ad1fe2c0094996765744e00a8bb5457cbce33b9f929a6de3966d9de80476ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/glimpse-services/src/services/removable/mod.rs:825-840 | crates/glimpse-services/src/services/removable/mod.rs:842-862 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/removable/mod.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"f504c51c39c9e8fd60249bbb929972c5d6a229caba2049b6cfe91e3a2f9b2045"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/glimpsectl/src/commands/applets_author.rs:119-142 | crates/glimpsectl/src/commands/package_manager.rs:102-125 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/applets_author.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8a5e91ce8f6c3e2d5eb0e35a27c6deb56dd14086148162901b362c0a2cb842"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/glimpse-services/src/services/weather/met_no.rs:242-262 | crates/glimpse-services/src/services/weather/place.rs:87-115 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/weather/met_no.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78708e5f1d00d7d1bac722799ae33409a474cac5faa8bdedb79bdcaa141db78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/glimpse-services/src/services/bluetooth/source.rs:160-177 | crates/glimpse-services/src/services/network/source.rs:188-205 | crates/glimpse-services/src/services/removable/source.rs:126-143 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4238888eddb15ec8e786c3a0e03a9eedf902cb826765b3fff08223b2f559564"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/glimpse-widgets/src/inhibitor_list/mod.rs:99-116 | crates/glimpse-widgets/src/privacy_popover/mod.rs:86-105 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/inhibitor_list/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7654a2cf283e2d2420ced9e553369c0c2c035f3cf97d99b1fa3645c29a5d975c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/glimpse-widgets/src/raster.rs:155-170 | crates/glimpse-widgets/src/raster.rs:172-188 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/raster.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37cbd75aae7986eadf371f6e4f7bd9f5cbee93594df4a1b3eff8db1b782ca86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/glimpse-services/src/services/audio/pulse.rs:869-888 | crates/glimpse-services/src/services/audio/pulse.rs:925-947 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/pulse.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9eb191dad21061ce626c2603c439432708a4cd1bbbff569db195844f146ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/glimpse-services/src/services/bluetooth/mod.rs:405-420 | crates/glimpse-services/src/services/network/mod.rs:582-602 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c91dfc847ec03ca4bb753978a0fa193e5501712ae5bd41626c4d856e0a2644"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/glimpse-shot/src/notify.rs:209-227 | crates/glimpse-wallpaper/src/portal/notify.rs:111-125 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/notify.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5d0cda5db13fb445a772d97f3ff2c75930e7af617c711e11d169a5dc321077"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/glimpse-panel/src/applets/audio/indicator.rs:310-330 | crates/glimpse-panel/src/applets/bluetooth/indicator.rs:293-313 | crates/glimpse-panel/src/applets/printing/indicator.rs:109-133 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/audio/indicator.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a0811d7f98167b0054a1fedae19d163f31108b07ac1439f8af24c97daec96b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/glimpse-shot/src/doc/history.rs:108-128 | crates/glimpse-shot/src/doc/history.rs:130-150 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/history.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"127419c06eab5d4a4cb24572cfa8ed801c832c20901c2a045b1fdd48bbb33abc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-services/src/services/exec/launcher.rs:61-74 | crates/glimpsectl/src/commands/applets.rs:185-198 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/launcher.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"564cd3162e5d792ad3eee1b6f816a8bd665b9e656e0646089d0853685425391c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/glimpse-shot/src/doc/history.rs:160-175 | crates/glimpse-shot/src/gui/canvas.rs:689-700 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/history.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8662705b73d96ff85e8acbc1b367be8ca39d4711dd87ba464cb6e65e9f5eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/glimpse-widgets/src/mpris_popover/imp.rs:102-116 | crates/glimpse-widgets/src/popover_shell/imp.rs:182-196 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/mpris_popover/imp.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6912e514433de6207d67e2f05cd4645436f0bb1b2e2564cc5df6558652c07145"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/glimpse-widgets/src/popover_shell/imp.rs:207-220 | crates/glimpse-widgets/src/section/imp.rs:132-142 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/popover_shell/imp.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c8ad45261ecd50db1f2566b2ac3808a64267fd6b1dfdabe1d5f6f18aa3f81c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/glimpse-services/src/services/bluetooth/mod.rs:369-390 | crates/glimpse-services/src/services/removable/mod.rs:243-264 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b2228f21a185fe4d9ae2a5b0b0dbde2ff6841cb5b75968e61b41583d7b1f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): crates/glimpse-widgets/src/calendar_popover/imp.rs:46-61 | crates/glimpse-widgets/src/idle_popover/imp.rs:57-72 | crates/glimpse-widgets/src/power_popover/imp.rs:92-111 | crates/glimpse-widgets/src/shot_capture_page/imp.rs:49-66 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar_popover/imp.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f9db21c92a750be9831027bdbe15e2d28b9215cdf4ba64d79f8de96d147a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/glimpse-services/src/services/brightness/mod.rs:512-534 | crates/glimpse-services/src/services/brightness/mod.rs:563-581 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/brightness/mod.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cd24dcd47c1769f6c1a9161cec4ebbf9e49b39a2766580b775b67b8198859b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/glimpse-lock/src/app.rs:1358-1372 | crates/glimpse-notifications/src/app.rs:1041-1056 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"625ca44903056410730eb177d7006be204cfd13b73bb56e484a3e2475795e9cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/glimpsectl/src/commands/notifications.rs:50-73 | crates/glimpsectl/src/commands/sunset.rs:37-60 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/notifications.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ceed27377c91cd4fa6d44e2fb197431c948694576edcad9cb1cae7d3663a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/glimpse-services/src/services/places/sources.rs:175-188 | crates/glimpse-services/src/services/places/sources.rs:190-203 | crates/glimpse-services/src/services/places/sources.rs:205-217 | crates/glimpse-services/src/services/places/sources.rs:219-231 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/places/sources.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3019952178b9f83e82afb9c741bae060c4c7a7f2441ee6e6621911789e6b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-calendar/src/services.rs:17-34 | crates/glimpse-weather/src/services.rs:17-30 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/services.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0a352baf86e3ebdd047fdcea3e8b27a7c53511da0ea7617beee32f5e9df6fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/glimpse-services/src/services/battery.rs:630-642 | crates/glimpse-services/src/services/battery.rs:644-657 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/battery.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bf89c9b93634c159abca4b0feeede63a7513e439a3b470de1967b2af1570fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-widgets/src/entry_row/imp.rs:149-168 | crates/glimpse-widgets/src/player_list/row.rs:62-75 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/entry_row/imp.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5361ee893407d0d924a36058266a8816a97e7c217bb460d9761f511945802d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/glimpse-widgets/src/calendar/imp.rs:246-258 | crates/glimpse-widgets/src/indicator_group/imp.rs:33-45 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar/imp.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d381db54dbc3e6aaf6ac596e43d22bf9fb87b5799b4f19a312a1362e5491ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-panel/src/applets/pager/mod.rs:235-248 | crates/glimpse-panel/src/applets/pager/mod.rs:250-267 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/pager/mod.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c82951faf15a9ae9238dd65d043c0caa6a0967d894a885e7da6659ade77f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/glimpse-widgets/src/places_popover/mod.rs:108-120 | crates/glimpse-widgets/src/places_popover/mod.rs:122-134 | crates/glimpse-widgets/src/places_popover/mod.rs:136-148 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/places_popover/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f19cea259a5c92c91e39261390ec7a220b92b80afb74689da215294e62b08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/glimpse-lens/src/lens.rs:307-319 | crates/glimpse-lens/src/session.rs:496-507 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1dba4dbf6de985e9872ce860c38443e8b1865f5a386228df6fec14602344c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/glimpse-panel/src/applets/places/render.rs:18-29 | crates/glimpse-panel/src/applets/removable/render.rs:25-39 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/places/render.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40d2b7a9309ec93669fdbed7e1e94157a1ae15156a2a2f1affb7f13e15e6f54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/glimpse-widgets/src/shot_capture_page/mod.rs:254-268 | crates/glimpse-widgets/src/shot_result_page/mod.rs:98-113 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_capture_page/mod.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc46d5c237ed68fc6ef234a2e8faadeed70c92bb79283910aee0563d2ce8689"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/glimpse-widgets/src/bars.rs:252-262 | crates/glimpse-widgets/src/bars.rs:293-307 | crates/glimpse-widgets/src/sparkline.rs:354-363 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bars.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f39d5f0ba6110ab4bbda91f5f71b9e0bb5405698367ab9ddc22ab8fd0cb4f9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/glimpse-services/src/services/tray/watcher.rs:46-59 | crates/glimpse-services/src/services/tray/watcher.rs:66-78 | crates/glimpse-services/src/services/tray/watcher.rs:85-97 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/tray/watcher.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb39908e575049ebcd2101fda531f69fb34d9366880ce24395f686c0b710bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-widgets/src/notifications_popover/mod.rs:288-301 | crates/glimpse-widgets/src/notifications_popover/mod.rs:306-319 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notifications_popover/mod.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87f14e2da79a8c866c49b23c50931bd7b6333c1c5a9c7e62d647a1fdb3e1235"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-widgets/src/container/imp.rs:76-89 | crates/glimpse-widgets/src/container/imp.rs:91-104 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/container/imp.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e781c6f579e391e8ac499185be8cc85fa0f14941f7a2d7a2c36e36cae39515"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-dbus/src/testing/geoclue.rs:200-215 | crates/glimpse-dbus/src/testing/geoclue.rs:217-230 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/geoclue.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2daaf7439c4b327b5923729d2e92ebd6950b5a3dec8a63dd47d4a483a9f9335c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/glimpse-widgets/src/indicator/mod.rs:73-85 | crates/glimpse-widgets/src/indicator/mod.rs:87-98 | crates/glimpse-widgets/src/notification_header/mod.rs:25-36 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/indicator/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fc5eda688d8fded2aefcc185092e32013a93b066954d02891549604547dfca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/glimpse-widgets/src/places_popover/imp.rs:81-92 | crates/glimpse-widgets/src/player_list/imp.rs:26-38 | crates/glimpse-widgets/src/removable_popover/imp.rs:81-96 | crates/glimpse-widgets/src/tray_strip/imp.rs:37-53 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/places_popover/imp.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb6c9c99feb6f83aa96bfa35cc463b16a71ee4fec5d9723b8a5f46637d9a489"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/glimpse-widgets/src/printing_popover/mod.rs:103-115 | crates/glimpse-widgets/src/privacy_popover/mod.rs:70-82 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/printing_popover/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"54002dfd7a5af351e27b1bd84462460c4607de8a59f5e4235260f3aa4aeb4620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/glimpse-notifications/src/app.rs:608-622 | crates/glimpse-notifications/src/app.rs:624-640 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/app.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed913f63ae32df8360746e757a6dbd07164e4a338a18e4a6e910cf34fd373879"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/glimpse-panel/src/applets/audio/indicator.rs:283-299 | crates/glimpse-panel/src/applets/bluetooth/indicator.rs:268-282 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/audio/indicator.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4d7d720b417d13b5f5306b7d543163d939316811983dca8c70bb6b924dcf51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/glimpse-idle/src/services.rs:176-194 | crates/glimpse-idle/src/services.rs:279-294 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/services.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f0cfbd8cbb19d5b7717cd8322e524e7377ce670092e703a656a323062fb6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/glimpse-widgets/src/shot_banner/mod.rs:26-37 | crates/glimpse-widgets/src/shot_banner/mod.rs:39-50 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_banner/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24a3503b079de5a574cdc9ec26131d5642586c5cced61b2b96d30fc2c088375"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/glimpse-agents/src/app.rs:766-780 | crates/glimpse-lens/src/overlay.rs:186-198 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/app.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3560f71e69c115d985e4ef5598335336b2c652b115a65717163129e5e99e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/glimpse-widgets/src/bluetooth_popover/mod.rs:34-46 | crates/glimpse-widgets/src/network_popover/mod.rs:31-45 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ea64e23a01aa2af3831382db7dcced734e9b404bda8a3bc648b2ad83fc3175"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): crates/glimpse-widgets/src/entry_row/imp.rs:181-188 | crates/glimpse-widgets/src/hero/imp.rs:99-106 | crates/glimpse-widgets/src/notification_card/imp.rs:273-283 | crates/glimpse-widgets/src/row/imp.rs:120-127 | crates/glimpse-widgets/src/slider_row/imp.rs:322-329 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/entry_row/imp.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3840d288cbd0dd5884e5d07af8a70444d9f3675a0559019d1dbcdcfd406d515c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/glimpse-widgets/src/bars.rs:283-291 | crates/glimpse-widgets/src/sparkline.rs:464-472 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bars.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f147443ce52ca498b1db8132ed7328fc0cb314e51af9926bbb59668496aa92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/glimpsectl/src/commands/idle.rs:69-87 | crates/glimpsectl/src/commands/settings.rs:124-142 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/idle.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57f78799d1d95886c75b2d7898ed721f28352557f0030feaa2fd611aaa4f4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/glimpse-panel/src/applets/printing/render.rs:125-163 | crates/glimpse-panel/src/applets/printing/render.rs:324-344 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/printing/render.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8943be3f7fc15ec4c76144d514f63b1b802ceb375b967fecbecabb96f9306e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sdk/sdk-rs/src/widget.rs:123-136 | sdk/sdk-rs/src/widget.rs:182-195 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-rs/src/widget.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e740d1eb22ee7ca2bb0bbb522f4356cdc58722eb12cfd78da386d7db9bf0be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/glimpse-services/src/services/battery.rs:316-326 | crates/glimpse-services/src/services/battery.rs:334-344 | crates/glimpse-services/src/services/session_actions.rs:233-243 | crates/glimpse-services/src/services/session_actions.rs:250-260 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/battery.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0df4667147eec5b0b78290724a623291c836a0eb3395af792c5fd1ed7dea7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/glimpse-services/src/services/calendar.rs:459-471 | crates/glimpse-services/src/services/places/mod.rs:254-266 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/calendar.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"09259c18cb360fcde7013cc7ed0c6c5360b1abe603bc7512b3e556693a587be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-widgets/src/player_list/mod.rs:93-106 | crates/glimpse-widgets/src/workspace_list/mod.rs:123-136 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/player_list/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd33083752bdb42b279b94786cf7f7c9d77491c681dac47e715c38ef2cb8b3d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/glimpse-services/src/services/bluetooth/source.rs:56-70 | crates/glimpse-services/src/services/network/source.rs:56-70 | crates/glimpse-services/src/services/removable/source.rs:51-65 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a31d08fbc29f33b13079b1cc2a3508d49686b58b2e77fe88fa996f242506a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/glimpse-agents/src/bluetooth/mod.rs:199-206 | crates/glimpse-agents/src/network/mod.rs:289-301 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/bluetooth/mod.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86f7b77d38644c2e16d90e801ca18cfb59c4d3c4dd132875433d390f6958afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/glimpse-dbus/src/testing/tray.rs:737-748 | crates/glimpse-dbus/src/testing/tray.rs:773-784 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfece9337eebfec044a3c93574f12587cdbaf5115bb558482c7216d80828229"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-services/src/services/bluetooth/source.rs:216-229 | crates/glimpse-services/src/services/network/source.rs:268-281 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f095154b7da2bf855c05309b0cf6722ce814259789950f0a886eb3964e681310"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/glimpse-widgets/src/slider_row/imp.rs:83-95 | crates/glimpse-widgets/src/slider_row/imp.rs:99-110 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/slider_row/imp.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"040283a4393de527178a17598f20b1ee68f2b909eb377ad5abbb632035e96d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-widgets/src/display_popover/imp.rs:77-91 | crates/glimpse-widgets/src/power_popover/imp.rs:71-84 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_popover/imp.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f69a03ea086f9c0615864f87838912caa028fc7c92722a006415ce22a0222f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/glimpse-panel/src/applets/places/indicator.rs:153-166 | crates/glimpse-panel/src/applets/removable/indicator.rs:197-207 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/places/indicator.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6eb27183053efdf1498c22fa6088d7dd6f0bbc486540168d9642765e5182014"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/glimpse-widgets/src/bars.rs:327-339 | crates/glimpse-widgets/src/sparkline.rs:434-444 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bars.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf3214395ff0c6ceefc012c62879f5afdf721c816f1e599e974e6bb2719522d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/glimpse-agents/src/bluetooth/mod.rs:239-251 | crates/glimpse-agents/src/obex/mod.rs:469-481 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/bluetooth/mod.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ceda58220228758c8db3de98e4dce4db3ea69fc7a66384518cb5e3d41809c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/glimpse-agents/src/main.rs:34-44 | crates/glimpse-lock/src/main.rs:46-54 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/main.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"71763a42ccb50e799690ffa1e6b3b6705a053657f8e21493bfd556aa70cf12b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/glimpse-widgets/src/network_popover/mod.rs:56-68 | crates/glimpse-widgets/src/network_popover/mod.rs:110-121 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/network_popover/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62c2a1df5e8d717b15bd7f7a18e11bf704c0aafd5ac8b7686832d6fc7faa8b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-widgets/src/shot_toolbar/mod.rs:24-37 | crates/glimpse-widgets/src/shot_toolbar/mod.rs:39-55 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_toolbar/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d08213646d050cdbedc8d3b6c8b67e16c9b553a3a66954d082744fa3478bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/glimpse-notifications/src/app.rs:568-582 | crates/glimpse-notifications/src/app.rs:584-597 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/app.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3b1692155ae3566a149bd9c57f4a9c73919b7a6798ba5ac27f072c05f6fd1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 10\u002B corresponding lines): crates/glimpse-services/src/services/bluetooth/source.rs:126-136 | crates/glimpse-services/src/services/bluetooth/source.rs:138-148 | crates/glimpse-services/src/services/network/source.rs:142-152 | crates/glimpse-services/src/services/network/source.rs:154-163 | crates/glimpse-services/src/services/network/source.rs:165-174 | crates/glimpse-services/src/services/network/source.rs:176-186 | crates/glimpse-services/src/services/removable/source.rs:115-124 \u2014 These 7 members are one piece of code written 7 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc05576fec717f132e1e4fa17b7bed8044609ebc63477b73113886b977cb54a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/glimpse-services/src/services/exec/mod.rs:323-336 | crates/glimpse-services/src/services/exec/mod.rs:355-367 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bad92cdcadeaa2cfe6c36610376495ffecd120092b2b61375aa0e999d751d4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/glimpse-services/src/services/audio/pulse.rs:598-609 | crates/glimpse-services/src/services/audio/pulse.rs:611-622 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/pulse.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8ce6f62252b3e2a8d17d23d609ffda34675cd054929705d099100062fb6b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/glimpse-agents/src/main.rs:22-32 | crates/glimpse-lock/src/main.rs:33-44 | crates/glimpse-notifications/src/main.rs:16-26 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/main.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7902ce060f515b65e162ad28737716e4064aa76bf751b72224abecf678c889"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/glimpse-panel/src/applets/audio/indicator.rs:668-681 | crates/glimpse-panel/src/applets/places/indicator.rs:119-131 | crates/glimpse-panel/src/applets/removable/indicator.rs:166-178 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/audio/indicator.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3c4b6375cd1aaf7e3359f5bf1c5d6df621885a7b9655f80ddfa06946ce8f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/glimpse-widgets/src/display_list/imp.rs:39-48 | crates/glimpse-widgets/src/pager/imp.rs:28-38 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_list/imp.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69858d5eb8a027044dc117b99a3b747a3d89b1d2d054ef615c8558b045a6e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sdk/sdk-rs/src/elements.rs:297-305 | sdk/sdk-rs/src/elements.rs:341-350 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-rs/src/elements.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"328acdef98aaba7777fe4ae483c5849b661dcc8888f1a507446140cb28597221"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/glimpse-services/src/services/exec/launcher.rs:283-291 | crates/glimpse-services/src/services/exec/launcher.rs:293-301 | crates/glimpse-services/src/services/exec/launcher.rs:303-311 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/launcher.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6c0c12103cca7cbadf07f94c717209c21d0d86c9452dedea30c7e259499a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/glimpse-widgets/src/password_prompt/imp.rs:115-123 | crates/glimpse-widgets/src/workspace_name_popover/imp.rs:47-57 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/password_prompt/imp.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7173873a734dc061789fcd1652c6d459b8239ad9995c97fcc66d2c7da02f8d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/glimpse-panel/src/applet/mod.rs:156-164 | crates/glimpse-panel/src/applets/audio/indicator.rs:340-348 | crates/glimpse-panel/src/applets/display/indicator.rs:404-412 | crates/glimpse-panel/src/applets/privacy/indicator.rs:163-171 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f2c70607988f0f8f46c06dd2dbeefa998eca357a490eb084629e5fb2d489f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 10\u002B corresponding lines): crates/glimpse-widgets/src/entry_row/imp.rs:53-63 | crates/glimpse-widgets/src/expander_row/imp.rs:63-72 | crates/glimpse-widgets/src/expander_row/imp.rs:76-85 | crates/glimpse-widgets/src/expander_row/imp.rs:89-98 | crates/glimpse-widgets/src/expander_row/imp.rs:159-168 | crates/glimpse-widgets/src/slider_row/imp.rs:49-59 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/entry_row/imp.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2b6e352e1e87258c612c03becff09dc56bbf2be3e1ccc4cf8b15f37353caf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): sdk/sdk-py/glimpse_sdk/elements.py:136-152 | sdk/sdk-py/glimpse_sdk/elements.py:375-392 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-py/glimpse_sdk/elements.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ed1408264ee6b47cf601391d795ef6842da0da95c5f47b7132fc602e9f9a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/glimpse-idle/src/idle.rs:197-212 | crates/glimpse-idle/src/idle.rs:214-226 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/idle.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f835700fae21e3d34588381b7795e120d82f46922783c56c0d5f4d5cdeb1d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-widgets/src/hero/imp.rs:48-54 | crates/glimpse-widgets/src/notification_header/imp.rs:52-58 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/hero/imp.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ffcd6c9edee8f3a7687fd2d6836c08e33aa5ce9e92b3d6c83c95a323a40ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/glimpse-widgets/src/places_popover/mod.rs:183-192 | crates/glimpse-widgets/src/printing_popover/mod.rs:130-140 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/places_popover/mod.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"8373444cffd3a3b16f1e838e8fe7ed5cf520ce828a91d61c62327b5393b6a535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/glimpse-widgets/src/session_popover/imp.rs:49-58 | crates/glimpse-widgets/src/session_sheet/imp.rs:105-115 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/session_popover/imp.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e84d461fb66acb489ce268cba03c5a3485e23d8f8d5a5aab3196ad0f1cbd01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/glimpse-panel/src/applet/popover.rs:144-153 | crates/glimpse-services/src/services/exec/launcher.rs:84-93 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/popover.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"213914bf04364bdc8dba704d3ae5cbe5f9f12c17f5c8d9cd0ed91251388e9e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/glimpse-panel/src/applets/next_event/mod.rs:30-40 | crates/glimpse-panel/src/applets/notifications/indicator.rs:48-58 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/next_event/mod.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a3b1eb3b78e330780bf98a456bf1b39488d435833d8ad6bb450c59fb359eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/glimpse-services/src/services/audio/pulse.rs:896-905 | crates/glimpse-services/src/services/audio/pulse.rs:955-967 | crates/glimpse-services/src/services/audio/pulse.rs:975-989 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/pulse.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5e2122a94281d4135fbe3f61d0dd9acee915b5c75d9646fbe1c589df6e657"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/glimpse-services/src/services/bluetooth/source.rs:150-158 | crates/glimpse-services/src/services/network/source.rs:220-228 | crates/glimpse-services/src/services/network/source.rs:230-238 | crates/glimpse-services/src/services/removable/source.rs:182-194 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abb25d1769d8ba1e9dd4840cb3e20f4d9cde3bd0495dbfeaf7dc7904c69b7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/glimpse-widgets/src/inhibitor_list/imp.rs:28-37 | crates/glimpse-widgets/src/shot_window_list/imp.rs:43-52 | crates/glimpse-widgets/src/workspaces_popover/imp.rs:37-46 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/inhibitor_list/imp.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b1758607a07ab53d15cc7724b5e1f9eae908c986b8f77a9fec59fcce3d7cd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/glimpse-widgets/src/audio_popover/mod.rs:239-247 | crates/glimpse-widgets/src/audio_popover/mod.rs:376-385 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/audio_popover/mod.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"786a1071ad19a76da1e1a2dcb7e74f39ad2f5865fd1fc300419ca7532d79f269"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/glimpse-lock/src/app.rs:1348-1356 | crates/glimpse-notifications/src/app.rs:1058-1066 | crates/glimpse-panel/src/app.rs:456-464 | crates/glimpse-wallpaper/src/app.rs:173-183 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbc4b86cbe75f9ce99e31baa64d5013cac46813e880b5d9e53e31701c3a3575"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-services/src/services/places/sources.rs:17-23 | crates/glimpse-wallpaper/src/portal.rs:71-77 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/places/sources.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b7ec5fcd9efd8e4900d1068ae7a1577c1cf6de5f17924e7dcad86f50cf869d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/glimpse-shot/src/portal.rs:90-101 | crates/glimpse-wallpaper/src/portal.rs:194-207 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/portal.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"265ca42b89b0e32ea6125f87e6fb553d516e708662312368bddd95d4d57a678b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/glimpse-shot/src/gui/canvas.rs:1102-1107 | crates/glimpse-shot/src/gui/canvas.rs:1271-1277 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"104da8e1a2feff69a208c582919905ef89f1fb75037fe4ad3f16346d1f3f54dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 8\u002B corresponding lines): crates/glimpse-widgets/src/choice_list/imp.rs:39-46 | crates/glimpse-widgets/src/clipboard_list/imp.rs:57-64 | crates/glimpse-widgets/src/display_list/imp.rs:50-57 | crates/glimpse-widgets/src/forecast/imp.rs:65-73 | crates/glimpse-widgets/src/inhibitor_list/imp.rs:39-46 | crates/glimpse-widgets/src/player_list/imp.rs:40-47 | crates/glimpse-widgets/src/source_list/imp.rs:39-46 | crates/glimpse-widgets/src/workspace_list/imp.rs:42-49 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/choice_list/imp.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"090f7a04d26672fc95473ffc1a1d708c28d19cacc31ca1ce9deb099847efccb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-widgets/src/range_bar.rs:97-103 | crates/glimpse-widgets/src/shot_region/imp.rs:227-233 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/range_bar.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"783e89c906167d77499d7eab47848dfce93a76921b8d4dc7fa4b0723b341c633"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/glimpse-shot/src/gui/app.rs:918-925 | crates/glimpse-shot/src/gui/app.rs:927-934 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8adaced412be32aec8d9e02295d0a46d3ff4dc4279efbc36902592f8f0e49f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/glimpse-widgets/src/display_popover/mod.rs:193-203 | crates/glimpse-widgets/src/display_popover/mod.rs:382-392 | crates/glimpse-widgets/src/player_list/mod.rs:108-119 | crates/glimpse-widgets/src/source_list/mod.rs:99-110 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_popover/mod.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"6957fb7116173f6ef01c08cca7dc6211a70ffbe05216d3ca3a7535c3b312fedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/glimpse-panel/src/applets/bluetooth/indicator.rs:34-43 | crates/glimpse-panel/src/applets/network/indicator.rs:222-232 | crates/glimpse-panel/src/applets/printing/indicator.rs:33-42 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/bluetooth/indicator.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a8c3292050193e447e27c5ea6305b8418297b84c2abbaa1d4cad140b54dcfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/glimpse-panel/src/applets/clock/popover.rs:37-42 | crates/glimpse-widgets/src/calendar/imp.rs:221-226 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/clock/popover.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8946d76cdaa98489fba19e04abb0169c234b54749e1f936a6ea319327613aff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/glimpse-panel/src/applets/clipboard/indicator.rs:513-521 | crates/glimpse-panel/src/applets/display/indicator.rs:59-67 | crates/glimpse-panel/src/applets/mpris/mod.rs:62-71 | crates/glimpse-panel/src/applets/power/mod.rs:184-194 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/clipboard/indicator.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"127b559d27dfb65252d117938f33b6f237f6f2ccb0eba603e867ba9b92455e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/glimpse-widgets/src/entry_row/imp.rs:80-88 | crates/glimpse-widgets/src/row/imp.rs:225-234 | crates/glimpse-widgets/src/row/imp.rs:279-287 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/entry_row/imp.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecd071dcce844baeda7a5b89c810b33a3dcfbfa8b1c8b1cae8f9952f37f2320"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/glimpse-widgets/src/expander_row/imp.rs:50-59 | crates/glimpse-widgets/src/row/imp.rs:178-186 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/expander_row/imp.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac96f280fbaaf3ce8d17b64ed74a7a066afd3590dba5a7d775b1f3ef3c04141"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/glimpse-widgets/src/expander_row/imp.rs:216-225 | crates/glimpse-agents/src/dialog/imp.rs:74-83 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/expander_row/imp.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34b9f6033da3f7c96e50d2bbb5a2b64e77e46861c2b95e31ed2212b2705e29b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/glimpse-calendar/src/services.rs:66-76 | crates/glimpse-weather/src/services.rs:65-73 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/services.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"82cd9fbd0ea5cc813048f6bd70252d85fadd16397be9d07bcec5ef86ab28562d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/glimpse-widgets/src/artwork.rs:231-243 | crates/glimpse-widgets/src/raster.rs:580-592 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/artwork.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1405f05e0864c54b1653a6ba837cd96b3ef7ad752510c0e77b8bbaa6c1ead8ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-widgets/src/audio_popover/mod.rs:461-467 | crates/glimpse-widgets/src/places_popover/mod.rs:195-201 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/audio_popover/mod.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7fa6c17085d35d902568304a288a124baee76a0cf5688b842f17a8129bde24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/glimpse-services/src/gamma.rs:57-66 | crates/glimpse-services/src/selection.rs:107-116 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/gamma.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb432fd98ca761c2189e47f3052afd7a379fee8058dd065d3bcbd1456f8008d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/glimpse-services/src/services/mpris/mod.rs:586-591 | crates/glimpse-services/src/services/session.rs:134-139 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/mpris/mod.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a76b73fd65945bb23d48dc3736c6f26730b99f197f9e97dd2440fcab093aa25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/glimpse-widgets/src/bluetooth_popover/mod.rs:142-152 | crates/glimpse-widgets/src/network_popover/mod.rs:252-260 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efb8bddd5a70311d0986ed4a82e8cf3f39354cec871acc75cda9ca919f30f1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/glimpse-config/src/schema/notifications.rs:62-73 | crates/glimpse-config/src/schema/wallpaper.rs:227-235 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/schema/notifications.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bd013ab20c5231fecb1e9e67422beec73af6b8063d7ebdf2c670b8a22884c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/glimpse-widgets/src/clipboard_popover/imp.rs:36-47 | crates/glimpse-widgets/src/session_popover/imp.rs:34-41 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/clipboard_popover/imp.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bfb8152451ac5aea4afa96e9d9b0c600c65cb6cd32492582237998dac03f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/glimpse-widgets/src/display_popover/mod.rs:43-50 | crates/glimpse-widgets/src/source_list/mod.rs:37-44 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_popover/mod.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cbf1a17dbf70ad4aebd9afd1a84766a46e0ca1ab911181ad1684549a572c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/glimpse-widgets/src/display_popover/mod.rs:77-84 | crates/glimpse-widgets/src/inhibitor_list/mod.rs:64-71 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_popover/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"021cfaf0b642dbce29abb2b0d355f927931ab1d64cf1f3f15e9dafc127687255"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/glimpse-widgets/src/lib.rs:282-291 | crates/glimpse-widgets/src/track_card/mod.rs:95-102 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lib.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"e081e83768b033c6b52f71b2f70f5d3df9eacbd134ea0dc65e27617dfa978300"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/glimpse-widgets/src/notification_header/imp.rs:89-92 | crates/glimpse-widgets/src/shot_countdown/imp.rs:44-48 | crates/glimpse-widgets/src/status_island/imp.rs:37-40 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notification_header/imp.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7672146072011547933bf6eb082906421ab029bb0b264c7c16bfa514f18595"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/glimpse-notifications/src/app.rs:1068-1073 | crates/glimpse-panel/src/applets/notifications/indicator.rs:397-403 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/app.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2555b27dfd3751846edf6d8835f84994c4706d7928b8e0dbd9f532a645c3821"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/glimpse-services/src/service.rs:374-382 | crates/glimpse-panel/src/applet/runtime.rs:654-662 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/service.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c42dabf14e04706b9edfc1a0e66c4f3e15e52d9e9ae7a76cfda3358d432ad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/glimpse-panel/src/applets/audio/indicator.rs:386-396 | crates/glimpse-panel/src/applets/bluetooth/render.rs:185-195 | crates/glimpse-panel/src/applets/places/render.rs:43-53 | crates/glimpse-panel/src/applets/removable/render.rs:41-50 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/audio/indicator.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05bbb16c6c421461d8aa7fbe823fcc52c0d0b04aa57017f3c030b2c9b177abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-services/src/services/printing/call.rs:69-75 | crates/glimpse-utils/src/process.rs:100-107 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/printing/call.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9a42eda058cbd837e182926e4468151e295fca91c2fa3a2ef018c003003086"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/glimpse-widgets/src/bluetooth_popover/mod.rs:66-70 | crates/glimpse-widgets/src/network_popover/mod.rs:78-82 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a685477491d091a08be95aff4a86701ca2af6f58d55133a0f52b8b209a11ff5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/glimpse-agents/src/app.rs:641-649 | crates/glimpse-notifications/src/app.rs:138-145 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/app.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1432c30c8015d8ef6fbe9e2fe17f4ff709ea604e9ca910128b9cb78cf1e3ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/glimpse-compositor-hyprland/src/main.rs:13-22 | crates/glimpse-compositor-niri/src/main.rs:13-22 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-hyprland/src/main.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6905afa05cf1c967e0a3ce5c5f30e7a38288b2f95aea193a46abec475a3ba272"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/glimpse-panel/src/applets/idle/mod.rs:137-140 | crates/glimpse-panel/src/applets/power/mod.rs:116-119 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/idle/mod.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e6603bb47ebf3dc916c75979e6017511cb6b46dcf15b566167a337a6942b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/glimpse-widgets/src/bluetooth_popover/mod.rs:154-162 | crates/glimpse-widgets/src/network_popover/mod.rs:239-247 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf211715e32f94fa0fce37c6441406523f9e23a28d5caeba646a0a62bc2658c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): crates/glimpse-config/src/schema/applets.rs:577-583 | crates/glimpse-config/src/schema/lock.rs:77-83 | crates/glimpse-config/src/schema/notifications.rs:78-84 | crates/glimpse-config/src/schema/osd.rs:33-39 | crates/glimpse-config/src/schema/wallpaper.rs:168-174 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/schema/applets.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ddfba3e88298c8ed2308067f3195a5c9ae65390d1169242d8045263f07f4150"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-idle/src/services.rs:153-159 | crates/glimpse-sunset/src/services.rs:80-86 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/services.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a7dc7f4c982b6cd4a1131cee8fc2eaacefeee922778a3959fcfeffd8f7f790"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/glimpse-services/src/services/printing/call.rs:113-120 | crates/glimpse-services/src/services/printing/source.rs:204-211 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/printing/call.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fb7f0c6d5568be352dfa723d9a4546c8dca20991a64ad7093b013188dd7ed4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/glimpse-widgets/src/inhibitor_list/mod.rs:142-156 | crates/glimpsectl/src/commands/idle.rs:205-219 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/inhibitor_list/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a69d2ede44dcf781a233250f521db612f5d2b2459d2505f7052ddc9e2b0b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/glimpse-dbus/src/clients/bluez.rs:202-207 | crates/glimpse-dbus/src/clients/mod.rs:132-137 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/bluez.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba685700716256c55bd72a31d875b55af5543aa2747612b3191192ea8bd36f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-panel/src/applets/network/indicator.rs:234-242 | crates/glimpse-panel/src/applets/printing/indicator.rs:44-50 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/network/indicator.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d9e3aca963be9260d210e512265ee7d69ac7201b57211eb877cca658f2079f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/glimpse-shot/src/doc/document.rs:173-178 | crates/glimpse-shot/src/headless.rs:245-250 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/document.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b36fcefd4a1c3af8ecccca7db136dc502f5fcb7acf2dcaf6a2be39a5390f6fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/glimpse-widgets/src/display_list/mod.rs:61-68 | crates/glimpse-widgets/src/display_popover/mod.rs:86-93 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_list/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb60f27edc2379df5c04f0f7b208a52484e6c96c61da88ea13b4274adacfedf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/glimpse-agents/src/lock.rs:40-45 | crates/glimpse-idle/src/wayland_notify.rs:200-207 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/lock.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19c2122107d7a9cf391c2e8156c24027e9aac20b6850e58f73d1440fefbb058"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-panel/src/applets/pager/mod.rs:84-90 | crates/glimpse-panel/src/applets/tray/mod.rs:157-163 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/pager/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbef7ce487c7936fa5d23f5e705aa273ae73128e0c43f1b26a22d6e1ed99d82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-services/src/services/bluetooth/mod.rs:793-800 | crates/glimpse-services/src/services/removable/mod.rs:580-586 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70c8f2367c2a32f6081f2f8d8bcc15e475ba0da3b9f2431f9e62e251274066e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/glimpse-widgets/src/bars.rs:173-178 | crates/glimpse-widgets/src/range_bar.rs:49-55 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bars.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d5c94a919853bba8ffc36bff6145fa2c5d39753ddff9d70d00d6a20fb7a760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/glimpse-services/src/selection.rs:44-49 | crates/glimpse-wayland/src/selection/mod.rs:30-35 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/selection.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecd341d3cedfd9250a9497a87691d9a3e2e8d42f892e746ddf197e52b5c139e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-widgets/src/bluetooth_popover/mod.rs:83-89 | crates/glimpse-widgets/src/network_popover/mod.rs:145-153 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07aaf8babf19973a869af454050e2a57a11cb3af887f19ffbed800169815540"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-shot/src/doc/document.rs:29-35 | crates/glimpse-shot/src/render.rs:222-228 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/document.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8941fed0786ff8e8028ef3ed45c5ba3660960e3a9a53928fc36a54c0feb42e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): crates/glimpse-widgets/src/bluetooth_popover/mod.rs:131-137 | crates/glimpse-widgets/src/display_popover/mod.rs:120-126 | crates/glimpse-widgets/src/network_popover/mod.rs:223-229 | crates/glimpse-widgets/src/power_popover/mod.rs:169-175 | crates/glimpse-widgets/src/privacy_popover/mod.rs:62-68 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3f1f9bb2bfa8301459f8787e85959b355a0345fee2b40c598a273fc0e3ac11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/glimpse-widgets/src/clipboard_list/mod.rs:368-374 | crates/glimpse-widgets/src/inhibitor_list/mod.rs:76-82 | crates/glimpse-widgets/src/shot_window_list/mod.rs:51-57 | crates/glimpse-widgets/src/workspace_list/mod.rs:66-72 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/clipboard_list/mod.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b430813b417b50f4fabeb53e7e1e88261a02a4d3bd19d55b3887fbe30adc98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-widgets/src/idle_popover/imp.rs:43-49 | crates/glimpse-widgets/src/network_popover/imp.rs:108-114 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/idle_popover/imp.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd75ef41046a0474f4ba00411501eba08e45875394bfa5182a423f2ae4d6c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-widgets/src/printing_popover/mod.rs:57-63 | crates/glimpse-widgets/src/privacy_popover/mod.rs:51-57 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/printing_popover/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bd55d25a44656c27445f8ddddaec8a25964367b7cc2a487d745b89d05ae24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/glimpse-panel/src/applets/idle/mod.rs:45-52 | crates/glimpse-panel/src/applets/notifications/indicator.rs:60-67 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/idle/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26145a57aeb1459156349b55073730d8c990bdec86fc491f5c969b809890f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-widgets/src/choice_list/mod.rs:55-61 | crates/glimpse-widgets/src/player_list/mod.rs:51-57 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/choice_list/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d5b27e1c4ea6809fcae8aa74f0c510cb5cfc40a7d089cd190ddcfb3e46643d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-widgets/src/shot_result_page/mod.rs:126-132 | crates/glimpse-widgets/src/shot_toolbar/mod.rs:126-132 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_result_page/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47be15e50bdcc7fb9b505c070e4d8b03299dea932f3100fba106a52a6e32a55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/glimpse-widgets/src/shot_toolbar/mod.rs:134-140 | crates/glimpse-widgets/src/status_island/mod.rs:59-65 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_toolbar/mod.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1ea4bebf98021687426e6302f8a6f84c092c4d05d4adf1778233e39b021c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): crates/glimpse-services/src/services/bluetooth/source.rs:46-49 | crates/glimpse-services/src/services/kdeconnect/source.rs:48-51 | crates/glimpse-services/src/services/network/source.rs:46-49 | crates/glimpse-services/src/services/removable/source.rs:46-49 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd13b8409e677819c6b792bcd7c63f4a5ec2701f99eabe08e08651b8f6a3f8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/glimpse-services/src/services/mpris/select.rs:9-13 | crates/glimpse-services/src/services/notifications.rs:590-594 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/mpris/select.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8adacc1ca924e4e1289c34e572d0e89358d5b0ef1ea3bd5d40eb1ea4c671d0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/glimpse-widgets/src/notification_text_body/imp.rs:113-117 | crates/glimpse-widgets/src/row/imp.rs:106-110 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notification_text_body/imp.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b854f15a3078404d87e41ffc1da9fbf6e83a2da3c287f1f6da90bd0c894754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): crates/glimpse-widgets/src/entry_row/imp.rs:37-40 | crates/glimpse-widgets/src/row/imp.rs:322-325 | crates/glimpse-widgets/src/section/imp.rs:38-41 | crates/glimpse-widgets/src/slider_row/imp.rs:167-170 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/entry_row/imp.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df6482ca45081264ae3928f8320943dd2744759457796843e240410ce331d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/glimpse-notifications/src/app.rs:1089-1118 | crates/glimpse-panel/src/applets/notifications/render.rs:111-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/app.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"c859e8a66fdeeaaa48f65ea962c1c9cba2aabe6450945e6ed3d456904621c012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 4): crates/glimpse-calendar/src/main.rs:43-62 | crates/glimpse-idle/src/main.rs:54-74 | crates/glimpse-sunset/src/main.rs:54-74 | crates/glimpse-weather/src/main.rs:44-63 \u2014 before extracting anything, compare \u0060crates/glimpse-calendar/src/main.rs\u0060 and \u0060crates/glimpse-idle/src/main.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-calendar/src/main.rs:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/main.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b6377b23225640a9a9af8f118b1a6b187bea62ae7a2bb7c2534471a22e4677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 3): crates/glimpse-services/src/services/bluetooth/source.rs:107-124 | crates/glimpse-services/src/services/network/source.rs:126-140 | crates/glimpse-services/src/services/removable/source.rs:99-113 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/source.rs:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6448256bd06e725b0ab45e77c3ffee8d81a2c97524713f21e9533473a5c1af19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/glimpse-panel/src/applets/idle/mod.rs:65-82 | crates/glimpse-panel/src/applets/power/mod.rs:215-232 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-panel/src/applets/idle/mod.rs:65\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/idle/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdfd6538e0b7093bc00e8f7d0d996dfd2ccb02b33b664070a9f1b14d0acc49b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/glimpse-panel/src/applets/display/indicator.rs:206-222 | crates/glimpse-panel/src/applets/display/indicator.rs:225-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-panel/src/applets/display/indicator.rs:206\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/display/indicator.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"48452b46fd4ffa60e6ac2250a66647b1c6f8d931928110113be3277e801086ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/glimpse-services/src/services/audio/pulse.rs:551-569 | crates/glimpse-services/src/services/audio/pulse.rs:575-593 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/audio/pulse.rs:551\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060info\u0060 to \u0060\u0026SinkInfo\u0060 in one and \u0060\u0026SourceInfo\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/pulse.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"636dcdba1d2a681887a28637b834dadc127ec71edc855b62ebba9469fc65680b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/glimpsectl/src/commands/panel.rs:231-247 | crates/glimpsectl/src/commands/watch.rs:31-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/panel.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3093eabded89a552dbae1fc2c65cabf391b4249c5dffa725bcf92e2771395b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/glimpse-services/src/services/audio/mod.rs:242-257 | crates/glimpse-services/src/services/audio/mod.rs:267-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/audio/mod.rs:242\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/mod.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"673af49783af4bb4a6bb59764abec07971022d17f7a2253e99f7a625b3662157"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/glimpse-services/src/services/bluetooth/mod.rs:370-385 | crates/glimpse-services/src/services/removable/mod.rs:244-259 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/mod.rs\u0060 and \u0060crates/glimpse-services/src/services/removable/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 39 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/mod.rs:370\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec52cc72ddda02858c7dbff879fa139ab4bb22ddd3f5a8aba15fe2f72244603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/glimpsectl/src/commands/package_manager.rs:177-194 | crates/glimpsectl/src/commands/run.rs:30-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/package_manager.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f71a2f4b6cc7e0ae120a2f3b71d0765473f1dd7ca165f3fbc63eb8dd4be9fab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 5): crates/glimpse-calendar/src/main.rs:48-62 | crates/glimpse-idle/src/main.rs:60-74 | crates/glimpse-settings-daemon/src/main.rs:51-65 | crates/glimpse-sunset/src/main.rs:60-74 | crates/glimpse-weather/src/main.rs:49-63 \u2014 before extracting anything, compare \u0060crates/glimpse-calendar/src/main.rs\u0060 and \u0060crates/glimpse-idle/src/main.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-calendar/src/main.rs:48\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/main.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb46e20670019db51e8193f690b3e8a0b306064bea87d60d0bca2be90695f5f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/glimpse-panel/src/applets/exec/dom.rs:743-757 | crates/glimpse-panel/src/applets/exec/dom.rs:760-774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-panel/src/applets/exec/dom.rs:743\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"736675664fef4df414a62a6c95b8f40cfe06194d6494939ff4d15c6e8de5b244"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/glimpse-shot/src/gui/overlay.rs:878-892 | crates/glimpse-shot/src/gui/result.rs:614-628 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/gui/overlay.rs\u0060 and \u0060crates/glimpse-shot/src/gui/result.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec6c24773a033be19696ceeaee4b445e39e5d560de2b7bc52e8564d2894e6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/glimpse-widgets/src/clipboard_list/imp.rs:38-52 | crates/glimpse-widgets/src/clipboard_popover/imp.rs:56-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/clipboard_list/imp.rs:38\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/clipboard_list/imp.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f643fb7460dff8559ded668be1d76b97495268c03c42e023091568b63d963bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/glimpse-services/src/services/bluetooth/source.rs:164-177 | crates/glimpse-services/src/services/network/source.rs:192-205 | crates/glimpse-services/src/services/removable/source.rs:130-143 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/source.rs:164\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3b7386b9f78c6b4e3bb58a4f484db44149a5cce6607c4c462d1cd2f5a92311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/glimpse-panel/src/applets/clipboard/indicator.rs:367-380 | crates/glimpse-shot/src/gui/result.rs:1256-1269 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/clipboard/indicator.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c33cfa477558443a23807c92e2ce91b5eab009080d4d47f09dc5e2e4468b4b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/glimpse-services/src/services/network/mod.rs:1409-1422 | crates/glimpse-services/src/services/network/mod.rs:1491-1504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"d557692e0a8e5c84711e8a2c5d930c4518a14d0b350edb6f19ed9d172c0f41e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/glimpse-shot/src/gui/overlay.rs:225-238 | crates/glimpse-shot/src/gui/result.rs:1029-1042 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/gui/overlay.rs\u0060 and \u0060crates/glimpse-shot/src/gui/result.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/gui/overlay.rs:225\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37fbb81d14d5b81706f060a7a0edb183d836905b3ceda1ecd17b760cc11d8b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/glimpse-widgets/src/shot_capture_page/mod.rs:255-268 | crates/glimpse-widgets/src/shot_result_page/mod.rs:100-113 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/shot_result_page/mod.rs:100\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_capture_page/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f1ddf72b3ba1cc580c6cc70a26509a821ef75162a54cddeed0c151369cbcb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/glimpse-services/src/services/audio/mod.rs:308-320 | crates/glimpse-services/src/services/audio/mod.rs:333-345 | crates/glimpse-services/src/services/audio/mod.rs:359-371 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/audio/mod.rs:308\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb899c24cc673fface006da56c4ba09b044ccac585b9625daeca8ed9dd5c96a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/glimpse-dbus/src/clients/follower.rs:207-219 | crates/glimpse-dbus/src/clients/idle.rs:460-472 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-dbus/src/clients/follower.rs:207\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/follower.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2425052803050ee1d8564745bac32dcde1b1ef47f7269a727055ef40f395442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/glimpse-lens/src/lens.rs:58-70 | crates/glimpse-lens/src/session.rs:149-161 \u2014 before extracting anything, compare \u0060crates/glimpse-lens/src/lens.rs\u0060 and \u0060crates/glimpse-lens/src/session.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-lens/src/lens.rs:58\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/glimpse-lens/src/session.rs:148\u0060 calls \u0060default\u0060 and \u0060crates/glimpse-lens/src/lens.rs:57\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18c6dd8d77c21b99c7e2ef0feb26604c708b65b72029145252f2ddb533b3da4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/glimpse-panel/src/applets/exec/dom.rs:1079-1091 | crates/glimpse-panel/src/applets/exec/dom.rs:1113-1125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-panel/src/applets/exec/dom.rs:1079\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4a589a1cda3732ee4c0b2f1379d7eb5497dd42f89f00bffa32f144e1d0834e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/glimpse-services/src/services/bluetooth/mod.rs:487-499 | crates/glimpse-services/src/services/removable/mod.rs:324-336 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/mod.rs\u0060 and \u0060crates/glimpse-services/src/services/removable/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 39 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/mod.rs:487\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"25daf8de5a57d611b155a7630497cf7f4bbd35797ed45ed4c16d01d80ebb480b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/glimpse-shot/src/doc/wire.rs:348-360 | crates/glimpse-shot/src/doc/wire.rs:367-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/wire.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab0e6c550935b45fd5200d8f36ebd99cc6e3c6613e177dc8e5f3f12e615b1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/glimpse-notifications/src/services.rs:49-59 | crates/glimpse-panel/src/services.rs:109-120 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-notifications/src/services.rs:49\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/services.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8bfa952477647ee61d05abe027f2ed8876ce8b28bcc3590b6d5a7ca89ad9d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/glimpse-services/src/services/bluetooth/source.rs:218-229 | crates/glimpse-services/src/services/network/source.rs:270-281 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/source.rs:218\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ddd2565f7f1a7648b9856d3f0e0e11b1753620267845d4789bafa1f9f2fadc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/glimpse-widgets/src/idle_popover/imp.rs:87-98 | crates/glimpse-widgets/src/power_popover/imp.rs:143-154 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/idle_popover/imp.rs:87\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/idle_popover/imp.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e53b82847ae05af56b798e7764bcd6c868e8db4501e7eafd6a0f15b11ee2383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/glimpse-widgets/src/workspace_list/imp.rs:29-40 | crates/glimpse-widgets/src/workspace_section/imp.rs:38-49 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/workspace_list/imp.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b6316f834d08344d313e054c00fc327b4da56e032d2b59fe4f29e568d87ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): crates/glimpse-calendar/src/main.rs:20-29 | crates/glimpse-idle/src/main.rs:21-31 | crates/glimpse-sunset/src/main.rs:20-30 | crates/glimpse-weather/src/main.rs:19-28 \u2014 before extracting anything, compare \u0060crates/glimpse-calendar/src/main.rs\u0060 and \u0060crates/glimpse-idle/src/main.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/glimpse-weather/src/main.rs:32\u0060 calls \u0060init_locale\u0060 and \u0060crates/glimpse-calendar/src/main.rs:33\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/main.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cac6db5f2289ef6253fabbb44800e570dbf70878209f08afe680f4c01d99892"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/glimpse-services/src/services/bluetooth/source.rs:23-33 | crates/glimpse-services/src/services/network/source.rs:23-33 | crates/glimpse-services/src/services/removable/source.rs:23-33 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3236b941ff1409fcdf580fe6cefe5e92331cef354d1b1215eaedc72950dc5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/glimpse-services/src/services/bluetooth/source.rs:180-190 | crates/glimpse-services/src/services/network/source.rs:208-218 | crates/glimpse-services/src/services/removable/source.rs:146-156 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a497c0b0312463875778166177baaaf8c7f7e687395f7555d2320c9a2974915"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/glimpse-idle/src/main.rs:79-89 | crates/glimpse-sunset/src/main.rs:79-89 \u2014 before extracting anything, compare \u0060crates/glimpse-idle/src/main.rs\u0060 and \u0060crates/glimpse-sunset/src/main.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-idle/src/main.rs:79\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/main.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"668076e650b454ac71bcf6edd6b217c89be47d45a006007ddb42adffbd3ecb0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/glimpse-shot/src/gui/overlay.rs:253-263 | crates/glimpse-shot/src/gui/result.rs:1058-1068 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/gui/overlay.rs\u0060 and \u0060crates/glimpse-shot/src/gui/result.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/gui/overlay.rs:253\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/glimpse-shot/src/gui/result.rs:1069\u0060 calls \u0060is_ok\u0060, \u0060mark_clean\u0060 and \u0060crates/glimpse-shot/src/gui/overlay.rs:264\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"030b842ef0b5964c6011688226b5d8b3798e5f35d20f03ba6e42e6fb90a5ee80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/glimpse-shot/src/notify.rs:217-227 | crates/glimpse-wallpaper/src/portal/notify.rs:115-125 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/notify.rs\u0060 and \u0060crates/glimpse-wallpaper/src/portal/notify.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/notify.rs:217\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/notify.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"25188b45ab277bd1176c8712ababd173fd04a5c2a2c3ae56eee87b6425f7ae4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/glimpse-widgets/src/bluetooth_popover/imp.rs:108-118 | crates/glimpse-widgets/src/network_popover/imp.rs:131-141 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/bluetooth_popover/imp.rs:108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/imp.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8c55f72050eefc2fceb3fc44c1c4f7b2e9bb1c0cd0e8aeeb5f3308710ce635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/glimpse-services/src/services/bluetooth/mod.rs:695-704 | crates/glimpse-services/src/services/removable/mod.rs:454-463 | crates/glimpse-services/src/services/removable/mod.rs:498-507 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/mod.rs\u0060 and \u0060crates/glimpse-services/src/services/removable/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 39 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/mod.rs:695\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5d29ee8b08dcb6bda397c637eea34c954fb25142f6d3f11786142d1732a64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/glimpse-services/src/services/bluetooth/source.rs:193-202 | crates/glimpse-services/src/services/network/source.rs:245-254 | crates/glimpse-services/src/services/removable/source.rs:159-168 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"115a8b34b0728f23094ec00356f5ae036c4d5659c8ac1306f41492b0e2a9c461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/glimpse-services/src/services/bluetooth/source.rs:217-226 | crates/glimpse-services/src/services/network/source.rs:269-278 | crates/glimpse-services/src/services/removable/source.rs:183-192 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/source.rs:217\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cda1a2fc77870f436f642a6651e980c26536af0589d54c32415dd48a243f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201310 lines \u00D7 3): crates/glimpse-lens/src/session.rs:333-342 | crates/glimpse-lens/src/session.rs:344-353 | crates/glimpse-lens/src/session.rs:354-358 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-lens/src/session.rs:333\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/session.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"589407a77a8d8994824d90c90ea39adb70a569145713929760e1f3584149195d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-services/src/services/audio/pulse.rs:873-882 | crates/glimpse-services/src/services/audio/pulse.rs:930-939 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/audio/pulse.rs:873\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/pulse.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc88ad5b5f6e069351dad92bc0730ed4bc70025634e10792d472f1ed678cd893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-services/src/services/bluetooth/mod.rs:465-474 | crates/glimpse-services/src/services/network/mod.rs:668-677 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/mod.rs:465\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/glimpse-services/src/services/network/mod.rs:678\u0060 calls \u0060forget_everything\u0060 and \u0060crates/glimpse-services/src/services/bluetooth/mod.rs:475\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"955f58bef05ff448dca7fc430a42ec76d6123fcd55f9a15f1e8d965d68eaaf02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-services/src/services/bluetooth/source.rs:84-93 | crates/glimpse-services/src/services/network/source.rs:106-115 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/source.rs:84\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb606a1bf14688cd4aabd39aa33458eaa38325f05d7283a254b713b2e0fb4fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/glimpse-shot/src/gui/overlay.rs:607-616 | crates/glimpse-shot/src/gui/result.rs:403-411 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/gui/overlay.rs\u0060 and \u0060crates/glimpse-shot/src/gui/result.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/gui/overlay.rs:607\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f9ae520d1d04b206877bb7408cf138a88336d98af65d1f9729664b8b348bcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-shot/src/gui/overlay.rs:668-677 | crates/glimpse-shot/src/gui/result.rs:466-475 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/gui/overlay.rs\u0060 and \u0060crates/glimpse-shot/src/gui/result.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/gui/overlay.rs:668\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bfba5a196fa94124c33175bd800e2c9766ee1de47693257d88e37fc700173f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-shot/src/gui/overlay.rs:899-908 | crates/glimpse-shot/src/gui/result.rs:633-642 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/gui/overlay.rs\u0060 and \u0060crates/glimpse-shot/src/gui/result.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/gui/overlay.rs:899\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb89b5f08c29ab9bd83ead815ebac04bbbcf602b4ad39e8c4e53c79107d0d2da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-widgets/src/bars.rs:156-165 | crates/glimpse-widgets/src/sparkline.rs:191-200 \u2014 before extracting anything, compare \u0060crates/glimpse-widgets/src/bars.rs\u0060 and \u0060crates/glimpse-widgets/src/sparkline.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/bars.rs:156\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bars.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3989f83ca846a03b422aade855c0631ba13c9f4efe07faab0ada62d4918dd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-widgets/src/indicator_group/imp.rs:62-71 | crates/glimpse-widgets/src/pager/imp.rs:57-66 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/indicator_group/imp.rs:62\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/indicator_group/imp.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"624082da3f1bff2a50bfe5597ae9ba2e987096d2d7a4f8aa60ff256f8c191328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-widgets/src/scrubber/imp.rs:152-161 | crates/glimpse-widgets/src/slider_row/imp.rs:272-281 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/scrubber/imp.rs:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/scrubber/imp.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d81239b13b687724ebbc018c6558363e326f45e01051c7561d88c77e034f25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpsectl/src/commands/panel.rs:498-507 | crates/glimpsectl/src/commands/status.rs:141-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/panel.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"8517b67a81d62cbfb5ad1f22ed304a8a61700a353817107b248aae2cc81a5c4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/glimpse-agents/src/app.rs:783-791 | crates/glimpse-notifications/src/app.rs:894-902 | crates/glimpse-shot/src/gui/overlay.rs:1731-1739 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/app.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a699026fcd81f73ed4b02bbfc7a9ee0444b206b4339d24d7f46f6d953a899e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/glimpse-idle/src/main.rs:77-84 | crates/glimpse-settings-daemon/src/main.rs:68-76 | crates/glimpse-sunset/src/main.rs:77-84 \u2014 before extracting anything, compare \u0060crates/glimpse-idle/src/main.rs\u0060 and \u0060crates/glimpse-sunset/src/main.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-idle/src/main.rs:77\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/main.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"abea415b862abd8764e59611e4805ab3358b59678992a452a0473875ea87b8b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/glimpse-services/src/services/bluetooth/source.rs:73-81 | crates/glimpse-services/src/services/network/source.rs:95-103 | crates/glimpse-services/src/services/removable/source.rs:68-76 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/source.rs:73\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060ctx\u0060 to \u0060Ctx\u003CBluetooth\u003E\u0060 in one and \u0060Ctx\u003CNetwork\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5048bccf3ee4a0447307a17e4359a0e625837b28b105c09bb205b37918d21d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-lens/src/lens.rs:289-298 | crates/glimpse-lens/src/session.rs:454-463 \u2014 before extracting anything, compare \u0060crates/glimpse-lens/src/lens.rs\u0060 and \u0060crates/glimpse-lens/src/session.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-lens/src/lens.rs:289\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcecd22c19f739a76fc9bb76c0b8219ffefd84648175e2db9540a32ea19c912"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-notifications/src/app.rs:944-952 | crates/glimpse-panel/src/applets/notifications/indicator.rs:353-361 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-notifications/src/app.rs:944\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/app.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"332717fca31ff8e8909d07fec20d8c3c3a0cf28db840f080333d5d1cba99d6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-panel/src/app.rs:641-649 | crates/glimpse-wallpaper/src/app.rs:310-318 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/app.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb97a186c42041ceb9b746e97a478c87f1619888bf79354ecd3e397f9213aa2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-panel/src/applets/display/indicator.rs:125-133 | crates/glimpse-panel/src/applets/display/indicator.rs:182-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-panel/src/applets/display/indicator.rs:125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/display/indicator.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"452cc6f2c6341dcf8341f7904be86f69bcd334807eb4a2808df7ae19cc65728e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-panel/src/applets/exec/dom.rs:605-613 | crates/glimpse-panel/src/applets/exec/dom.rs:634-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-panel/src/applets/exec/dom.rs:605\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"68100a3bcafa301f68eb1b560e6c81f3dbc520e99911952888e1e9a85d3a8e3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-services/src/services/brightness/mod.rs:376-384 | crates/glimpse-services/src/services/brightness/mod.rs:432-440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/brightness/mod.rs:376\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/brightness/mod.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec140ea84f0b37adbd90691db87b0aa5592ce319de8db8bdb2cf6a306f00f2df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-shot/src/gui/overlay.rs:200-208 | crates/glimpse-shot/src/gui/result.rs:1004-1012 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/gui/overlay.rs\u0060 and \u0060crates/glimpse-shot/src/gui/result.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/gui/overlay.rs:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/glimpse-shot/src/gui/overlay.rs:196\u0060 calls \u0060effects\u0060 and \u0060crates/glimpse-shot/src/gui/result.rs:1003\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8096d1594e0821e8a0b2f34908ac797e2563fa595b6ee0cb14dc4980e42893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-shot/src/portal.rs:468-476 | crates/glimpse-wallpaper/src/portal.rs:228-236 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/portal.rs:468\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/portal.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3335024d33bdbdf2f0d87720837ad9eb751b5b72a1d74dc15b87b464a5a73cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-widgets/src/bars.rs:294-302 | crates/glimpse-widgets/src/sparkline.rs:405-413 \u2014 before extracting anything, compare \u0060crates/glimpse-widgets/src/bars.rs\u0060 and \u0060crates/glimpse-widgets/src/sparkline.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bars.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4123824877df7c3ccc1f7a34895fcfe0c3de85013aa198a855785602f2b21e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-widgets/src/choice_list/imp.rs:29-37 | crates/glimpse-widgets/src/keyboard_popover/imp.rs:47-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/choice_list/imp.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30a44a0b0b996cea003c2e0bbeeae905a1ea25d8650a90d1bdc7a9d018dc603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-widgets/src/entry_row/imp.rs:101-109 | crates/glimpse-widgets/src/slider_row/imp.rs:193-201 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/entry_row/imp.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f3edeb12f5b0dc7a87ba401eb9d49ae5f9e21f00ef90d8dbaa301db4dc3fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-widgets/src/track_card/imp.rs:51-59 | crates/glimpse-widgets/src/transport/imp.rs:164-172 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/track_card/imp.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0ecd6f11d78cdfeda09d79a2c4db96ecfc0a21d23f1d6c5f2f95ab48e38ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpsectl/src/commands/panel.rs:543-551 | crates/glimpsectl/src/commands/status.rs:80-88 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpsectl/src/commands/panel.rs:543\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/panel.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5290246d5c913577fd30cb54293afe98fe337e25119b6fc6b0dfb624d474708"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-dbus/src/clients/idle.rs:533-540 | crates/glimpse-dbus/src/clients/idle.rs:564-571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-dbus/src/clients/idle.rs:533\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/idle.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82c3558cc8e674283baaf0572ea8169cfe5138d04c918d876a03a1589f92621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-panel/src/applets/audio/indicator.rs:315-322 | crates/glimpse-panel/src/applets/bluetooth/indicator.rs:298-305 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-panel/src/applets/audio/indicator.rs:315\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/audio/indicator.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"45adae0f6ae562ccb8227397b508f0f6724ae41c0194b72cbc3e611b065ae4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-services/src/services/battery.rs:631-638 | crates/glimpse-services/src/services/battery.rs:645-652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/battery.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e167760fa2058fbd0ff56730d9d10c940adfbf820ed542178575a5aca1b1e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-services/src/services/bluetooth/failure.rs:35-42 | crates/glimpse-services/src/services/network/failure.rs:57-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/failure.rs:35\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/failure.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"05128c09ae90535fe6fd7d6bf78b4147c10f6a6d5d76d6699f321da75bc2c035"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-services/src/services/bluetooth/mod.rs:452-459 | crates/glimpse-services/src/services/network/mod.rs:632-639 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/bluetooth/mod.rs:452\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffa66bd3e634f4fcc88b271c337423734e8ef4776e39744bceeebc73fbab569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-services/src/services/privacy/screencast.rs:168-175 | crates/glimpse-services/src/services/privacy/screencast.rs:185-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/privacy/screencast.rs:168\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/privacy/screencast.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31eb0e8f823373445ccda484bcf819f61d3f446045b93197940f28cfa5d8812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-shot/src/gui/overlay.rs:1102-1111 | crates/glimpse-shot/src/gui/result.rs:935-944 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/gui/overlay.rs\u0060 and \u0060crates/glimpse-shot/src/gui/result.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 89 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/gui/overlay.rs:1102\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fa02c42b43608a02f393106ba929d19145c42498508ec649a2590c7cb9868b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-shot/src/notify.rs:251-258 | crates/glimpse-wallpaper/src/portal/notify.rs:150-157 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/notify.rs\u0060 and \u0060crates/glimpse-wallpaper/src/portal/notify.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/notify.rs:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/notify.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba2a9d1713805011f0548457767c9f8d80d77d39fb9bded222c6a40b95e5f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-widgets/src/bars.rs:284-291 | crates/glimpse-widgets/src/sparkline.rs:465-472 \u2014 before extracting anything, compare \u0060crates/glimpse-widgets/src/bars.rs\u0060 and \u0060crates/glimpse-widgets/src/sparkline.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bars.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fd082d1f4010c84719c82e3803890e0cd42558f8be524c86ccbfcb1498ed48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-widgets/src/calendar/imp.rs:247-255 | crates/glimpse-widgets/src/calendar_popover/imp.rs:47-55 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/calendar/imp.rs:247\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/glimpse-widgets/src/calendar_popover/imp.rs:56\u0060 calls \u0060builder\u0060, \u0060param_types\u0060, \u0060static_type\u0060 and \u0060crates/glimpse-widgets/src/calendar/imp.rs:256\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar/imp.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a4a745f06d0179e6012aa6b24f9f605ad444f005489043e562bf9218d2d9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-widgets/src/choice_list/mod.rs:66-73 | crates/glimpse-widgets/src/player_list/mod.rs:70-77 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/choice_list/mod.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/choice_list/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2155eb7bab0a5600666b15f68a3196fa5a4412970d25e7d72e62316bc05ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-compositor-hyprland/src/hyprland/outputs.rs:213-219 | crates/glimpse-wayland/src/wire.rs:137-143 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-compositor-hyprland/src/hyprland/outputs.rs:213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-hyprland/src/hyprland/outputs.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5792e366724da1fd92dda1f086ae2391716b6c5f216c842d6e3f1d1a4a7da45f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-idle/src/main.rs:34-40 | crates/glimpse-sunset/src/main.rs:33-39 \u2014 before extracting anything, compare \u0060crates/glimpse-idle/src/main.rs\u0060 and \u0060crates/glimpse-sunset/src/main.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-idle/src/main.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/main.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"04803c88b3c39761e3f6123087cbc49e4ce3531bd8510bd9e62c4bb6b00fb856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-lens/src/lens.rs:122-128 | crates/glimpse-lens/src/session.rs:209-215 \u2014 before extracting anything, compare \u0060crates/glimpse-lens/src/lens.rs\u0060 and \u0060crates/glimpse-lens/src/session.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/glimpse-lens/src/session.rs:216\u0060 calls \u0060add_overlay\u0060 and \u0060crates/glimpse-lens/src/lens.rs:129\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"349bb9df677e266929701ea2cc5ec740cb01419ba98bc89dfded20e51e0e1be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-panel/src/applets/power/mod.rs:106-114 | crates/glimpse-panel/src/applets/weather/mod.rs:204-212 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/power/mod.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d1adb1c8afe3db53bbbebe399603379b1977407a4822562e691b92c76393d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-services/src/services/battery.rs:335-341 | crates/glimpse-services/src/services/battery.rs:358-364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/battery.rs:335\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/battery.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"903057484b5f83c4079851fd15d4367c71806f5cbc3d3592f017383f9949f12c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-services/src/services/exec/launcher.rs:62-69 | crates/glimpsectl/src/commands/applets.rs:186-193 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/launcher.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf778d50d2e2dbb00a11d841f6aace3bbe74c8f1f0aedbf6913f62593d3b309a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-services/src/services/tray/watcher.rs:47-53 | crates/glimpse-services/src/services/tray/watcher.rs:161-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/tray/watcher.rs:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/tray/watcher.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"242a12c6396a09067ec11b49b7a6aaa8d5d9c4b0356b344a21f57d2fa3128bc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-shot/src/gui/overlay.rs:715-721 | crates/glimpse-shot/src/gui/overlay.rs:738-744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/gui/overlay.rs:715\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/glimpse-shot/src/gui/overlay.rs:737\u0060 calls \u0060is_some\u0060 and \u0060crates/glimpse-shot/src/gui/overlay.rs:713\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"b961c1f1a30929aded8509a62bbb9988353e396ea005834895f6be706850813d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-widgets/src/bars.rs:253-260 | crates/glimpse-widgets/src/sparkline.rs:355-362 \u2014 before extracting anything, compare \u0060crates/glimpse-widgets/src/bars.rs\u0060 and \u0060crates/glimpse-widgets/src/sparkline.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bars.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce6813499996dc001c0102d2cd33532faea9ed27ba961cad2fa4f21252cc896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-widgets/src/bluetooth_popover/mod.rs:254-260 | crates/glimpse-widgets/src/network_popover/mod.rs:348-354 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/bluetooth_popover/mod.rs:254\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/glimpse-widgets/src/bluetooth_popover/mod.rs:261\u0060 calls \u0060imp\u0060, \u0060borrow\u0060, \u0060set_details\u0060 and \u0060crates/glimpse-widgets/src/network_popover/mod.rs:355\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee8d8b46ac8f3f38b7fb6edbc5937d6e1d356bb30cdeaaec54e225c0e4a2dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/glimpse-widgets/src/notification_stack/imp.rs:45-50 | crates/glimpse-widgets/src/places_popover/imp.rs:82-87 | crates/glimpse-widgets/src/player_list/imp.rs:27-32 | crates/glimpse-widgets/src/removable_popover/imp.rs:82-87 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/notification_stack/imp.rs:45\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notification_stack/imp.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfdecef9a13b7af82f4f8f6c5a0f65dca29f57d4fabba59cfb3d47fc6728099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/glimpse-services/src/services/network/mod.rs:1381-1387 | crates/glimpse-services/src/services/network/mod.rs:1397-1403 | crates/glimpse-services/src/services/network/mod.rs:1479-1485 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/network/mod.rs:1381\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"97caf83b365b5c8385c8b8dc07496775108ee190921758e9ab85682401aa7615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/glimpse-shot/src/doc/document.rs:241-247 | crates/glimpse-shot/src/doc/redact.rs:114-120 | crates/glimpse-shot/src/render.rs:180-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/doc/document.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6a0eecb64bef8ab04e4e08311b41bee8a65fef303cffafb5bbaad6567edc59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-lock/src/main.rs:95-100 | crates/glimpse-panel/src/main.rs:55-60 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-lock/src/main.rs:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/main.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b570a65425705687105372f6babb8eeaa4d24076894131461f177db39d121313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-services/src/services/exec/tree.rs:1805-1812 | sdk/sdk-rs/src/protocol.rs:71-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59754e255f9a60e7426d2a103d606137b0c401c6d27b73c380a9da1a51893fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/display_popover/imp.rs:100-105 | crates/glimpse-widgets/src/source_list/imp.rs:29-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/display_popover/imp.rs:100\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_popover/imp.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13cbc9e0f49c61d2fd584dbeb6a08009b4c47450b3d36142b8d535e555a79e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/idle_popover/imp.rs:61-66 | crates/glimpse-widgets/src/power_popover/imp.rs:102-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/idle_popover/imp.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6072226151514c172ea4bab74020bee7ec5485faae0f6adb6d47f38997ef66b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/notifications_popover/mod.rs:163-168 | crates/glimpse-widgets/src/notifications_popover/mod.rs:178-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/notifications_popover/mod.rs:163\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notifications_popover/mod.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"04064a4207cf1fdbbfab528d851f0897be175bcd90bdf1a7559a692f9d761621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpsectl/src/commands/panel.rs:273-278 | crates/glimpsectl/src/commands/watch.rs:57-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpsectl/src/commands/panel.rs:273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/panel.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f5e60a82ef51a234cee30d108eb2a4175d324a61e2664b2d0b36866761c621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-lens/src/lens.rs:49-57 | crates/glimpse-lens/src/session.rs:139-147 \u2014 before extracting anything, compare \u0060crates/glimpse-lens/src/lens.rs\u0060 and \u0060crates/glimpse-lens/src/session.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/glimpse-lens/src/session.rs:148\u0060 calls \u0060default\u0060 and \u0060crates/glimpse-lens/src/lens.rs:58\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc27f506fa8d164125b2da45aaade1d0f71f3cc32147af0f10059a04be2237d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-wayland/src/capture/ext.rs:222-226 | crates/glimpse-wayland/src/capture/ext.rs:263-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-wayland/src/capture/ext.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c69be337b86a81eab1acb851498b3bced3bbb0b883315e514af59f7954ffe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-widgets/src/bluetooth_popover/mod.rs:73-81 | crates/glimpse-widgets/src/network_popover/mod.rs:124-132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd30838a70cc816fef35e3d3d4251f271cf3fe20c11fc0e5a510430b988ac4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-widgets/src/hero/imp.rs:50-54 | crates/glimpse-widgets/src/notification_header/imp.rs:54-58 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/hero/imp.rs:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/hero/imp.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e7b3e80d8180734f2a902a2164a1f866872ba6380e4927e59376da522dff5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/raster.rs:163-168 | crates/glimpse-widgets/src/raster.rs:181-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/raster.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3956180902d9229b7961a13786215d1cad43949584f976a363381f31e03e7564"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-calendar/src/services.rs:56-64 | crates/glimpse-weather/src/services.rs:55-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/services.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"914ed8b2be4e67fe0a31bde3860c8ff85d3349b26e29ada15f8b8b9d6e0a6e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/glimpse-dbus/src/clients/calendar.rs:133-138 | crates/glimpse-dbus/src/clients/night_light.rs:208-213 | crates/glimpse-dbus/src/clients/notifications.rs:315-320 | crates/glimpse-dbus/src/clients/weather.rs:358-363 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/calendar.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ab4ec933ce6863194eef3046ff8d91483605069b05380ef482fb9f6db6271e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-lens/src/lens.rs:88-93 | crates/glimpse-lens/src/session.rs:178-183 \u2014 before extracting anything, compare \u0060crates/glimpse-lens/src/lens.rs\u0060 and \u0060crates/glimpse-lens/src/session.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"590d08439f9a7f824723c5e37d8f1d751fdb14ae50aa865a2ec0c616e99113ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/glimpse-lock/src/app.rs:900-905 | crates/glimpse-panel/src/app.rs:363-368 | crates/glimpse-wallpaper/src/app.rs:165-170 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"b190da68cf6c949e3b660d43cdc5917bd70223bbe61ec12ab5017f4fa44a29e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-panel/src/app.rs:479-485 | crates/glimpse-wallpaper/src/app.rs:196-202 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/app.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f461df056b6d427c1be8771e3fae96a2645c96304f036008cd9daad9b7ea82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-panel/src/applet/popover.rs:138-142 | crates/glimpse-services/src/services/exec/launcher.rs:119-123 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/popover.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc163946eb16e8a89077e2963943d5e4bc70e62aee8f88914dd9849e66eaef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): crates/glimpse-panel/src/applets/audio/indicator.rs:683-688 | crates/glimpse-panel/src/applets/bluetooth/indicator.rs:337-342 | crates/glimpse-panel/src/applets/display/indicator.rs:549-554 | crates/glimpse-panel/src/applets/idle/mod.rs:142-148 | crates/glimpse-panel/src/applets/keyboard/indicator.rs:114-119 | crates/glimpse-panel/src/applets/places/indicator.rs:133-138 | crates/glimpse-panel/src/applets/printing/indicator.rs:199-204 | crates/glimpse-panel/src/applets/removable/indicator.rs:180-185 | crates/glimpse-panel/src/applets/weather/mod.rs:145-151 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 9 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/audio/indicator.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44c79be2812712ad348894831c3d76b56db03509fe223657873e7cc437d5c04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/glimpse-panel/src/main.rs:21-32 | crates/glimpse-wallpaper/src/main.rs:13-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/main.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f4545e33c525effb05562da834bffe4f91783fa2b1dfd7fb6895d970007641"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/glimpse-services/src/services/bluetooth/source.rs:204-214 | crates/glimpse-services/src/services/network/source.rs:256-266 | crates/glimpse-services/src/services/removable/source.rs:170-180 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc295fbfecb0fbf9e4c7784ce5cd4f38d8191f6d36bd405344275fa5078f9539"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-shot/src/gui/canvas.rs:1279-1286 | crates/glimpse-shot/src/render.rs:292-299 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9587ba63ef46875e0dcdb807244aa3ef4531ec4b02261d7b70ac8c8630e07ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-shot/src/notify.rs:419-425 | crates/glimpse-wallpaper/src/portal/notify.rs:43-49 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/notify.rs\u0060 and \u0060crates/glimpse-wallpaper/src/portal/notify.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/glimpse-shot/src/notify.rs:427\u0060 calls \u0060file_uri\u0060, \u0060for_path\u0060, \u0060uri\u0060 and \u0060crates/glimpse-wallpaper/src/portal/notify.rs:51\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/notify.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"597a32850e02b1d3a8a5ea0c8494bb6cbdf5ca27d483d862ebc0bd1b687cd5e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-shot/src/notify.rs:431-436 | crates/glimpse-wallpaper/src/portal/notify.rs:51-56 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/notify.rs\u0060 and \u0060crates/glimpse-wallpaper/src/portal/notify.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/notify.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7182f01b82e3a99866b3fbe9c703b7517edca1f38b6554c9adab04508148ada2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-shot/src/portal.rs:392-400 | crates/glimpse-wallpaper/src/portal.rs:125-133 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/portal.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b5356c19c91145cd960799a22f95d8d5e8691746a31fc245f490b694ed4789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-shot/src/portal.rs:402-410 | crates/glimpse-wallpaper/src/portal.rs:135-143 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/portal.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a0090980c9e6cec68a79ccef67808dd77d0ade796a4f70b3e5f71e76b397e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-shot/src/portal.rs:574-580 | crates/glimpse-wallpaper/src/portal/request.rs:57-63 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/portal.rs:574\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/portal.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da17deaf6f52bf1bb915b5a29017ace52b6d84f73f23ce7314b3f740b0cf120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/applet_popover/imp.rs:58-63 | crates/glimpse-widgets/src/container/imp.rs:169-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/applet_popover/imp.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5820edc8412f140538ec9e72e3ff8266e1e5e206fb8c125157ee7486ae4f0da5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/applet_popover/imp.rs:69-74 | crates/glimpse-widgets/src/container/imp.rs:180-185 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/applet_popover/imp.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"23db5166c63db87ee2474bccb8a1e2ca54726db714decd84ed555e382e5fdf55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-widgets/src/audio_popover/mod.rs:192-198 | crates/glimpse-widgets/src/bluetooth_popover/mod.rs:97-103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/audio_popover/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d747972ea609b4c478a28f844ec2340ed6e549afc95b17d350fd599207b8e6bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-widgets/src/bluetooth_popover/mod.rs:48-55 | crates/glimpse-widgets/src/network_popover/mod.rs:47-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"190fd8a4e77ccc2fdf7a9baf508c111c8e293e9acbece1bbc6e2a596bd043a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/glimpse-widgets/src/forecast/hour.rs:49-55 | crates/glimpse-widgets/src/notice/imp.rs:49-55 | crates/glimpse-widgets/src/placeholder/imp.rs:36-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/forecast/hour.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c7b7cbfadb9c0a95275ea206e6aeb6f31695b815a09fea3488e0f5a1554649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/mpris_popover/imp.rs:118-123 | crates/glimpse-widgets/src/popover_shell/imp.rs:198-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/mpris_popover/imp.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d159667a28c0943b0058f7ef5a7c44153ae2523ec62b907a59e300d429131626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-widgets/src/network_popover/mod.rs:231-237 | crates/glimpse-widgets/src/places_popover/mod.rs:67-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/network_popover/mod.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"528fd3b4a7bc86b6dc9bc64ac542c9994e5c2d09f64e894921226a6d1287b305"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-widgets/src/notice/imp.rs:63-67 | crates/glimpse-widgets/src/now_playing/imp.rs:82-86 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notice/imp.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaf75a88dc6a8e83a21b260e4795398381ffb5ab2d6b4f4080e11fb7c87b076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): crates/glimpse-widgets/src/now_playing/imp.rs:143-148 | crates/glimpse-widgets/src/scrubber/imp.rs:188-193 | crates/glimpse-widgets/src/shot_banner/imp.rs:34-39 | crates/glimpse-widgets/src/shot_capture_page/imp.rs:77-82 | crates/glimpse-widgets/src/shot_countdown/imp.rs:61-66 | crates/glimpse-widgets/src/shot_region/imp.rs:45-50 | crates/glimpse-widgets/src/shot_result_page/imp.rs:163-168 | crates/glimpse-widgets/src/shot_toolbar/imp.rs:138-143 | crates/glimpse-widgets/src/shot_window_list/imp.rs:60-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 9 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/now_playing/imp.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45f85db033e2cd0cd2670ccf7b34856c40c41e9152b87ab51a315c8c4527dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/power_popover/imp.rs:175-180 | crates/glimpse-widgets/src/row/imp.rs:336-341 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060widget\u0060 to \u0060\u0026impl gtk4::prelude::IsA\u003Cgtk4::Widget\u003E\u0060 in one and \u0060\u0026impl IsA\u003Cgtk4::Widget\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/power_popover/imp.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bd8e685b126ecadd038d67a2cfed6873cfbe082bc33e3bd5e515734132f7c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-widgets/src/shot_banner/imp.rs:22-26 | crates/glimpse-widgets/src/shot_countdown/imp.rs:32-36 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_banner/imp.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b26348e982166f4447e8a68bd5de36258add6d20f98597d6568533a7ff78a9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-calendar/src/provider.rs:61-66 | crates/glimpse-notifications/src/provider.rs:129-134 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/provider.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"391c792c68bfe2158106d2274594022afb8863f33f06cc053c826b55e073b958"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/glimpse-notifications/src/provider.rs:142-154 | crates/glimpse-sunset/src/provider.rs:83-95 | crates/glimpse-weather/src/provider.rs:88-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-notifications/src/provider.rs:142\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/provider.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d20b76aff587226248522d2af86e6a173ee22b5e71b10149869ccec1ef1ade"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-panel/src/applets/keyboard/indicator.rs:25-32 | crates/glimpse-panel/src/applets/session/mod.rs:66-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/keyboard/indicator.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c56258722d80d37e572062517393c6b36aa49e7aee2cfe1f4269145217d235d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-panel/src/applets/places/indicator.rs:42-50 | crates/glimpse-panel/src/applets/removable/indicator.rs:42-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/places/indicator.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7f91784d6a6573ebe142fdf099edbd5a5a73b6dac4d474b6cb4fdc8d1103d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/glimpse-services/src/services/bluetooth/call.rs:16-22 | crates/glimpse-services/src/services/bluetooth/call.rs:24-30 | crates/glimpse-services/src/services/kdeconnect/source.rs:184-190 | crates/glimpse-services/src/services/removable/call.rs:8-14 | crates/glimpse-services/src/services/removable/call.rs:16-22 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/kdeconnect/source.rs:184\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/call.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3b9d995c94e5438baa6e907d9c1edd46c85c2f4ec26e750b463ae3f3827bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-services/src/services/bluetooth/mod.rs:158-164 | crates/glimpse-services/src/services/network/mod.rs:243-249 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"916cd5e6c5ef2768da4ca56436a62c0200a7f47abe0a5ad62619089083ab9198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-services/src/services/bluetooth/source.rs:35-40 | crates/glimpse-services/src/services/network/source.rs:35-40 \u2014 \u0060crates/glimpse-services/src/services/bluetooth/source.rs\u0060 and \u0060crates/glimpse-services/src/services/network/source.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 11 separate duplicated blocks between them, totalling at least 122 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/source.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d17a2d00105dd0e705cc123429da51d1f45d47f1e482d166b5ccc1d7bbb8ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/glimpse-widgets/src/bluetooth_popover/device.rs:38-44 | crates/glimpse-widgets/src/network_popover/row.rs:31-37 | crates/glimpse-widgets/src/removable_popover/device.rs:43-49 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/device.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd261f57abc9d75bde59d39a88bad2ccc56f0276c115ac31eba6046273d4bc01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-widgets/src/bluetooth_popover/imp.rs:88-94 | crates/glimpse-widgets/src/removable_popover/imp.rs:67-73 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/imp.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"975e729af6da75013fcab107d8374e0b246b8f46b4b1dbf9e69897b16169ef1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-widgets/src/hero/imp.rs:56-60 | crates/glimpse-widgets/src/notification_header/imp.rs:60-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/hero/imp.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"416f04d2567cc340ab5ea98d43dd2c20770cc33bc7a0d7e455750a11659e8ced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-widgets/src/notification_stack/mod.rs:467-475 | crates/glimpse-widgets/src/notifications_popover/mod.rs:249-257 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/notification_stack/mod.rs:467\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notification_stack/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"68711b67c786e071a5d4b6a0bcaa9af478a22b2924577c21dd4351b7f6a952f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-widgets/src/workspace_list/mod.rs:74-80 | crates/glimpse-widgets/src/workspace_section/mod.rs:53-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/workspace_list/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"018223096cfe8217a1bd461a8ad7c62050de5bc1b57eaf58b9cb5ab638c308a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpsectl/src/commands/idle.rs:14-19 | crates/glimpsectl/src/commands/settings.rs:85-90 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/idle.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a724d8186a27a018653667c295f78cded38dd1b1a164f7c483de959f5db165d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/glimpse-calendar/src/main.rs:62-76 | crates/glimpse-weather/src/main.rs:63-77 \u2014 before extracting anything, compare \u0060crates/glimpse-calendar/src/main.rs\u0060 and \u0060crates/glimpse-weather/src/main.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-calendar/src/main.rs:62\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/main.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c463729f66dbef5a1e108c76978c738b1fc6f3e09b206f367a5046057b2147"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/glimpse-services/src/services/brightness/mod.rs:513-523 | crates/glimpse-services/src/services/brightness/mod.rs:564-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/brightness/mod.rs:513\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/brightness/mod.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c17562437e21fc4026de7e4d183c6d70c1877cb0ac2a617d500d11cc63ea73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpsectl/src/commands/settings.rs:29-38 | crates/glimpsectl/src/commands/settings.rs:157-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpsectl/src/commands/settings.rs:29\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/settings.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"97684b3a86dfa320087d235c7df6720b7aedf2d0534aa77ba43805c7a2ea666b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/glimpse-services/src/services/brightness/mod.rs:259-268 | crates/glimpse-services/src/services/brightness/mod.rs:271-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/brightness/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3017a56464c3b93d4ff3804ba1c796c7b0f96f8b8fa9592972e39805a4104903"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpsectl/src/commands/applets_author.rs:124-132 | crates/glimpsectl/src/commands/package_manager.rs:104-112 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpsectl/src/commands/applets_author.rs:124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/applets_author.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78b259fc51dabd2853dcd14ebbaa1376a834dd3e062316e65a9a341b41c0fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-panel/src/applets/clipboard/indicator.rs:605-613 | crates/glimpse-panel/src/applets/clipboard/indicator.rs:636-644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-panel/src/applets/clipboard/indicator.rs:605\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/clipboard/indicator.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1ad2788f59811312afc8f2eae7aac85c0efd2bf85e5f3d740830cdb57a7fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/glimpse-widgets/src/bluetooth_popover/imp.rs:135-143 | crates/glimpse-widgets/src/idle_popover/imp.rs:79-87 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/bluetooth_popover/imp.rs:135\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/imp.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfbc87fb8b796bd475f90f994f55c75df52cf582ad79571a390b9d6a10547ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-services/src/services/exec/mod.rs:1274-1281 | crates/glimpse-services/src/services/exec/mod.rs:1291-1298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/exec/mod.rs:1274\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc66f4a0e0a6639fdc4078353bb0a98346c424b5d4dfc64f24a751d971543b40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/glimpse-widgets/src/event_list/imp.rs:53-60 | crates/glimpse-widgets/src/session_popover/imp.rs:51-58 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/event_list/imp.rs:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/event_list/imp.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f8b868e50ac301e06b55ee68c291461ffd85611266e9bef8d3ed5d2c5020e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/glimpse-widgets/src/inhibitor_list/imp.rs:29-36 | crates/glimpse-widgets/src/shot_window_list/imp.rs:44-51 | crates/glimpse-widgets/src/workspaces_popover/imp.rs:38-45 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/inhibitor_list/imp.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a187e9052e83460b3e712924906030c211f70c3b07ab7a0329fac7de80a9039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-widgets/src/action_row/imp.rs:27-33 | crates/glimpse-widgets/src/toggle_row/imp.rs:51-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/action_row/imp.rs:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/action_row/imp.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef7bf88c117e34451ccdb1dbfd214cfa88fd09795e52b561ddf5f79e947ef9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/glimpse-agents/src/bluetooth/mod.rs:240-246 | crates/glimpse-agents/src/obex/mod.rs:470-476 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-agents/src/bluetooth/mod.rs:240\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/bluetooth/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a316e52ff61ac03f84f6f275e40fdcdba66caf5654a35d04ab7db17d0f0dd0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-widgets/src/inhibitor_list/mod.rs:109-115 | crates/glimpse-widgets/src/privacy_popover/mod.rs:99-103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/inhibitor_list/mod.rs:109\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/inhibitor_list/mod.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b036e6d7ac67ba13c415faf955c32837298e4ad59211d30e112e2d4ef17a2881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/glimpse-services/src/services/battery.rs:317-323 | crates/glimpse-services/src/services/battery.rs:335-341 | crates/glimpse-services/src/services/battery.rs:358-364 | crates/glimpse-services/src/services/session_actions.rs:251-257 \u2014 there are 4 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 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-services/src/services/battery.rs:317\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/battery.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af66f73504eff47637362e7922892e16a7e460908172a4c84c8318242157f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/indicator_group/imp.rs:34-39 | crates/glimpse-widgets/src/power_popover/imp.rs:93-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/indicator_group/imp.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/indicator_group/imp.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadeb4943548cb57729b3af7ca877b6b1e8a8ba39dcb3cf3d3b49b47fcea61eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/glimpse-widgets/src/bluetooth_popover/imp.rs:103-108 | crates/glimpse-widgets/src/idle_popover/imp.rs:58-63 | crates/glimpse-widgets/src/network_popover/imp.rs:123-128 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/bluetooth_popover/imp.rs:103\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/imp.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dbaa44c886704da52404468685a557ed79a16a7d2d03e5614a3803b30b5108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 11): crates/glimpse-widgets/src/mpris_popover/imp.rs:46-51 | crates/glimpse-widgets/src/next_event_popover/imp.rs:51-56 | crates/glimpse-widgets/src/notification_stack/imp.rs:45-50 | crates/glimpse-widgets/src/places_popover/imp.rs:82-87 | crates/glimpse-widgets/src/player_list/imp.rs:27-32 | crates/glimpse-widgets/src/printing_popover/imp.rs:70-75 | crates/glimpse-widgets/src/privacy_popover/imp.rs:55-60 | crates/glimpse-widgets/src/removable_popover/imp.rs:82-87 | crates/glimpse-widgets/src/session_sheet/imp.rs:106-111 | crates/glimpse-widgets/src/shot_toolbar/imp.rs:105-110 | crates/glimpse-widgets/src/workspace_name_popover/imp.rs:48-53 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 11 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 11 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-widgets/src/mpris_popover/imp.rs:46\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/glimpse-widgets/src/places_popover/imp.rs:89\u0060 calls \u0060builder\u0060, \u0060build\u0060 and \u0060crates/glimpse-widgets/src/session_sheet/imp.rs:113\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/mpris_popover/imp.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"003c87f358727deb5f4baf06c0aeb936890580e1813fe37c634135d9cfd5fc54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/event_list/imp.rs:63-68 | crates/glimpse-widgets/src/world_clock/imp.rs:29-34 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/event_list/imp.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f366e65bceffd8b41aeaa18e1bd3e6025e5dcd7c6f9ae4ba4a6f124c7b81a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/glimpse-widgets/src/clipboard_list/mod.rs:307-312 | crates/glimpse-widgets/src/inhibitor_list/mod.rs:104-109 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/clipboard_list/mod.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf7c87919b6c39c68b9bfe17dd7bf62ba5648032e7c7d8a5d69e2bfa4d4c5d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-shot/src/gui/app.rs:700-704 | crates/glimpse-shot/src/gui/app.rs:710-714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/gui/app.rs:700\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"8452e2d0af918416b9b7038c9ece7ec5b122dcb788c5fa163b283802943d5c13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-shot/src/notify.rs:210-214 | crates/glimpse-wallpaper/src/portal/notify.rs:112-116 \u2014 before extracting anything, compare \u0060crates/glimpse-shot/src/notify.rs\u0060 and \u0060crates/glimpse-wallpaper/src/portal/notify.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/notify.rs:210\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/notify.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d089e7cdef300f50bb9ce275354ec1792bb07b48c826bfe474db5bf58622a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-panel/src/applets/exec/dom.rs:939-943 | crates/glimpse-panel/src/applets/exec/dom.rs:964-968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-panel/src/applets/exec/dom.rs:939\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/glimpse-panel/src/applets/exec/dom.rs:936\u0060 calls \u0060set_property\u0060 and \u0060crates/glimpse-panel/src/applets/exec/dom.rs:963\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb596a7e1d1046f87cad47d9f2cf2f26408426fd0366aefb57b8907721961cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/glimpse-shot/src/gui/app.rs:487-491 | crates/glimpse-shot/src/gui/app.rs:814-818 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/glimpse-shot/src/gui/app.rs:487\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cbd0a29a7e0970f8609038f392c5108b53ee07ec0006a4b8e43d04d93c03e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): sdk/sdk-py/glimpse_sdk/elements.py:136-151 | sdk/sdk-py/glimpse_sdk/elements.py:306-321 | sdk/sdk-py/glimpse_sdk/elements.py:375-390 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/sdk-py/glimpse_sdk/elements.py:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-py/glimpse_sdk/elements.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b0ac2567dfa5e53e3caa7facbec65ce5e4750bfee26e055505e27f62727ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk/sdk-go/sdk/widget.go:273-285 | sdk/sdk-go/sdk/widget.go:300-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/sdk-go/sdk/widget.go:273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/widget.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da2d172e6b1012408bbd16fb54f93397fbad278f272e57fab74f52102b7bfe0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sdk/sdk-go/sdk/widget.go:99-103 | sdk/sdk-go/sdk/widget.go:257-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk/sdk-go/sdk/widget.go:99\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/widget.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b89cdb9afc1def432bc92f293221216b987ac16c0db440346777a42632aa2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): scripts/docs-screenshots.py:846-852 | scripts/release-video.py:354-360 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/docs-screenshots.py"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea1d98719a09f72884f914107e1266a275902106f83fe3b185e21a0a89f1e72"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: glimpse-config: glimpse-config: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"07bea884e371e05a027af7df446c836a1474cf6adcef8dcad7dcf48e45cffb87"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: glimpse-utils: glimpse-utils: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 20 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dabddb8b9f7109e3169fc57bd56df9e15b4cc83de79306055f6e17736975073a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: glimpse-widgets: glimpse-widgets: abstractness 0.01, instability 0.22, distance 0.77 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"148e527ea1fa5a03be60e1921aced0e2e81528352c3fbbe0eef980834c130503"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: glimpse-wayland: glimpse-wayland: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"13de0d44664ca95f2f55e2fa1ed4cfa3a9988ae74cae90c61a29ca5af04d7f3d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ShotToolbar (LCOM4 19): ShotToolbar\u0027s methods fall into 19 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 19 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_toolbar/imp.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa5842b1032ebc56789bf6a8e1df2b1bd6651bd0c4a2585aca98d838da6fe05"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LockStage (LCOM4 13): LockStage\u0027s methods fall into 13 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 13 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lock_stage/imp.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb7836fa961f6aba953280224227c64a8abb7ee621de360499c162daa2f4431"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Sparkline (LCOM4 12): Sparkline\u0027s methods fall into 12 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 12 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/sparkline.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce79c626f150f83b4516c8fb07672051f421197881bf24a8666873ce4d75964f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PowerPopover (LCOM4 11): PowerPopover\u0027s methods fall into 11 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/power_popover/imp.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86e27e4e79d1af50f85c6c77f3af4b167a7972df238ec71ba788429a7b9f7eb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PasswordPrompt (LCOM4 10): PasswordPrompt\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/password_prompt/imp.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb70905a254449ed96a6daca43ff3b6ec8648b0062a9efd79cbafda8ef64a6a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ShotResultPage (LCOM4 10): ShotResultPage\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_result_page/imp.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda4e0e3adbc9ae0396020eb5a9efac98a55c6d0a6d7d9ddd58e4f0822be0706"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Bars (LCOM4 8): Bars\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bars.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f666c0ee955346d12993475628670221f54b50b4cf24144737fda87b81dffa11"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Row (LCOM4 8): Row\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/row/imp.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9c8b2f45fad4a497e156af24018b3b345d19514112a7576ee81a385ce9f4d9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AudioPopover (LCOM4 7): AudioPopover\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/audio_popover/imp.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0e24102aa31596b845a56b1750c1ee9d530f9aec4e0a4c2a65a3bc65fd58d3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BluetoothPopover (LCOM4 7): BluetoothPopover\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/imp.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"478b57b4309436fc072445cd12285631addd171db07bbaef300a49b03dc67ef7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Calendar (LCOM4 7): Calendar\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar/imp.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc439ec5f240161739ac2f96ddc128475bf02a94d1a1b9c4b9cbebd9443bd821"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CalendarPopover (LCOM4 7): CalendarPopover\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar_popover/imp.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c919510ba8c38ac0f03a3d933b7a68dd7753f451252e897673d56ca1bf50f8e2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ClipboardPopover (LCOM4 7): ClipboardPopover\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/clipboard_popover/imp.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb094aeec496962310514c76f165a68924e8dd792d4a63ec2fb1a088191c4b10"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EntryRow (LCOM4 7): EntryRow\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/entry_row/imp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbeaef87a89970a0c6e22bea4b5bec648021b96d0404e55d8b46d406fae8496"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NextEventPopover (LCOM4 7): NextEventPopover\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/next_event_popover/imp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"63be33264a2681d273ec4c17fb51b9ddc9210fd9b78e3906981958bd363068fc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ShotCapturePage (LCOM4 7): ShotCapturePage\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_capture_page/imp.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ee890101556f3e106a083d39cb6a693a64cf5510dbe1c4a5a9748de1a9afaf"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WeatherPopover (LCOM4 7): WeatherPopover\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/weather_popover/imp.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a273150a87dc71fb6df77b2d542a305f596b6e7bfb866147e5810ff19b1897"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Container (LCOM4 6): Container\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/container/imp.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"112f7f4baf20055797d2fab7f7c25428721e3add4c34ecef70f3f9dbc4b05ff4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DisplayPopover (LCOM4 6): DisplayPopover\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_popover/imp.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4638cf3a9e72b89ef420e9ed8965e4b40a57000702d1b007910d7cb111aa7233"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IdlePopover (LCOM4 6): IdlePopover\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/idle_popover/imp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcb1d6045bb792343c1872281ab52c230d06ab02629413e9fe16d26b358c05d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Lens (LCOM4 6): Lens\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lens.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a763c6a7fd18e30112c99e6d7f0e662d9ee7867c346aeea28216da137cd916"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NetworkPopover (LCOM4 6): NetworkPopover\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/network_popover/imp.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"de49107d95e9429d48681658ccd4c9e7f0af1d83b2d432a6aa1ef6f9b37ce555"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PopoverShell (LCOM4 6): PopoverShell\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/popover_shell/imp.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e8de0f3b3d25219f5bf2add9d1fb3fed7202944be46ba446611d121111c721"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RangeBar (LCOM4 6): RangeBar\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/range_bar.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a26f091bbf02c7fcfe11079ef913881bd91fbcf7fb078235407154148f631b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Marks (LCOM4 5): Marks\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/marks.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8372b1ed25fe859bde03d7e2823e9500019ac670a4687ca1fe8c4594e0b2024"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ClipboardList (LCOM4 5): ClipboardList\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/clipboard_list/imp.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9727bfadf1b3452b573a9c7ad13dd627ac9961938d83772d8c121b2ca0b3fc4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Dots (LCOM4 5): Dots\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/dots.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e543bd25b4b811aa62a0c4df44d62b691f6472eb15d8804d80ff627532761127"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Hero (LCOM4 5): Hero\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/hero/imp.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadcb1d13f4847365e4d4aad3520e0273318caed9e3dbada0f8cf7e54db6aa87"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IndicatorGroup (LCOM4 5): IndicatorGroup\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/indicator_group/imp.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2ca03bddb9f726ba07c01786f14a4c0e81449366ed7fb6bf21bde688791e24"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Notice (LCOM4 5): Notice\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notice/imp.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87d7b421b71e84e422c7fe0fbc8b88846af507c496b4a5549855a209bfc5aeb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Pager (LCOM4 5): Pager\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/pager/imp.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e8e55cd975481c77458de2fc4c729b4b8195b33138dc64105b5045dd6485d2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SliderRow (LCOM4 5): SliderRow\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/slider_row/imp.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a109ab9b98ac7780951c61edd691157e70791f0e748102b6ff731c828ca0887b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WorkspaceNamePopover (LCOM4 5): WorkspaceNamePopover\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/workspace_name_popover/imp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aabcee9bcf3a2d518ec085f17c2880875d9a71e4fb49e98816db080fee5f21"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Provider (LCOM4 4): Provider\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-settings-daemon/src/provider.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"24895cecda46457f33e745d6e2782d0d531ce1f433772cd3c2a3f2bda29cea69"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AppletPopover (LCOM4 4): AppletPopover\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/applet_popover/imp.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ac993c80e6545e4fa110a464a7bbb99986b4dc2b7281479ca3f8a17844162f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DisplayList (LCOM4 4): DisplayList\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_list/imp.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcaed4b6c4f2df999a72e8e88aa8dcccead895e85ddca70e9097c90437746b82"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Expandable (LCOM4 4): Expandable\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/expandable/imp.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c9d2cdffc7b5f0804f644d658c513ea3888e9f051a82d8400f1fdb64a1012e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ForecastList (LCOM4 4): ForecastList\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/forecast/imp.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7a600da13b65f981ef3d0aab4a23be5a983a6a28e7db47b952d43953c91394"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NotificationsPopover (LCOM4 4): NotificationsPopover\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notifications_popover/imp.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a46e8504f8694a24838f9e09a5974ca8994f0696453254bdd3d95d0609543c6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PlayerList (LCOM4 4): PlayerList\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/player_list/imp.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4197d758d28370680edf2532582f7db4b1d025ff9f2e27a763b194804ff3e4a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SessionSheet (LCOM4 4): SessionSheet\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/session_sheet/imp.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"723a89e08eee311d7c40aa7516601ad04bc3fe4c16ec5e42aad73a63e4ae4107"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ShotRegion (LCOM4 4): ShotRegion\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_region/imp.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af2742f79bf3f798681b7e198d50324b26feac7e700972c31cd47f6cd483e48"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ShotWindowList (LCOM4 4): ShotWindowList\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_window_list/imp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e53cb201eaa7e52a86639482f2a80f8dc6e24c0566ab1efb76eb968480ea7e7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SourceList (LCOM4 4): SourceList\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/source_list/imp.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c098b23e334ecb04a3c52d8b83b0c64a2004d4e11b0637132e1fe85231d819"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StatusIsland (LCOM4 4): StatusIsland\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/status_island/imp.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b43eef8e25299e19d09f6c72f246110a295592c5586c973f777c5b116244a2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TrayStrip (LCOM4 4): TrayStrip\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/tray_strip/imp.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7944be424f433cc4fe807574442abd62840987f72bb9cff06fd193c344e39a3a"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 the node:test suite in sdk/sdk-ts/ ran but wrote no lcov report. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-services/src/services/exec/mod.rs: crates/glimpse-services/src/services/exec/mod.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in Exec::handle at line 1036. 2 of those changes were fix/bug commits, and the other 28 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-services/src/services/exec/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/mod.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b1c997c8b99ea499d937bad453cc874e6fc48f85c372d35431223ce63ec597c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-panel/src/applets/exec/dom.rs: crates/glimpse-panel/src/applets/exec/dom.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in Dom::dress at line 874. 1 of those changes was a fix/bug commit, and the other 17 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-panel/src/applets/exec/dom.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"771b4a7768ed1b08394e22f40779e51dfe6c75d67abe0972da233441b1a3d23e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-panel/src/app.rs: crates/glimpse-panel/src/app.rs changed 68 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in App::update at line 181. 3 of those changes were fix/bug commits, and the other 65 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-panel/src/app.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/app.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d37ea9f757d3009ba7b170e28cad8798e5e38dbaff3c3ee073c920aef58d656"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-lock/src/app.rs: crates/glimpse-lock/src/app.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in App::update at line 299. 1 of those changes was a fix/bug commit, and the other 22 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-lock/src/app.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ae21a179f61d79cec79eb65c8d617314f8e7ab28ac3d91f688bf50f6a72d00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpsectl/src/commands/run.rs: crates/glimpsectl/src/commands/run.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in glimpsectl::commands::run::applets_run at line 179. 1 of those changes was a fix/bug commit, 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-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpsectl/src/commands/run.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/run.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebb33a662b85957684d8ea5a7524746d908afeda870aa287d4a0b24560a4bb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-notifications/src/app.rs: crates/glimpse-notifications/src/app.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in App::update at line 242. 1 of those changes was a fix/bug commit, and the other 25 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-notifications/src/app.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/app.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc7c0cfc748e265a36a128df48658fb50d97f030dfdb72a655fca352abd4816"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-panel/src/applet/runtime.rs: crates/glimpse-panel/src/applet/runtime.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in AppletRuntime::update at line 324. 1 of those changes was a fix/bug commit, and the other 37 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-panel/src/applet/runtime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/runtime.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f980eadb546ba96d006727f244a451ff3db83b5dd1b2b19851777c08aba78faf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-services/src/services/notifications.rs: crates/glimpse-services/src/services/notifications.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Notifications::dispatch at line 328. 2 of those changes were fix/bug commits, and the other 23 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-services/src/services/notifications.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/notifications.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b484b63f89ccc981b88ea6e7a7910e4840486516bd7009c88f30b8e9e74899be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-services/src/services/network/mod.rs: crates/glimpse-services/src/services/network/mod.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Network::merge at line 918. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-services/src/services/network/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/network/mod.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46320d9284ec1dc6d123006ff95241bc9b0c04656fcd4a4d87d8672a628b701"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-dbus/src/clients/idle.rs: crates/glimpse-dbus/src/clients/idle.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in glimpse_dbus::clients::idle::follow_provider at line 412. 1 of those changes was a fix/bug commit, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-dbus/src/clients/idle.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/idle.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c1a18e92ad742600ebb7809e49ec00cd56f914c1f97a63e1ac6ef4e8e10d8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-services/src/services/weather/mod.rs: crates/glimpse-services/src/services/weather/mod.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Weather::handle at line 340. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-services/src/services/weather/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/weather/mod.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"922ae40721e4affe841c355a94a5f94efa749e4329543ef1a1ad24a5945f1d79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-services/src/services/bluetooth/mod.rs: crates/glimpse-services/src/services/bluetooth/mod.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Bluetooth::handle at line 451. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-services/src/services/bluetooth/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/bluetooth/mod.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c65e8bea654e74390590f25ce804a02cde1799525131960b67c4b372ee48f5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-panel/src/applets/exec/mod.rs: crates/glimpse-panel/src/applets/exec/mod.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Exec::refresh at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-panel/src/applets/exec/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53b5cdf6040102f4f2a3f41eb634d312fc9dbfbd91e9b69a7c1de4f76776fe5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-services/src/services/exec/spawn.rs: crates/glimpse-services/src/services/exec/spawn.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SlotStream::read at line 253. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-services/src/services/exec/spawn.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/spawn.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"2110394fe7e0ada674e2064e89477d08701719bbeb20a103c942ae226b4ed704"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-shot/src/gui/overlay.rs: crates/glimpse-shot/src/gui/overlay.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Run::perform at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-shot/src/gui/overlay.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd1087909874e1de5a3e0c9c10ec9f31f0c172c6a162161ea845e58f722819b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-services/src/services/tray/mod.rs: crates/glimpse-services/src/services/tray/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Tray::handle at line 265. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-services/src/services/tray/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/tray/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb8db4f27de315dde8f309b8393e75a58734d2fd45da23e40c58f84b4f1cd69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-agents/src/app.rs: crates/glimpse-agents/src/app.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in App::ingest at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-agents/src/app.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/app.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"deba277c0435c7d126d6c4dbfbae1191a00050807babdeca1bf75c6c8b52e5dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-shot/src/cli.rs: crates/glimpse-shot/src/cli.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in glimpse_shot::cli::validate_annotate at line 497. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-shot/src/cli.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/cli.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cf6c2d51469b09be0e3bbd235d757692146d15e67b27f72df8543a469e4e58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-services/src/services/audio/mod.rs: crates/glimpse-services/src/services/audio/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Audio::run at line 239. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-services/src/services/audio/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/audio/mod.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ae918d7c9528d1d24496841b7ffffb4f69ce2fea44811fa7f34d7f0b1dc97e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-dbus/src/clients/follower.rs: crates/glimpse-dbus/src/clients/follower.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in glimpse_dbus::clients::follower::follow_snapshots at line 175. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-dbus/src/clients/follower.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/follower.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"69962e0f6f0669e554fce77188e87abea7eb20a3ef5934c265c92cde896ec882"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-lens/src/session.rs: crates/glimpse-lens/src/session.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in glimpse_lens::session::connect at line 316. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-lens/src/session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/session.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e22c0694e1b5ac42c14dec816bf69d8de7f63745206067bdbfacbdf4b7a8f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-dbus/src/clients/settings.rs: crates/glimpse-dbus/src/clients/settings.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in glimpse_dbus::clients::settings::follow at line 218. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-dbus/src/clients/settings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/settings.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8abaf3ff643e1b2d742ade07d58c643e3f1dcad0eb90c0a69af9281de76053d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/sdk-go/sdk/run.go: sdk/sdk-go/sdk/run.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in sdk.run at line 32. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- sdk/sdk-go/sdk/run.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/run.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d5c815f0f9477171230df34531ba57c779f619aed854696812c9062405c709"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-services/src/services/desktop_mode.rs: crates/glimpse-services/src/services/desktop_mode.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DesktopMode::handle at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-services/src/services/desktop_mode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/desktop_mode.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cee82febd8c5a923e491ac4fcb18926535602a648fa216b937d0af08249383"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/glimpse-lock/src/logind.rs: crates/glimpse-lock/src/logind.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Logind::follow at line 193. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- crates/glimpse-lock/src/logind.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/logind.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba8f92b3937a43b4c24c3c14f673ab8d4d544fbdb75a054fa9815fae65b8e51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sdk/sdk-py/glimpse_sdk/session.py: sdk/sdk-py/glimpse_sdk/session.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Session.handle at line 245. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 22:41:07 \u002B01:00\u0027 --until=\u00272026-11-16 22:41:07 \u002B01:00\u0027 --full-history --no-merges -- sdk/sdk-py/glimpse_sdk/session.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-py/glimpse_sdk/session.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ae85287f311248629d14d9c7d0ada7a958da0741297b105ff7d38a30fab7d7"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-agents\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-agents/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06a2d93670943565fbe2127da4136e8f6ca481af0409a570e08ed9450d47353"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-calendar\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-calendar/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e126d9883ea38d8030c794c21cbbce5454f8636abc538a9bf62f6a320f9fc0"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-compositor-hyprland\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-compositor-hyprland/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-hyprland/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15cce67d08fa40512a9b0cbc2dfffc457e28d293656d6175e43fbd5f2b8ead1"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-compositor-niri\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-compositor-niri/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-niri/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfeb3db273d4c23c60c0f9c02db469f29c0402449632af2acd2d33eec7e25a84"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-compositors\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/glimpse-compositors/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositors/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4df38536d77cf3ae1f664569d0e8ed3e19340b4945c7ef08cc7e8c97ac5319"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-dbus\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/glimpse-dbus/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ff9fbfa52586fd43725c2eb4d219628fdd4f1dca13b231614094c56ba83212"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-idle\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-idle/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cfb9b995cb6db0ef71d5f1c40b2c5bc8f7222f3234d5b4d9d5e3dcf78586dc"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-lens\u0060 is a binary crate (\u0060[[bin]]\u0060 in \u0060Cargo.toml\u0060) and neither \u0060crates/glimpse-lens/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f0a6062e6cbd317799d57997aacdc2a4f6fed369f2848e1fdfc1406dd39044"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-lock\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-lock/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad56432936ece9e94a6762f7419fba38e0072ee523b1ff1e46fdab1da0d605da"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-notifications\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-notifications/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b494123368e5ddc16cf9acb8fa4a0a3a90318ee78928e096817770f37152d339"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-panel\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-panel/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"760ca5350e0f85ee55d5a8a9d6e62da89b3ffd103ae83c2024bc459b034f12a9"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-services\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/glimpse-services/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be1a299439ce749cb677145206950ea73f4001d338b6c4e37fa591e5011ef84"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-settings-daemon\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-settings-daemon/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-settings-daemon/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3441a9b1404caa4c80199fde7e500368f4294447aaba63d00239e9dacb495b29"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-sunset\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-sunset/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-sunset/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf2ad9d18fe99b830b635ee36f33f63703af4926ab06bd06b15ed39bb92e2bd"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-wallpaper\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-wallpaper/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-wallpaper/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"285c796b241651c451607f86d1cc87f8b3f1ef7af55b59a9fdd33a77e8c4ab73"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-wayland\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/glimpse-wayland/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-wayland/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb5b0831eca00a726fa3cfe94f1a4a62b2dd367b8b967699c3aca545f76f701"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060glimpse-weather\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/glimpse-weather/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-weather/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca8881da28a66420205ea1db369552d61a6392c17823fa599b83e3853585e5e"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/glimpse-widgets\u0060 (28005 LoC, 255 module-visible types across 79 directories) overshoots its size bounds. 4 of 29 build unit(s) (Cargo, Go, Python, npm) overshoot their size bounds, lowering Project Cohesion to 7.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa976a75ff7b1e7b4e7522823697cfb8106e56031c85a1e685eaf7839aa84275"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/glimpse-services\u0060 (40241 LoC, 446 module-visible types across 17 directories) overshoots its size bounds. 4 of 29 build unit(s) (Cargo, Go, Python, npm) overshoot their size bounds, lowering Project Cohesion to 7.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f5a7672cf76c88e0b0dd8619cfb667c6565accedc9085956bbcd3b55f0ff95"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/glimpse-panel\u0060 (30816 LoC, 140 module-visible types across 27 directories) overshoots its size bounds. 4 of 29 build unit(s) (Cargo, Go, Python, npm) overshoot their size bounds, lowering Project Cohesion to 7.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd3a5a82e4196fde533505582f026d18716a61fb83835891bc2b6f118330816"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/glimpse-dbus\u0060 (10995 LoC, 200 module-visible types across 3 directories) overshoots its size bounds. 4 of 29 build unit(s) (Cargo, Go, Python, npm) overshoot their size bounds, lowering Project Cohesion to 7.3/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e95a878275efb0908edb682e9465260dd1b40a5d6260cf26fcf309de71549c"}},{"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":"2b50d6185f231a28fa9959e31861b0be76667502f1a2f794cc5c60d4fa797cb7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac8eb79dfa01848c9591d4d3d4639a6823be4bbb96d16a40df23728da77d6f08"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3cd8fd742fa804e4046a68e015cc8a40da8108e132b428402bfbc4a9946d08b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6aa6e9abeab18827585e07b28deb46a6c3f6f67cc4bc70e882e65feee62bb2bc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"355f82a533199645d0a14c460b87c7e73706d1a93f221cbf03cc09b2eaccef4b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"692e3d8e83abed9a17780742ba79d490473106f50ebdb27e4de960ff9daeddd2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60edf16ad5a78dafb29089e3e1ca579fcb9d0fc9a2dce57639ff76d0d831661e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f69fb54439f5465f5c0d430268253c5298b90252a6eb156446cf07221efc7d93"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8500bd444dd29b22a2b7ee47bd5fb7323de7a5296fca9e95d0d7da12354cfcad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6919f3c1a9925a5e880709de650ab4db90d2a386e390100a3aabc46ad9b9a4cc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4e500eb8f3049972ee742379fcc2b47352d917636f80a2bd9054aa56fed2d68"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e9e9d938b2c8da22bea3ca1a54d8a9c4f22108683329559c9cdd3187495ca2c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50adbcd711dca68f872cf2be71adcafe71227cad845e99d760eb77a975a1047e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6cd0d1f059cb845037afd99a4822a4ff5bc065cbad6f906dbd9586331a91bd60"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82c5c230cde83ed83e1ecbdefd87d9f3b94508297c4aecf4ea96f9f1c6a3f12a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b82aa180a7d16f018ed654915c770330509aa348ff3308a58d32a3150f2bc540"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f21f429bc0ca61a36e991cddc1aa218e5de32a3227076ef03f03c1ec76389c76"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"632807e29611e149a91eb241e307c37567ecc653bbcca5d4aa93cf7f7328a78d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e39c45dacade586054390853fd494a16dada5ef546debfb55c5b50156ff53095"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f3680df846e3946905d5d822e09ac8b0d116eeefaedaf7a3a4149446478567ce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"00efcbe66b74f49afe2679fcb0fb6632cfe9081d0498d21405374d6a7df5f749"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7c801a40bb66b0fff6a7d5164584bbee7739d1413ae117af1000ecb521a948d0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1f8c316f3d393e283235838ffd79685b084839342a3fa41ab3025069abac19b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d02e85495802f22e7dcf71be6d9cb0f890f236b21294dc8a7bf15c9a1ea5ae87"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1efeaa0f3f3d17c8ec1715d9fa1456315d7916d1246d6f8fd794ad84c4704a17"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f51d598102786d6fe7ccdb4c5ce07901ce46b3341024418f2338de4b1f69943"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c72f8dd0a4660c0410011ad22b062a88bfb12e99dfa88785bd553544f3303bc1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76adfb8a5ce4bd068cdc321b199b5e9f99d40cbbb09447e54b959704a0808986"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d29b94038490c84613e9786e27a95b1e6778b882160e1bb8b3d7dcc9422beff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f4b234569d9def00d491e2620fc51069056222000fc1f164e722fbe0a7130d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dae0ea0aa49629c5ca7ccce113217d8739f592122cbc2b47e7bc7c2e14d1aa99"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3560cd7f949b4f538a22ed9a986c6e55f4f69e174223eb36106d95f643d6e20c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63c4a093cd4d8270d8663d7b47af1062c73ee032c2d6873d217251d788ab2402"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f96de53a9c41aa9762bf4bb7d8c6ceb5328ca215e45d4016e18c2ff1458e371c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d541a0eb3b2dbe5998fdd42a98fc8d42f993bd63318277a56aeb54e15c268e50"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"855451eb322b80e9c22309f05343d55d411160048b3059476c34034cdd161958"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8d46bdcf42c1c606bdd786623bb0af01ceec881af0d3bbc48f063beab9197add"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7973fd69c53a62722ca791d5d8967c3c6c9c75df53abc31f648e6c16722369af"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f82a94b547e583107475ce443fc06e8d421287b4914413339b69fa88eebfa9dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9317c6bff8cff2e4a88424157c1618dbad988ca014793c84ac07ed03b4dc6dca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e92484af1fef3b4dcb7c78ad7c99b2e3ef9afcbadf8a52158104508ba920832"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d72b1d79f31eaa1e490943e6a57837b0febecfe9d326175a5e3b831906ec9d2e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8759152e6c099443e25929890290014d790d83d7c62cf3d1c4dd86aef16a908"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb0c607bd165f0cf3b34a2f73b61c1ed49abc3b4ce9af13dabc25e65096c4298"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d7d90df32a41d0b22764ca9e9e277f2d3d8367397fe4cefab8be788bc8b8cbf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6b70eb262bc47058d76fa85193c87398fcd6a8d5079c1146a947ba956b57cb7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59059d8074cdc2e0b2c8bd6f6074094960c964e546c799f9fdf27e91c5d05b35"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"properties":{"dependency":{"package":"zip","version":"9.0.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0548"],"severity":"critical","fixedVersion":"9.0.5","relation":"direct","declaredRange":"9","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dfa13d669b638471fcb2a5728baf8e2d08424508fe0538e6ced9f8dcdcb06113"},"properties":{"dependency":{"package":"ammonia","version":"4.1.8","advisory":"RUSTSEC-2026-0533","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"4.1.9","relation":"direct","declaredRange":"4","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09aadcc6f21d12b1dc09249844a2aae646dbfe24d2ce9815fa31408b55cf97c8"},"properties":{"dependency":{"package":"chrono","version":"0.4.45","advisory":"RUSTSEC-2026-0543","severity":"medium","relation":"direct","declaredRange":"0.4","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f938cc11f85764fce30b1f82bc362efb62f4166d0359677f658198be78daac0e"},"properties":{"dependency":{"package":"chrono-tz","version":"0.10.4","advisory":"RUSTSEC-2026-0555","severity":"medium","relation":"direct","declaredRange":"0.10","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b751c5129887c6a72d2838660309f93bb01a5d1e99ba6807b4d01b86451a5705"},"properties":{"dependency":{"package":"git2","version":"0.19.0","advisory":"RUSTSEC-2026-0008","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.20.4","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9985e934bf5258966ba30771d636042c3373acbe5f9699173950198ff207d4c4"},"properties":{"dependency":{"package":"git2","version":"0.19.0","advisory":"RUSTSEC-2026-0183","severity":"medium","fixedVersion":"0.21.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1eae401a2a8770be38f5a54c3afe36fa4464ebe4004c5fb285ffaa2f1ae4d5b7"},"properties":{"dependency":{"package":"git2","version":"0.19.0","advisory":"RUSTSEC-2026-0184","severity":"medium","fixedVersion":"0.21.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.29","advisory":"RUSTSEC-2026-0418","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0544"],"severity":"medium","fixedVersion":"1.1.31","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45f6c0dd73434ccd86356af3cc9622ade7a0e177107528134623e6a917ba7888"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.18","advisory":"RUSTSEC-2026-0523","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0524"],"severity":"medium","fixedVersion":"0.11.19","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.5.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"direct","declaredRange":"1.1.4","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.53.3","relation":"direct","declaredRange":"1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","advisory":"RUSTSEC-2026-0371","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"5.15.0","advisory":"RUSTSEC-2026-0370","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f67f0700e108bacf2f3dfd2008273e31f01b0ea1f2d5f9ef71c4f46ace73bbe9"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.15.0","advisory":"RUSTSEC-2026-0372","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59b61d52c55f7e96edc3d420b073f34426bdb4cebe9614ba2e8de0539ee01823"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-3503","aliases":["BIT-golang-2025-0913","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-22874","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","GO-2025-3563","GO-2025-3749","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.24.1","relation":"direct","declaredRange":"1.24.0","reachability":{"kind":"production","file":"sdk/sdk-go/sdk/applet.go","line":47,"symbol":"os.WriteFile"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 661 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 661 of the 958 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: crates/glimpsectl/src/commands/applets/tests.rs. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/applets/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"880353b24a20ac508bea3cb8cd1fca68af28d0ed6bcb4c9e9209c1c9cddc4e5e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: app.rs \u2194 indicator.rs: \u0060crates/glimpse-panel/src/app.rs\u0060 and \u0060crates/glimpse-panel/src/applets/bluetooth/indicator.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00602c082789\u0060 Drop dialog channel and raise; use prompt_entry; \u0060c3035d61\u0060 Add raise command and skip gating; \u00603649b645\u0060 Fix Gtk.Stack interpolation and Bluetooth pairing \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f154dabc5d25c4b0bf9121197cd8edf33cb2818ac014d75cf78383184525bd1f"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: watch.inode calls \u0060std::fs::metadata\u0060: \u0060watch.inode\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/watch.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2f97a1208d2d353ae9b4079c85507044c189992efcd82c30a0d410014cf113"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: clipboard.copy calls \u0060block_on\u0060: \u0060clipboard.copy\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060block_on\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/clipboard.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ce81b2104ee28fe1760754c287f5f448d5e707b6dfd983bc0396c884305c4c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: probe.pam_stack calls \u0060std::fs::read_to_string\u0060: \u0060probe.pam_stack\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/probe.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38be77d13fbeed76fc219ce92fe704b21388f673e23ebef94ccf3ed39e53cd6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: probe.shadow_mode calls \u0060std::fs::metadata\u0060: \u0060probe.shadow_mode\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/probe.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"178c8c9edf221727beb6e6c003b34bebe0d482dedd4e2241b03a47eed77da409"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: probe.own_chkpwd calls \u0060std::fs::metadata\u0060: \u0060probe.own_chkpwd\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/probe.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbaca34c4c4541965fe5fd488da187fca72c7d4b91c7b8e0cc23d9d88781e63"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: probe.read calls \u0060std::fs::read_to_string\u0060: \u0060probe.read\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/probe.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd28a7231207a71152223f43127955a591a50c7dcde78b3847e36d80cf047a34"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: user.current calls \u0060std::fs::read_to_string\u0060: \u0060user.current\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/user.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb47fbf7323926b401a847e4c0c2349fc8896fa8567ac3e66d29b1440553367"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: spawn.unlink_if_ours calls \u0060std::fs::metadata\u0060: \u0060spawn.unlink_if_ours\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/spawn.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b37d3a9669a6ba341801e83290de630acf21ac7e3e4afac336ec986951560b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: spawn.unlink_if_ours calls \u0060std::fs::remove_file\u0060: \u0060spawn.unlink_if_ours\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/spawn.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a1ca87a01a533fbe457c29b4a700478e4a3781a519c73c2d6817d3894555ec"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: SlotStream.start calls \u0060std::fs::metadata\u0060: \u0060SlotStream.start\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/spawn.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"734455ad69c6dafcfe43a76774501fa822ce1e7bb27853eb9a15ea23b55fa9f3"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: CameraSource.rearm calls \u0060std::fs::read_dir\u0060: \u0060CameraSource.rearm\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/privacy/source.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9921f8ef8478c3d5f133bbaf8e38e7c10fb4ea2edb073a285c111498128d768f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: screens.connect calls \u0060block_on\u0060: \u0060screens.connect\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060block_on\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/adapters/screens.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a36d67b7bacfc0e8579a314aff5a064c8e2a00835a1cb3078257bbaced89b8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: raster.store calls \u0060std::fs::rename\u0060: \u0060raster.store\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::rename\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/raster.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdc74fd23fe216ef6bf109e70fb1782e4ea6056222661cc37cd696a0d7bdbe9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: raster.store calls \u0060std::fs::remove_file\u0060: \u0060raster.store\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/raster.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eae0a7975d886b12173b2483f61d4479ab75fc77380c51a981e0ad34c9a06c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: raster.evict calls \u0060std::fs::read_dir\u0060: \u0060raster.evict\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/raster.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70207b2c257a873cc8d6795543f854a5dff9af20017339ad482d1652f0b2653"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: raster.evict calls \u0060std::fs::metadata\u0060: \u0060raster.evict\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::metadata\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/raster.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c193bb12504767beafce79f4f4a45d855a492d90034237262e07327be889e61"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: raster.evict calls \u0060std::fs::remove_file\u0060: \u0060raster.evict\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/raster.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56f2dcaf93861fa1bf02ae60673f2a16a85adef3149c193b61f37f377c9704f"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: raster.evict calls \u0060std::fs::remove_file\u0060: \u0060raster.evict\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/raster.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15298f396a1241ac8c81e088fdf4f7a08e4e12a8a5242eff09963f6850bab8c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Scratch.new calls \u0060std::fs::create_dir_all\u0060: \u0060Scratch.new\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/dev.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ed3435c8b7f3c3e3694032c7e1589586e6a08f955c47ba78712537d6b7076d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: OwnedPanel.start_with calls \u0060std::fs::write\u0060: \u0060OwnedPanel.start_with\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::write\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/dev.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"780a1510315d9c80d959517396593a07a70bd1884f836510b7f61b63434fe3cf"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: OwnedPanel.start_with calls \u0060std::fs::write\u0060: \u0060OwnedPanel.start_with\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::write\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/dev.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1863515c44edcf2351291333eba975a79390e92863821db1eac7f198bfe5de99"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run.locate calls \u0060std::fs::read_dir\u0060: \u0060run.locate\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_dir\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/run.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b446f187e989d7f070c3ed64a6b2c0641eb34ede061957d4212fa009fd1bde8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run.settings calls \u0060std::fs::read_to_string\u0060: \u0060run.settings\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/run.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f0639c617343d6c9cd03491cf67355d61a17d62e73886f213f48783d710d5e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: run.run_inner calls \u0060recv\u0060: \u0060run.run_inner\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060recv\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-rs/src/run.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb9a03dbbb1ca201d82d70a91d79e16bf43fe6779bc41b772870b25b0d6dfd2"}},{"ruleId":"ED4","level":"error","message":{"text":"Dual write (no outbox): Keyboard.restore: \u0060Keyboard.restore\u0060 performs two independent DURABLE writes \u2014 a durable state write (\u0060store.remove\u0060, :315) and an independent publish to an event bus (\u0060events.send\u0060, :338) \u2014 in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/keyboard.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6c6eb5264f6ed3cc09fc408b8d9357d5bb3513d462117dcf71fb78c9f6ae40"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060withdraw_device\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/bluetooth/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e529eb715dc01c4820ee92031d2cde21dd5151932c62ef2f338eff71fd0fbf39"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060cancel_get_secrets\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/network/mod.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"290b88e61c8aa3076c3cf6ed34581ea6b8d419ddecb2a96162c036e61a96dc00"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060cancel_authentication\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/polkit/agent.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"846f3b3b3c0da875cb839ed25b0837d05ff684c969bae1c623baf58c17216330"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060refuse\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/queue.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6761de9267ef086db22520e197c6cfe9560a3d5552ae04213e05f0f8e74258e9"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060init\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/load.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e4bad45b96a1dd0d1a9319b45b99702c6156ecea5a79d0b59d58d81000f7ee"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060attention_accessible_desc\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b4e0ede1825be00057a5b44b874a98807fba1decf43d3bba26d7e35e1a3343"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060x_ayatana_label_guide\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"875e8b70ba7abdaa8d0417bf8df5f8e84fc353bbdf9f659c1645622c9d147a28"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060x_ayatana_ordering_index\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5037735d06c54ca8193cf96a041148104c3c4396b5d26d9ae0bebb209553aa1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060attention_icon_pixmap\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1c59890285c7ab467759869c892ae41f6d53002daa738a1b6889c1c6f74c51"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060attention_movie_name\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cf9ce871127875df8f9adb2bf80ead1c4c17beea363f52965da1ebc2d75f4a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060item_is_menu\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1027fcd49d8cb744272be7ed2e05f506982720061b6131bb3e8b9af2b7001e82"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060send\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/idle.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"df845bcd7ef85cfbe87748ab5b3107dd965c8716a737904ecc25645bfd88766d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060query_end_response\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/inhibitors/portal.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"3249acce6007ea2ad5ee494aed7a08394cd9ca48b998f0edabe645fdcd24617e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060close\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/inhibitors/portal.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"32769f244c63a97b54cc9fb6686e7ef126ec02637f537b508bd668e4c675a0dd"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060ended\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/logind.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46b6a4e0578156b2153fc4e038638690ab4350434dad9788525e3085ac68bd2"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060typing\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/mod.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"52615ef32c87e2f7fd786f2035fc43151bc2009939a312efc5df67c3375782ed"}},{"ruleId":"IC1","level":"warning","message":{"text":"Skeleton type \u2014 most members are unfinished: \u0060impl AppletHandle\u0060 has 4 unfinished methods out of 5 \u2014 a scaffolded type that was never implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/runtime.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"517506a034f9a2eae315a9119a6b566515bbfb60c4c1ee405e7c7b459de29e16"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060configure\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/runtime.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"54719a42d428e0deb452581fb2b2dcca2c00f4f0c3e720643121b90f48928ec0"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_orientation\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/runtime.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5882423edb4063e7f33206710915f08050d30bf0a09f61c5d69eb2922bb2105"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_slot\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/runtime.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d17281f9059dfaf5b373bf9c0bba271f8e89ad643fbc02e0deb48c4593d9e7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_placement\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/runtime.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc14bba04f18cb75992a0c7eb0b41f447c061e8edc0f725fe275913405d77c8"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060entry_of\u0060 does real work, but one of its branches is \u0060Err\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/catalog.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ce4583adef6d0851a6a62b733f74770d8f0e4e1be1860bc3cb03f1943e74bf"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060close_notification\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/notifications.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"123ef4a4c2dd837a051bc16f081a170f122bf492a17c6bb6a17526db7daa3c7c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060announce\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/tray/watcher.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7a78427affb3addc84a13a6507af5dda5cfa9351d7fc9eff2c064cfbaf0256"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060protocol_version\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/tray/watcher.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a09f7bc9dd320b25514a8a79453db717c096e67b27288e8694ad239207d418"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060register_status_notifier_host\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/tray/watcher.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e44708945d819b139d1befa017d01b53148fd7c0429c61d1109476c833a239"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060protocol_version\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/tray/watcher.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c76be50945eb22f23e19e094d713f83f70615c773fddce722e0b25f023e3d6f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060unexport\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/portal.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"290d2d111f9025753d49baad2a772b9b051cda59a24a66507e9094c414afcf73"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060print\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/prime.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f67cc8c9a1b422f3ee383441cdf95a81cb9b493aef5a87f32ad0da7eea0ec3d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060event\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-wayland/src/selection/protocol.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd20bc0faf407f4db9f5c621c4a7008edd8b04f6fc0284b04c9c4f48c41325b3"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060touch\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/raster.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ea5f5c6aa5ab3e0ceb26c0d222b65543bba2032a4e7ee240678efa14ab6a4"}},{"ruleId":"P12","level":"warning","message":{"text":"Test suite runs only after the merge: \u0060release-sdk-go.yml\u0060, \u0060release-sdk-rs.yml\u0060, \u0060release-sdk-ts.yml\u0060, \u0060release.yml\u0060 run(s) the test suite, but no workflow that runs tests is triggered by a pull request (or a merge queue) \u2014 so the suite reports on code that is already on the default branch. A red build there blocks nothing and the only remedy is a revert. Add the pull-request trigger to the workflow that runs your suite so the gate applies before the merge, not after it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"731ad560de6aa35d3e92103d5ad0fbec4c54f771b709281e852941847e03ef03"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060sdk/examples/todo/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/examples/todo/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4ad80347f0a112a6ffa608334353e78400806848b26d3a672f1ce8cf3ed829"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): sdk/sdk-ts/testing.ts:108 \u00B7 sdk/sdk-ts/testing.ts:134 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/testing.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f41b1ca179ec07a328e01e5361f1854b6aa2bbdd7fc808013b411824a129d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): sdk/sdk-ts/testing.ts:97 \u00B7 sdk/sdk-ts/testing.ts:112 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/testing.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b306abee1656f33e379c83038e81187abf543fa8c0d8a6ef19c27323234c401a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function session (cyclomatic 29, cognitive 58): session has cyclomatic complexity 29 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/session.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d143bbf6fa4567ab9d9e287e697496d907a043d0a2779927b06fcb11cd4dde"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commit (cyclomatic 24, cognitive 54): commit has cyclomatic complexity 24 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/testing.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1922fc928dd5be5a3d59e36ac429984df5fd9d974b3d807fdd62a4347efcd827"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function wireProps (cyclomatic 18, cognitive 27): wireProps has cyclomatic complexity 18 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/wire.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ae19660b305338a0a96f30e121ed9df45871520403e0c5094ecb5740511da9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchEvent (cyclomatic 14, cognitive 14): dispatchEvent has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/session.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"281d6317525ad10aa1d8f510fa4159c6a291e9f170a0cc9ffddc4133ba64d101"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: sdk/examples/todo/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/examples/todo/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f4b2f8fc532a16016637c38def83640ec1c2d34e2f1d38c1128884cf437fb5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060child.submenu || !child.children.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/glimpse-panel/src/applets/tray/menu.rs, crates/glimpse-services/src/services/tray/menu.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/tray/menu.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7088e69b9ae74153ae0393f679a99967cecb204db4c3086259e1ded030afbc2d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060geometry.width() \u003C= 0 || geometry.height() \u003C= 0\u0060 appears character-identically in 2 files \u2014 crates/glimpse-lock/src/app.rs, crates/glimpse-wallpaper/src/surface.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"287b51e5c7aaca019ab2aad486f5a2fae9aace89972646dfe0e1ac62ef583fd9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060other != index \u0026\u0026 surface.lens.hovered()\u0060 appears character-identically in 2 files \u2014 crates/glimpse-lens/src/lens.rs, crates/glimpse-lens/src/session.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/lens.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fc88569ba79e6a26d3678dd17a9a7e0ea0963646e46c0b73e0ccb464877e47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.get_visible() == state.visible \u0026\u0026 row.is_sensitive() == state.enabled \u0026\u0026 row.subtitle().as_deref() == state.subtitle.as_deref()\u0060 appears character-identically in 2 files \u2014 crates/glimpse-widgets/src/session_popover/mod.rs, crates/glimpse-widgets/src/session_sheet/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/session_popover/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b590d89d588ebc73c3c6a4cbfd857093b33f40bec639d021f1bf20e0e0ea80ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060seen.len() \u003E= count || Instant::now() \u003E= deadline\u0060 appears character-identically in 2 files \u2014 crates/glimpse-agents/src/bluetooth/tests.rs, crates/glimpse-agents/src/obex/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/bluetooth/tests.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1cbe31997794d0aff83329a818a5416277730ede99e2c82f189bb6f50b5470"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060widget.unparent();\u0060 follows \u0060exit(\u0026 widget);\u0060 (line 53) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/reconcile.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b861fcf189589e4c27a3dc16d07d52fe349857bf5b12f90b6009dd33b79768d"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060if ! sides.contains(\u0026 width) || ! sides.contains(\u0026 height) { return None; }\u0060 follows \u0060{ return None; }\u0060 (line 1122) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/notifications.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1b07b09f6e5c86131057175e45504472341f2ad0f208aea3023fb3c0e1b45a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060oversized\u0060 is exported and takes \u0060value: unknown\u0060 from its caller, and it calls itself at line 193 (\u0060oversized\u0060) with a piece of \u0060value\u0060 (and at line 196) \u2014 and nowhere in \u0060oversized\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060oversized\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/wire.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec6c71beffca0c059c6c215737f3a2246d995948af2e29ac59439669141de56"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060oversized\u0060 is public and takes \u0060value: \u0026Value\u0060 from its caller, and it calls itself at line 73 with a piece of the document (and at line 75) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060oversized\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-rs/src/protocol.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"78aedaed6f7e035b02e5bc7fb622b7fca44c320e6df563a61ced725975638d76"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_workspaces\u0060 is public and takes a \u0060WorkspacesPopover\u0060 as its receiver from its caller, and it calls itself at line 33 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_workspaces\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/workspaces_popover/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"77590f07061c224f8bb55ab8bcc926b24acf5ca38c3a9b243f2b8a7d9ef67553"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060connect_activated\u0060 is public and takes a \u0060WorkspacesPopover\u0060 as its receiver from its caller, and it calls itself at line 105 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060connect_activated\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/workspaces_popover/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bffb5bdd14089b9a8a3f551cbf8d8738c1054dc65bf00d5bc52b6cd2c931cb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_workspaces\u0060 is public and takes a \u0060WorkspaceList\u0060 as its receiver from its caller, and it recurses at line 63 through \u0060render\u0060 and back with a piece of the document (and at line 113) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_workspaces\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/workspace_list/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a641e22f33bc014bfed024c985c6c48d00b331f484c82c85c1528350b3ae95e9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060holders\u0060 is public and takes a \u0060WorkspaceList\u0060 as its receiver from its caller, and it calls itself at line 89 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060holders\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/workspace_list/mod.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1c67da0cf7639910ceb964dc9baffeb0b51e7ab39b7a08c20fef701b795cd9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_unit\u0060 is public and takes a \u0060WeatherPopover\u0060 as its receiver from its caller, and it calls itself at line 69 with a piece of the document (and at line 70) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_unit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/weather_popover/mod.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44fbe75959abe2b2d573d98d0e7706f1ba3399e2648775989937581e39746a0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_hours\u0060 is public and takes a \u0060WeatherPopover\u0060 as its receiver from its caller, and it calls itself at line 75 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_hours\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/weather_popover/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b081f492afbd4f60033a521b0bd7956040cc12d8cb570b1f997053b9bd001f5a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_days\u0060 is public and takes a \u0060WeatherPopover\u0060 as its receiver from its caller, and it calls itself at line 81 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_days\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/weather_popover/mod.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b529b43b7625b142260a9e4517da201f60393c6f5bb3f9e6ca4bb271c8b84fc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_orientation\u0060 is public and takes a \u0060TrayStrip\u0060 as its receiver from its caller, and it calls itself at line 67 with a piece of the document (and at line 76) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_orientation\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/tray_strip/mod.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9d4420d26c329dee17b1b83f3b634be43c549e834c97bb558b517059acd26e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060activate_from_user\u0060 is public, takes a document from its caller (line 107) and hands it to \u0060apply_active\u0060, which recurses at line 154 through \u0060set_active\u0060 and back with a piece of the document (and at line 131) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060apply_active\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/toggle_row/imp.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"55de40416dfe34cec9356ade91cb938316183aec77fd27e1577e694bf428932e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060finish_drag\u0060 is public, takes a document from its caller (line 202) and hands it to \u0060value\u0060, which calls itself at line 61 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/slider_row/imp.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"015678d085ec32f4191da65332cf17c283cd9547002f191478d892651d89065d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060constructed\u0060 is public, takes a document from its caller (line 243) and hands it to \u0060set_value\u0060, which calls itself at line 76 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/slider_row/imp.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c048a481e89f38b07d25b828bb7b04d5ae4f856355b8d102931e0a7b96a738c4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_menu_model\u0060 is public and takes a \u0060ShotResultPage\u0060 as its receiver from its caller, and it calls itself at line 108 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_menu_model\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_result_page/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3374e29fbf0b8a85c1151253f19e6be5d453955ae3ecf5aaeac3b5bc0dd7c8d5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060add_toast\u0060 is public and takes a \u0060ShotResultPage\u0060 as its receiver from its caller, and it calls itself at line 143 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060add_toast\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/shot_result_page/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dbe93c5a7ab2f29a3a5288d055f2f2e03d7d1644d9782d219841f798b71fda"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060has_actions\u0060 is public and takes a \u0060SessionSheet\u0060 as its receiver from its caller, and it calls itself at line 82 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060has_actions\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/session_sheet/mod.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3529f9b4c2dcdabb681cea95ce5cf54b7432340cf0185c362061c77c0d768ba5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_start\u0060 is public and takes a \u0060Row\u0060 as its receiver from its caller, and it calls itself at line 27 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_start\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/row/mod.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7df9ebc115fd9113d6f483042c601fddc3c9c05b4606e5cb48c179fca16560"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clear_start\u0060 is public and takes a \u0060Row\u0060 as its receiver from its caller, and it calls itself at line 31 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clear_start\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/row/mod.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02878848ac67bded7a4f66eb07da66fb2376f1ec4810a6c7254efa3f4f5b00d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_end\u0060 is public and takes a \u0060Row\u0060 as its receiver from its caller, and it calls itself at line 35 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_end\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/row/mod.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5a88ce7910125fd99284974d85a1a4f81ba49404936dcf03968eb76d3d660b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060constructed\u0060 is public, takes a document from its caller (line 113) and hands it to \u0060set_size\u0060, which calls itself at line 86 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_size\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/popover_shell/imp.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c25fc02b23644280d5518ca4c702312f195d287a44928d1b4b000f6a02831e0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060measure\u0060 is public and takes a \u0060PopoverShell\u0060 as its receiver from its caller, and it calls itself at line 173 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060measure\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/popover_shell/imp.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0541b6b34530bd3d9fb04ec8dfcf91ca2e4dd5228ffcc934b3d467115f8e1fc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_title\u0060 is public and takes a \u0060PlayerRow\u0060 as its receiver from its caller, and it calls itself at line 103 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_title\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/player_list/row.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6a00677b1fd729e1343af54dfe444bcef8b4733b6883be09a74c1464141d05"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_subtitle\u0060 is public and takes a \u0060PlayerRow\u0060 as its receiver from its caller, and it calls itself at line 110 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_subtitle\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/player_list/row.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"54bfd1af584909396675022330db503674ab1fba3a57896d568e66f41711216a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_icon_name\u0060 is public and takes a \u0060PlayerRow\u0060 as its receiver from its caller, and it calls itself at line 117 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_icon_name\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/player_list/row.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d184ac064918e27007cc4f416deaf86562931e65da1990f6d08d33ef0c08f2d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060grab_focus\u0060 is public and takes a \u0060PasswordPrompt\u0060 as its receiver from its caller, and it calls itself at line 132 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060grab_focus\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/password_prompt/imp.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f5fa0c482714314e5ab60cd06c7065c87b2bc3d32d3b2d27f02411c0a97c15"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060submit\u0060 is public and takes a \u0060PasswordPrompt\u0060 as its receiver from its caller, and it calls itself at line 75 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060submit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/password_prompt/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4bc1f2289e626bd4395cc57574c533d228e60fb1d61bbced41eb62ea6161ea"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_orientation\u0060 is public and takes a \u0060Panel\u0060 as its receiver from its caller, and it calls itself at line 51 with a piece of the document (and at line 53) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_orientation\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/panel/mod.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd15dc37eaefb28905d0971257d5392f923112d976288a8bf48690735701605"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_orientation\u0060 is public and takes a \u0060Pager\u0060 as its receiver from its caller, and it calls itself at line 65 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_orientation\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/pager/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc0efb7610b4c58c3104f1a2933a5bab4eb19bc33b43a05da2f2ead505eb4e7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060constructed\u0060 is public, takes a document from its caller (line 140) and hands it to \u0060sync\u0060, which recurses at line 86 through \u0060set_label\u0060, \u0060set_icon_name\u0060 and back with a piece of the document (and at line 41, line 51, line 113) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060sync\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/osd_view/imp.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e1bc23af7f71b8561495057605fa7eb8b45f20a4343534c3971b4918e057ec"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_art\u0060 is public, takes a document from its caller (line 108) and hands it to \u0060set_icon_name\u0060, which calls itself at line 55 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_icon_name\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/now_playing/imp.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64c02b475fc8fa274e14d383a605be4f8f3a8b0a8bbb1d893027665d88a4827"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_art\u0060 is public and takes a \u0060NowPlaying\u0060 as its receiver from its caller, and it calls itself at line 33 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_art\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/now_playing/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b1207a99576f1b1b573081d2f9185eeb43ebcce7f098aa4abbf1a952d161e4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_app_icon\u0060 is public and takes a \u0060NotificationCard\u0060 as its receiver from its caller, and it calls itself at line 63 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_app_icon\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notification_card/mod.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb62ce1081decef25c4e4d16871ad9a525cac818148920147ceb27ba6042f70"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_image\u0060 is public and takes a \u0060NotificationCard\u0060 as its receiver from its caller, and it calls itself at line 67 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_image\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notification_card/mod.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54a3f45a368e6e827cf7011f1eaf0c738a1f41f9df92737e6a1cec8ea06a384"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_controls_visible\u0060 is public and takes a \u0060NotificationCard\u0060 as its receiver from its caller, and it calls itself at line 116 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_controls_visible\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notification_card/mod.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4e95f52bc4d25390253841b7cf9ad2e1099a9b4da907ac09ca4c4d449a2a3c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_awake\u0060 is public and takes a \u0060LockStage\u0060 as its receiver from its caller, and it recurses at line 194 through \u0060cover_when_idle\u0060, \u0060arm_cover\u0060, \u0060touch\u0060 and back with a piece of the document (and at line 247, line 260, line 274, line 277, line 278) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_awake\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lock_stage/imp.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"380babaf5e6e7fd740c6026714a2e3f65aa11809c44d29874db5bf2cabd08254"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_awake\u0060 is public and takes a \u0060LockStage\u0060 as its receiver from its caller, and it calls itself at line 83 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_awake\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lock_stage/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d05cba5ad99b0790bc6c64cdd01516be445c98efeebf4c2d194c69f2308d7a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_interactive\u0060 is public and takes a \u0060LockStage\u0060 as its receiver from its caller, and it calls itself at line 76 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_interactive\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lock_stage/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"049f667fb5d360cfa57eb5d3b83bd058f0dccdfedf919d4c5c1153edb5454810"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_user\u0060 is public and takes a \u0060LockStage\u0060 as its receiver from its caller, and it calls itself at line 96 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_user\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lock_stage/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"252b9e9a9c3b7417b634c6235ea5b1560ae8b9d41b9df7dc56e3fbe9e31df9a1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_message\u0060 is public and takes a \u0060LockStage\u0060 as its receiver from its caller, and it calls itself at line 111 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_message\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lock_stage/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b994a719fb1d278d8451a5c5495929963dd18f6c0af9219c738cda612038a1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_busy\u0060 is public and takes a \u0060LockStage\u0060 as its receiver from its caller, and it calls itself at line 125 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_busy\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lock_stage/mod.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c6f1a6493f1b9b42425c8173fd99b375918088e3f9230c5646eed8f04c5a8b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_battery\u0060 is public and takes a \u0060LockStage\u0060 as its receiver from its caller, and it calls itself at line 143 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_battery\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lock_stage/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"189f4c3162c7f8b5a08d3f51f26d159ad6edd5393c9d85d49f313207d36baf43"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_notifications\u0060 is public and takes a \u0060LockStage\u0060 as its receiver from its caller, and it calls itself at line 162 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_notifications\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/lock_stage/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"765c98cc3a1c71091de29111a43939fd7b6db2c8bb5bb734562b497af1e9df2b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_orientation\u0060 is public and takes a \u0060IndicatorGroup\u0060 as its receiver from its caller, and it calls itself at line 26 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_orientation\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/indicator_group/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06afdcad36f4bbc938e462c0edd977c53d5c41974a33c406fe7bc8b969077c1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_inhibitors\u0060 is public and takes a \u0060IdlePopover\u0060 as its receiver from its caller, and it calls itself at line 47 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_inhibitors\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/idle_popover/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadb2d58a6595e772f36a82afc478e5d6d996d5be2e3eef4940bcb12aa07b597"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_end\u0060 is public and takes a \u0060ExpanderRow\u0060 as its receiver from its caller, and it calls itself at line 36 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_end\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/expander_row/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6fae853079f4664da9d64c6f05e673b2e029a82f246ed0429b2ae9ba28070e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_start\u0060 is public and takes a \u0060ExpanderRow\u0060 as its receiver from its caller, and it calls itself at line 40 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_start\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/expander_row/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a46d1c1799982d0f0df12ff7dcdf5ab9b5e0b9a1820048b502358a95e7ad012"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clear_start\u0060 is public and takes a \u0060ExpanderRow\u0060 as its receiver from its caller, and it calls itself at line 44 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clear_start\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/expander_row/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5041e7065db0e05d5bcf15cf03faa12d2e297ca703866d749df9512a896f920e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clear_end\u0060 is public and takes a \u0060ExpanderRow\u0060 as its receiver from its caller, and it calls itself at line 48 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060clear_end\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/expander_row/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b105b215448ece1248db836b3f9eadac5718d4a0c5e9828b867c30841e2d028b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_openable\u0060 is public and takes a \u0060ExpanderRow\u0060 as its receiver from its caller, and it calls itself at line 52 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_openable\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/expander_row/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"262bfafbf475efd6729474f93f9be1544f6ee1d1aaf09c0ac302419534463270"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060grab_focus\u0060 is public and takes a \u0060EntryRow\u0060 as its receiver from its caller, and it calls itself at line 176 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060grab_focus\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/entry_row/imp.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"6872e588951a0b26fd9e67581f34bfdb87feaca83571d885571ea334a89beb8b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_sources\u0060 is public and takes a \u0060DisplayPopover\u0060 as its receiver from its caller, and it recurses at line 49 through \u0060render_sources\u0060 and back with a piece of the document (and at line 257) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_sources\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_popover/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d54600344125fb3a7d308dc485e3e57aa5442c615ebe30280254df4646b9610"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_displays\u0060 is public and takes a \u0060DisplayPopover\u0060 as its receiver from its caller, and it recurses at line 83 through \u0060set_output_power\u0060, \u0060render_displays\u0060 and back with a piece of the document (and at line 92, line 362, line 363) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_displays\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/display_popover/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbc3e39ff4201df37b670fb345999d1400118f046901294d5cd1a64d5ceab73"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_actions\u0060 is public and takes a \u0060ClipboardPopover\u0060 as its receiver from its caller, and it calls itself at line 39 with a piece of the document (and at line 40) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_actions\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/clipboard_popover/mod.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"17977efc23847911ee4c36d51fa8b6346609f6fa32d7cdd6905b4f1c8316efef"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060selected\u0060 is public and takes a \u0060CalendarPopover\u0060 as its receiver from its caller, and it calls itself at line 33 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060selected\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar_popover/mod.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8431754fa4581319f0359fec41b7ae147f2d98477dfdd9e3279006425ccc3021"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_zones\u0060 is public and takes a \u0060CalendarPopover\u0060 as its receiver from its caller, and it calls itself at line 92 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_zones\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar_popover/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6517e3803a4d5f4f745c4b9e730a388c66f4df6aa916d5a1e6e7d49b53bf82"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_now\u0060 is public and takes a \u0060CalendarPopover\u0060 as its receiver from its caller, and it calls itself at line 96 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_now\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar_popover/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6c093fca57e88930b873f4175c5a53bbb91038542d15e6ecbf810dd4455414"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_twelve_hour\u0060 is public and takes a \u0060CalendarPopover\u0060 as its receiver from its caller, and it calls itself at line 100 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_twelve_hour\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar_popover/mod.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"55963eaf6544349884561c1e0e3710616c9f70acfdc3aad3a18567fa2d1e45bf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060select\u0060 is public and takes a \u0060Calendar\u0060 as its receiver from its caller, and it calls itself at line 45 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060select\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7930b486d43d58880da085cdd123643495dc0a14306a5d9053a89b3db95603af"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060step\u0060 is public and takes a \u0060Calendar\u0060 as its receiver from its caller, and it calls itself at line 59 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060step\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/calendar/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b7c544e183a7fe7ebb9fd06022a6f09baa6bad9d612ab2858b150e6bbfa25a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_details\u0060 is public and takes a \u0060BluetoothPopover\u0060 as its receiver from its caller, and it calls itself at line 61 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_details\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/bluetooth_popover/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0159b2dff66786165c543c722b23e3043a966f23d17a2f3a43326d847f30e1a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060hover\u0060 is public and takes a \u0060Canvas\u0060 as its receiver from its caller, and it calls itself at line 1402 with a piece of the document (and at line 1491) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060hover\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/canvas.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f22dedfe57fdfc6c61a0612c09c46b52648f84bac4d49cf047b18f7def491a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060model\u0060 is public, takes a document from its caller (line 68) and hands it to \u0060build\u0060, which recurses at line 77 through \u0060entry\u0060 and back with a piece of the document (and at line 98) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060build\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/tray/menu.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a915f1354c08b5e33cf4d72e5a7bb7c8d84b15dbe6e23f02a984c15bf23b0656"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060actions\u0060 is public, takes a document from its caller (line 128) and hands it to \u0060install\u0060, which calls itself at line 149 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060install\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/tray/menu.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"569109c264c81a19fe180892215c8d442e4d729922efe506b34a969c42a9defd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set\u0060 is public and takes a \u0060Marks\u0060 as its receiver from its caller, and it calls itself at line 263 with a piece of the document (and at line 264, line 265, line 266) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lens/src/marks.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d77ac91aaafb96d164cc3eee0d6aeed30afcc8cb5bd440ee2f39f6906ca0f3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060root\u0060 is public and takes a \u0060AgentDialog\u0060 as its receiver from its caller, and it calls itself at line 167 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060root\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/dialog/imp.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cd2103075441bed512afc5ff559a80ce7f51deb4dbd6a1a753a687c465a449"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060show\u0060 is public and takes a \u0060AgentDialog\u0060 as its receiver from its caller, and it calls itself at line 153 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060show\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/dialog/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"035ae592f55d3bd102d17f0c4b1a32b52b1a9ffd60d77f24e9c4eadc9c8d6a06"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060session\u0060 (line 56) is a \u0060Session\u0060 this function owns and never releases: no \u0060close()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Session\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-rs/src/run.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daf9e219d6d6e9e424ce107726cb5164341532d86ca21bb4a6de43e6314ce7c"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060section\u0060 (line 88) is a \u0060Section\u0060 this function owns and never releases: no \u0060print()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Section\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/doctor.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d283870812e5b3a80d579e136267498ec8a0b33c1d358a45809acb0fa7cc65"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060section\u0060 (line 144) is a \u0060Section\u0060 this function owns and never releases: no \u0060print()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Section\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/commands/doctor.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"633287d6301ae6067787a43d71548964140ce5d2771eab44fd8a26a7bc592b45"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060section\u0060 (line 142) is a \u0060Section\u0060 this function owns and never releases: no \u0060print()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Section\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notifications_popover/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd956a405262054e1bfc00ea671260740c999d9a0948a6dfaf981407e6650c28"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060section\u0060 (line 495) is a \u0060Section\u0060 this function owns and never releases: no \u0060print()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060Section\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/exec/dom.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"496f5425e8123c8a1b773edf91f58883c194b0d75ae470db985847d04ff5cbe4"}},{"ruleId":"X2","level":"note","message":{"text":"Not all functions that make a request accept a context.Context: Only 0/1 functions that make a cancellable request (net/http, net.Dial) accept a context.Context or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a cancelled request, a shutdown, an expired deadline. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it (\u0060http.NewRequestWithContext\u0060, \u0060DialContext\u0060); where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"faab330444baf00d50193f250b5c9b514f84cdca16c24014ef3776329847910c"}},{"ruleId":"X2","level":"warning","message":{"text":"Function without context.Context: run: \u0060run\u0060 calls \u0060net.Dial(\u2026)\u0060 but takes no context.Context and reaches none its caller controls, so its caller cannot cancel the request once it has started. Take \u0060ctx context.Context\u0060 as the first parameter and build the request with it: \u0060http.NewRequestWithContext(ctx, \u2026)\u0060, \u0060(\u0026net.Dialer{}).DialContext(ctx, \u2026)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-go/sdk/run.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"af13a16df12a961e945438e7108f2e0c07a6510b83ad29bff956750f22902212"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060tracing::debug!\u0060 at line 254 is called with an argument built by \u0060self.applets.iter().filter(|slot|slot.handle.is_some()).count()\u0060 (line 258), whose cost grows with the collection it walks. Rust evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because tracing::debug! is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060log_enabled!\u0060/\u0060tracing::enabled!\u0060 test, no debug flag, no \u0060cfg(debug_assertions)\u0060, and the work is in the argument itself, not deferred into a field the subscriber formats or a closure the formatter calls."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/components/panel.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"537f85c6509a0f2ed29e94817c466f695735471fd0ddf51083b5f4b659f638be"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SliderRowProps.on_move\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b64fce8c524561cb648db40e5777e9de58d9b53494921a23284c86ee026f5fd"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SliderRowProps.on_change\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d50033c07b30ae5bbd51443e2a96988731266314c451ddceda23e637d8f8982"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060EntryProps.on_change\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0797dc8d4672ad38275781bfa13934ddd347d1a881bbf9cc03ef3a56b792c53"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060EntryProps.on_submit\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4add724e66e817e127ac56896ff3a47b38ac51a1ac232db4b70587a45c14004"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060EntryRowProps.on_change\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1a69641eff05ea810d42d2f811df2b9b566694aae44d56b30dbe9d469a6289"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060EntryRowProps.on_submit\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d14d00a7f51ca17ab57e33956f0e0f4809cfbcd09f9d31bda053c92c38e87e7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ScaleProps.on_change\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8873293f3a8917335e187c1fdfbc0d02d706cc014a3177c4a47b4d26229c960"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ChoiceListProps.on_select\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"6662ab59fbd4388a5cd3ccef2f8d75d029decfb9ab04a84ea9278895f8740ec7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CalendarProps.on_month\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5378cf0e118ee16103440cd909750e672bc6ac63e30cd8f5fd0489e9277d1e5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CalendarProps.on_select\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"823f3ef399fdb6deb73d8f733a712096583d842da1c79c4220ad61adbe59c35f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DropDownProps.on_select\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/exec/tree.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6901c0b363e57c7a4ba36d548d35ef1233851fd8c2b6e72270c74813fc3b97"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060IdleCommand::Inhibit.lapse\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpsectl/src/cli.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"15630e118a41cfed33491f816844d7f630cf381e78135f2e284502c32333701d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 24 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-weather/src/main.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e533a5fadf70c8ad7ed961b43418702814ebfff2566c06fb6de68b2ef9adc2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 20 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-wallpaper/src/main.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98fc88c0ea0d37080e6b3c47b10fa96a786cbc98d1a8f908431d66408541030"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 301 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-wallpaper/src/surface.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f70bfdde00e001b5756f0b0ead6a89f2950afd936a3c74cc507a732d400a95"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 26 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-sunset/src/main.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33d6ad157af0e518895255f8f7dd7bca2299d55ee5abdc37598a3ed02c4d641"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 327 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/headless.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e51d548d517760b73ae2697b08d4584c51982bd6503d5d9490fd01f09394596"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 132 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/hold.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eeda025b69068b5f8d01b540812cefbebc3c7b47fd389b79f419e6942a62422"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 128 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/main.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afa2d981535acbffa036a317fc9b4d15f2804de752698c464974fdebd37adf2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 63 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/notify.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d12eee47b7dc70f4ad6e70acbdfff03e68a17f589475c849cd6007f73bc6426"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 184 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/notify.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7155a737e42356a8d710d5d4009b10e2ac3a409cc257b5a1cb26cd37e67ee9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6761ca140d063998ef7854046bb4204212fc3c9037677e7b1683882bf36ad5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 163 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fd865eb9333c2135dd7e555bdecbdb36ba295d515df56cbb1b41f12523c146"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 180 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ac0e6d367b508bb66c353c09a75737560cba2e2b68c4da79a6ba9251d96553"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 434 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef5b28cf4b9cd94f7545e9eca13bf42714772e8369e4112de7d2cb3b617b895"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 442 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d49efe8d48988f82c22dc03c55e97ebe99a4eed5fc28876a23b5ceb40ef0d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1116 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/app.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ff7c97bf0e14c0f2d6cc0d122c4f2f5df5ff9a8be9b97c800ef73ccb0a5f69"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 39 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/mod.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0036434fa1e73f16254a54b042464e9da8c9609a005b3d63c0fd524d4553f0f0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 268 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a449c50fc4f06ddde67d9d920f596b4c0dcc701738d57552129e7e3b8beb37"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1419 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/overlay.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"025f024e68e96947f20e50e05b06e447dc6ed52bb4926e9b696a40840a4d993c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 246 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/prefs.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80c3032b17edb2870c85e59b46079d77edcd8222be76dfaaef0afc573dfbbff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 290 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/prefs.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"853b81147a3f204bd23c1910bc63e5b6ec310c8c4fded1aad152f8c15bcbd03a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 294 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/prefs.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c38a0160b60fd9a8f90a482a66dacd406dff63f75c0da1f2e7dd9cfba33996"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 498 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c3a56957e27fceb123e0ea331373dc1f311e7b72897e5735b8c15c130d0fbc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 508 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a7ae9f6a8eb5937e1fd41480f2c41f0ae628ca892fd5695edaa00759bc657e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1142 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf28161a00684fd86fa8b3e05b62989b0b75f5ae2a3dd2db8d7fb954982583c0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1216 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede6d5f67f5821f19bc8897ef93afdaced30d275c22358ef15ce04ab0d9432e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1229 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/gui/result.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd34ae30a09de23de270e14c46897f90bd9737db9aac2bc3b2c2e5e9f8faad1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 114 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/adapters/windows.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9559bae4069d6cd9ea2fe26f39fd310381c25fac980090084472ca875c897427"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 123 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/adapters/windows.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d05e79fde816ddf48ea2942399c6f1e5996a07cca5dc757002339f7453baa7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 133 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/adapters/windows.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2d0b0af9f0cb47f49cb8aaf591be165de450d1cf3cd411134adacd5c30a15c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 26 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-settings-daemon/src/main.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc7beea24e3954279746e0d91cf08012cef474c8d1118a232464121d5d48fcd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 37 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/weather/met_no.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"013724ef08ef175d0e9927519ea1a2b90f34470837853a676fae462078e00fb9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 28 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/main.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2d28d78dcf9d26380a17ab7c62c976e74b21b7d8ab7fa81ecae9b866e9f522"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 40 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/osd.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c62ec8d66a0dbd20a563db17c7829645dcfb14ba26a41f05254814181893c51"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/osd.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"63923210ef8e58773991851ae1a3c34a77c1acc9ec69f9e3520d4d8aec3ddf34"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 332 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applets/clipboard/indicator.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d056bf4522e2cb5d63d5a6f22285b45e08b98a2b164c5164d7e8213b0e73159"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 22 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-notifications/src/main.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d20528c7da9c547a34de41401ece94335151e774207446766ae4236258c6c7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 853 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf06f8b673e2317deb51d56d4f1662aa6e9478bd6437bbaac740bd59179c1837"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 937 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ac9db9d47726e955cfbe61b1f8b268feccd5d3e34819d3f0c39d4366088268"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1184 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/app.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b5b1378b2fd41405c1847c0bf645ba3d8b827d8bab36efb178be46e59ee52c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 65 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/logind.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68d92b03b2e21fba8b3ebb2e7c70183065ed1cd7171320fb4c607395a046f6c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 40 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-lock/src/main.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77a7510d12300058c2a7b73344f6940399229f62c3f7a68a18c9f515b63ef9a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 27 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-idle/src/main.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5089725fcccb39ebb172d6e3c7c11732837e5dbcf754a6557dda21bb39a3c8b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 404 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/idle.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1bf2154ca07a1c9db5476387ee73b290103548ce99badfd009396c89927709"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 447 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/load.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1b3e4295efe5c6ad0b5da4ad947706a3553da7673b32338a5cb9a3625e348a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 56 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositors/src/provider.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e39f8801f4ed27c6621288410b160c67202432519303082abb77859169d9291"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 25 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-calendar/src/main.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d0486cb3246a43f40ec15c80e69a156d59c4151162dd88adad86ff99903535"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 30 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/lock.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e7efb6b919d6b8ccbcdf53241e00f3f25a7ce1421229aeabe5d3f7595b4184"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 28 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/main.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"097f35f73768dd7996bbef4aa7a66a712a01103a5757db74bb882bfcdef07c95"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 49 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/main.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6618db55324c2523e0acb6d4674e248f1f373d15da67a0207c3e65883314c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(parent)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compile_blueprints\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/build.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"84499c56781216c71a5e0bb707018686c005a9749a58b1672c6ce9dd443f6833"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::process::Command::new(\u0022blueprint-compiler\u0022).args([\u0022compile\u0022,src]).output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_blueprints\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/build.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f840a36cf7d14a54280f5716a2f67140b414b86903bf8b20337d451a813c4b8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(out,\u0026output.stdout)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compile_blueprints\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/build.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f7418d96bd5239b625e0e18771dd73cc854ff9bf8dfdbd79fa3860c386b53f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::register_resources()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060activate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/preview.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce167ea79fa21717c1c4c0b78b5b7138e427f7397af513eb583b60e63168e0ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060imp.chip.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060header_control\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/notification_stack/mod.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf2b4b320daeb51617f197b89083775ebbbc7a7b60b0cd29c24666991f0c877"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060holder.clone().downcast()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060apply\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/event_list/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"a003a2d4db9c836b0e0d13dd73d18f93c5607db6a3e0cbf7aaccba2389997524"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060container.first_child().and_downcast()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060heading_of\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/audio_popover/mod.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3b3a125b308b50f9deca9e9b7dd68be7c3ab44e13a8fbe6790702ccdb481f9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060heading_of(container).next_sibling().and_downcast()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060slider_of\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/audio_popover/mod.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f2119d8e2a097b020abcaeca7bdae2276b4c7b7ed1298485629f1f064a97b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slider.imp().start.first_child().and_downcast()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mute_of\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/audio_popover/mod.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d4af242790ec7b4777360d4a87d23054e42474f3a5c21cf83da3da9fbe914a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slider_of(container).next_sibling().and_downcast()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060devices_of\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-widgets/src/audio_popover/mod.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b6fc6c5568fb0fbd69b902436f25e062c55a526a74886cb4b65cbfde6bb468"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060context.with_thread_default(work)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060run_in\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/testing.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"de8d481524c7ed1ee5a73c8dc00b88681841fbda02081b059c9432f0717f334a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060context.acquire()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060driven\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-panel/src/applet/testing.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"988a61a7fe7356abe077374fbef071c94712bcb564a985928c4a8ccbbcb68fba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060OwnedObjectPath::try_from(NO_FIX)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/geoclue.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c7e7c02ec0b505423abf629e1b25138f429745f7908d95d86df452ea722d8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060OwnedObjectPath::try_from(format!(\u0022/org/freedesktop/GeoClue2/Client/{ordinal}\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn_client\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/geoclue.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3c4d69286421d5481bdedfda369c120bf00a8a3ce3ef534f7b964748ef470f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060OwnedObjectPath::try_from(format!(\u0022/org/freedesktop/GeoClue2/Location/{ordinal}\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060push_fix\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/geoclue.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca3c47336a7f18904541674c1fdd848a00c3648a8dee9c77f9bfaf43c615cd7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir(\u0026scratch)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10a74f320f664dc29f723f3a8f66f276f46243019ca13ee4c873386b10f8429"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir(\u0026services)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3041c1fd5bf8b0b2ec1ecb6cd45ddce95a03acf79393961ce7bedca90f13cc49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026config_path,config)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/mod.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8930d79ea37afad77be318eb5faa6db40421c48db682f31fbe3c09e67b2eb667"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Command::new(\u0022dbus-daemon\u0022).arg(\u0022--config-file\u0022).arg(\u0026config_path).args([\u0022--nofork\u0022,\u0022--print-address=1\u0022]).stdout(Stdio::piped()).stderr(Stdio::null()).spawn()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/mod.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6062ecc13dd2d4dba22faff69fa63fd8e9468f82153820a3ea0bf5aa60d4970"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060zbus::connection::Builder::address(self.address.as_str())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060connection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"105e04b5ae0eb23857b1c0225278f028a0ba4dd044218a0c5f7a89bcd39cf4db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060connection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96cce84da38cd4699fd1799f485ed3388cbcc9cc68e7841cffccb0e380cf22a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.stdout.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060printed_address\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/mod.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"860c2db286a65f269b1583406a15d084be7db767a7414c98cdcac8be291ae8a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::io::BufReader::new(stdout).lines().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060printed_address\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/mod.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5d741d3d0df638aa962a8cf708292b9ec26131ab8976314f8d4abe5bed1482"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::io::BufReader::new(stdout).lines().next().expect(\u0022an address\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060printed_address\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60510706d36cba5b038bcfc8ae716dee83dab58eb360dadfee4074ae2f91c16"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ObjectPath::try_from(path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060menu_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d35265ad92a42265d9d88d17aafd37f98cbeb08b4b3a49c44d6bcfc9f7a080"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060OwnedValue::try_from(value.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060properties\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b88d4912a057f058a693d1f524e4291bdb7585a3c2a68e0f9fa78a3561c7c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060OwnedValue::try_from(Value::from((child.id,properties(child),children(child))))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060children\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/testing/tray.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65add560ef0562aa78605e1d8a0823223e4d5c3d2e229442ad300dfdee40de1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060toml::to_string_pretty(\u0026applet)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060applet_defaults\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/commented.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ae37929cc0c3a0774ee9f3843142d1203534e1db8cd401d859a6ee7b390b7e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string_pretty(\u0026schema)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060json_schema_document\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/lib.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd296094b37213adbf16121cb4279cf9a8d8974f3b64a9ed1af97470977a6eac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060toml::to_string_pretty(\u0026Config::default())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060document_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/lib.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"799a4213dee135aa71fcd2b4c8ff308e1b29ec21b46923afd4df7061fcf7e0cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060body.parse::\u003Ctoml_edit::DocumentMut\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060document_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-config/src/lib.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"41870aa08178ef040a5f83b0d57d76557ed7208f34d204325d9d48ac5fe8c89a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tempfile::tempdir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-niri/src/niri/testing.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fdc82becb06c60b538951707b5b11acaea527e48b2253fa2fbf4c01821e603"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060UnixListener::bind(\u0026socket)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060spawn\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-niri/src/niri/testing.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da21fc589ac1acd8279b99fa00c29fecdaf038cd16641b959059ee0da204fca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tempfile::tempdir()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-hyprland/src/hyprland/testing.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"852f8c7055f05ec8c95e5c6da1bbd8247bc81a8a57176ccbfb56dc56452104f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060UnixListener::bind(dir.join(\u0022.socket.sock\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-hyprland/src/hyprland/testing.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a9b33b6a655374365df1ca6a2aafc04c94a1ceff6bad1db65d68b699f80ba0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060UnixListener::bind(dir.join(\u0022.socket2.sock\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-compositor-hyprland/src/hyprland/testing.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7948b13a0a8d3df66660527a5e094812d86cc3ffa3bbb3ca11b60a3fbc0ac07f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::process::Command::new(\u0022blueprint-compiler\u0022).args([\u0022compile\u0022,src]).output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_blueprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/build.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e3b92ad74e2e5e05493f43cf62e98733c972383953ba7b932974b5d909c4cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(dir)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compile_blueprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/build.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d77c32cbc85eca8b1bf56f8321bb2b19d12dd1643e76141bdfddd1d89ada2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(out,\u0026output.stdout)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compile_blueprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/build.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"688e3fccee279e90a5b9a60cc7e0eaa0613527842c09ae46be34aab59fc0316b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060update\u0060 turns every \u0060Err\u0060 into \u0060Update::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/obex/notify.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9398761d5b7726181fa56f7073e142058dbfb032218cb8b516345a52dbc4758b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060real_names\u0060 turns every \u0060Err\u0060 into \u0060HashMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-agents/src/polkit/agent.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"1099a917700d954316500741036c443f57ee1bafba35112ee10cede32276a56b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060panel_app_id\u0060 turns every \u0060Err\u0060 into \u0060\u0022me.aresa.GlimpsePanel\u0022.to_owned()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/applet_host.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ea3c7701a621fcd8cff89d846ecea82f02a47231fb65f98ab050a47671657e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060decode_ip4_config\u0060 turns every \u0060Err\u0060 into \u0060Ip4ConfigProperties::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/network_manager.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"7242db8763ec0fa5ce498aa0b46557f48e48ab1fbf4779a5b369c07d74737bc2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060pixmaps\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-dbus/src/clients/status_notifier_item.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d913ea49e66cf314126912374a35497c2a7793b72d6d21327b4f3d6446d5e01"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060loaded_plugins\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/kdeconnect/source.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d894ea76762530dc1c064983bcda74bf565fc28a9d73a8796e1ab743143c65"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060holders\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/privacy/source.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d9001c6744e1b8c1bfc3388efda01783dff6b4468abc5ad2d972c40ef24e3a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060vanished\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-services/src/services/tray/watcher.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"70457af5b75db75a697647eaf25e43dbb7e3a48763410a6ed11302ab0638ccfb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060geometries\u0060 turns every \u0060Err\u0060 into \u0060Some(HashMap::new())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/glimpse-shot/src/adapters/screens.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e971b57513026548c561dcbcf86c770c6678e60b1af28e93d811e903ca6c026c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readStateFile\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk/sdk-ts/hooks.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4242c3a9e3842217ed618a38cfc96c2e8c15f522afb36db3b65db5ed8307198a"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":71,"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."]}]}