{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"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":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"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":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"App::handle_user_event (cyclomatic 66): App::handle_user_event 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":"src/app/lifecycle.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2be363d753bd19733931765489dad4eb30f88fd60ccf7b386e5ace1d64f771"}},{"ruleId":"D1","level":"warning","message":{"text":"Rule::overlay (cyclomatic 53): Rule::overlay has cyclomatic complexity 53 (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/markview-layout/src/style/types.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"d498b9d2a670e16d2973956b346012a77457ad8dd92720900847566fb800d578"}},{"ruleId":"D1","level":"warning","message":{"text":"Lower::table (cyclomatic 48): Lower::table has cyclomatic complexity 48 (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/markview-webpage/src/lower.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"b954f3395ccf7c41587bc7bf24ce6f74f345a83d86281ede58bbe47332ee8090"}},{"ruleId":"D1","level":"warning","message":{"text":"extension.activate.open (cyclomatic 44): extension.activate.open has cyclomatic complexity 44 (threshold 15). Most of this is not in the body itself: 3 of the 44 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 135, publish, a function literal at line 210, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/vsc-ext/vscode/src/preview/extension.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73b90b6015388237d405e6b9c3824f062f13d09ed2169611fa818f3a7447ba3"}},{"ruleId":"D1","level":"warning","message":{"text":"MermaidStyle::overlay (cyclomatic 42): MermaidStyle::overlay has cyclomatic complexity 42 (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/markview-layout/src/style/types.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e666112725e7b3b0aadb3bec114e71c12e6e7a198d998caa5c9d6f6cc31c5a1"}},{"ruleId":"D1","level":"warning","message":{"text":"markview::images::diagram::resolve (cyclomatic 41): markview::images::diagram::resolve has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/images/diagram.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"4216b104ee1ba4a236bd53610ff8d656a7f903bffc2451e909588c09a2d6a11a"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::child_block (cyclomatic 39): Reader::child_block 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/markview-commonmark/src/parse.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb66246c62d7578ba5d1bf67958275116cf419fe915739c41aac607be7efb73"}},{"ruleId":"D1","level":"warning","message":{"text":"Painter::draw (cyclomatic 39): Painter::draw 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/markview-pdf/src/paint.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeb3c8a5b87aff206ce37ebad87a8a01365959ec9b931fdbaa1f080f3a02597"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::draw (cyclomatic 37): Renderer::draw has cyclomatic complexity 37 (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/markview-render/src/paint.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7c11fe5bd74b1ff9c335aed703b2cd967b7e9f32d245fb66e67123a0becfca"}},{"ruleId":"D1","level":"warning","message":{"text":"TextShaper::shape (cyclomatic 34): TextShaper::shape 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/markview-layout/src/shaping.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e718d2a726dfd52263af0facdcd2ca0b40af32b61a6b43654ad8ed82ffac12b"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::update (cyclomatic 34): Model::update has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/settings_panel.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f33b1c37ba969d020fc12a67def95ded958a940e1ef17151e70a8441feb3fc"}},{"ruleId":"D1","level":"warning","message":{"text":"App::dispatch_key (cyclomatic 34): App::dispatch_key has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/window.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf508f593b1fc293772c987abe721c15477f51cfc0fe56c8157acdc9edec4829"}},{"ruleId":"D1","level":"warning","message":{"text":"CanvasReader.bindInput (cyclomatic 33): CanvasReader.bindInput has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 265, 259, 235, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/markview/src/reader.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"54594bb43dcae81543348595b81f63ed85fc9b14371032625b79691ce9c36475"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_layout::style::parse::generic_field_allowed (cyclomatic 31): markview_layout::style::parse::generic_field_allowed 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/markview-layout/src/style/parse.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a608c811ff20e628f3f0da0cabff5ff2b1400b7cb67c729f0c170b4acff523"}},{"ruleId":"D1","level":"warning","message":{"text":"Worker::with_services_and_parsed (cyclomatic 31): Worker::with_services_and_parsed has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f9cacfdc11b4432b0a037c8ae784d32d1f6e0af4a1c8a0e55981796e49e15d"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockContext::table (cyclomatic 30): BlockContext::table has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/table.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edffb2cd70fbe20f6a1db7dab9de7285b05f7a1c37fa60cfca9faed14273ad3"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_layout::linebreak::optimize (cyclomatic 29): markview_layout::linebreak::optimize 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/markview-layout/src/linebreak.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e52232effb0ce27318063afa43c70684f42ee8bf0fa218de59d0e34bfe635e"}},{"ruleId":"D1","level":"warning","message":{"text":"webview.update (cyclomatic 29): webview.update has cyclomatic complexity 29 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 5 belong to 2 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":"web/app/vsc-ext/vscode/src/preview/webview.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40b3cd4ad37a344919b0c51c8ea3968f5e80071b99b4296f47f677662bf791f"}},{"ruleId":"D1","level":"warning","message":{"text":"build.main (cyclomatic 28): build.main has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/build.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3d6bff70e5bdf4fe8a9e0f5dca79be6b8854d8c30f14d3ccc7bec70a506b32"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_document::visit::walk (cyclomatic 27): markview_document::visit::walk has cyclomatic complexity 27 (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/markview-document/src/visit.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"678664f307be6400560f235219a19dd3c9df959fa267cb6c4a0e7e580d6597b4"}},{"ruleId":"D1","level":"warning","message":{"text":"App::render (cyclomatic 27): App::render has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/painting.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c187b2cc59b2e20928a7923eae3079cbc50035460e8d70cab569a0803cac38"}},{"ruleId":"D1","level":"warning","message":{"text":"Block::images (cyclomatic 26): Block::images has cyclomatic complexity 26 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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/markview-document/src/lib.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc1a2ddc2fc9f95868e199b8c79b2f92b0a513481cf5dfc2926940383f0f6fb"}},{"ruleId":"D1","level":"warning","message":{"text":"App::scroll_event (cyclomatic 26): App::scroll_event has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/window.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"018e78b7e4b8d9ce5ab2a9462f374297c118474721329593d78080d66f830526"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::inline_step (cyclomatic 25): Reader::inline_step 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/markview-commonmark/src/parse.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe8ac2e9baa58aad9faa538e39f43b6b4e966cbbceea3dbfb9d649c2e5ca347"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkviewActivity.receiveResult (cyclomatic 25): MarkviewActivity.receiveResult has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/java/io/github/szdytom/markview/MarkviewActivity.java"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e969c778d90e39710912ac507ad261efba003ec0db6605c4c2bfb1a0997a064"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_platform::window_frame::subclass (cyclomatic 24): markview_platform::window_frame::subclass 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/markview-platform/src/window_frame.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be9426b4927297159e6c2369e345dcd84753bc68361743dd1b7c85490e955d8"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_document::semantic_key (cyclomatic 23): markview_document::semantic_key has cyclomatic complexity 23 (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/markview-document/src/lib.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b2b7604a1298c8689f8625584ad56b3420956f5121e0688a7a2252435e0278"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_commonmark::make::walk_fields (cyclomatic 22): markview_commonmark::make::walk_fields has cyclomatic complexity 22 (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/markview-commonmark/src/make.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4877b9fbb679199d21de6104381edfe63decf41b583c2d0aa04a3ffd0b4af117"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_layout::layout::cache::block_link_origins::walk (cyclomatic 22): markview_layout::layout::cache::block_link_origins::walk has cyclomatic complexity 22 (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/markview-layout/src/layout/cache.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a67fe54d36572e2fa0c675f84ea2a47060d6990616c0f2f6cd126ac60d59a5"}},{"ruleId":"D1","level":"warning","message":{"text":"Lower::lower_block (cyclomatic 22): Lower::lower_block 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/markview-webpage/src/lower.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"23eda0944ea2c99ee1d692bf77dc8fc242857bf644b06658248bf8c73fdfc747"}},{"ruleId":"D1","level":"warning","message":{"text":"TextShaper::resolve_fonts (cyclomatic 21): TextShaper::resolve_fonts has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/shaping.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"877bc4cf6976b45036038fb580be34e9ca0c78aaf87c84ceae52a08f909be7ce"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_webpage::lower::apply_link (cyclomatic 19): markview_webpage::lower::apply_link has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. 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/markview-webpage/src/lower.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fca28812ae72233ce4077cc1e3cd6c8c8c6f3ca14efbf98b850cb962a4ff1e"}},{"ruleId":"D1","level":"warning","message":{"text":"App::apply_search_navigation (cyclomatic 19): App::apply_search_navigation has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/search.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b598cb089a957cb7b052a54826aa5e9c938d20e90a758166ac036de15e70da4"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_commonmark::make::rebase_links (cyclomatic 18): markview_commonmark::make::rebase_links has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. 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/markview-commonmark/src/make.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a16d7193b214a4a652a04df62085a26ab7ee3affc59497e24d52617203b123"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockContext::build_grid (cyclomatic 18): BlockContext::build_grid 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/markview-layout/src/layout/table.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3152acc4aceef640fda1af9702db82b852a70e41eaaf369b1229408b0a1a55"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_layout::layout::table::borders::collapse_borders (cyclomatic 18): markview_layout::layout::table::borders::collapse_borders has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/table/borders.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"802384a222c8e4abf7df0538442876da99ca6bfcc18a7b62e200ea05ee85c29c"}},{"ruleId":"D1","level":"warning","message":{"text":"Lower::inline_element (cyclomatic 18): Lower::inline_element 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/markview-webpage/src/lower.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4573cd8ee0e55a53214c12471cfec8f2ef3e08ca3eb9bb6644ea84c032b6d6"}},{"ruleId":"D1","level":"warning","message":{"text":"DisplayState::can_display (cyclomatic 18): DisplayState::can_display has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/display.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8031ba8f25cbcddf6f107167d5a6636d322cfd3fc2111bff5eb3e43d4652f1"}},{"ruleId":"D1","level":"warning","message":{"text":"FontPanel.handle (cyclomatic 18): FontPanel.handle has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/vsc-ext/vscode/src/shared/font-panel.ts"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"19378bc73ce096b82fafbcc1a64816eda0a8e723c6dc727878cede2e4b88cf79"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockContext::paragraph_bounded (cyclomatic 17): BlockContext::paragraph_bounded 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/markview-layout/src/layout/paragraph.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29176d7fbc5a04c6310ad7a0f7e9e443f3f4e53d584b19a051e08b194778e60"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockLayout::seal_scene (cyclomatic 17): BlockLayout::seal_scene has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/markview-layout/src/scene/flow.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05319c5f9506120a7e6657b27731ed715a7bda1076e17572bed3c56c09a734a"}},{"ruleId":"D1","level":"warning","message":{"text":"BlockLayout::resolve_flow (cyclomatic 17): BlockLayout::resolve_flow 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/markview-layout/src/scene/flow.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba91525abce49eb97eec81ceb3bccb52dbea19273cb04a7c9e7320ce7b759e22"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutSnapshot::geometry_rebase_selection (cyclomatic 17): LayoutSnapshot::geometry_rebase_selection 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/markview-layout/src/text/selection.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf51863e73ea9190410bdc98258ec00da43149ac4b8ffcb7718c11d39b116d8"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_layout::paginate::bands (cyclomatic 17): markview_layout::paginate::bands has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/paginate.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"995694b287924b70049e2b6060710c851b20d6bbb899a446a759dec3e2d96535"}},{"ruleId":"D1","level":"warning","message":{"text":"markview_layout::style::parse::validate_numbers (cyclomatic 17): markview_layout::style::parse::validate_numbers 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/markview-layout/src/style/parse.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e08a752ac5c27df901ab96619bfdc52a851ecc6638151a0eeac8e967c9c17fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::prepare (cyclomatic 17): Renderer::prepare 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/markview-render/src/frame.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11b041611e39d5e2be6d1c4f732bce28a725752b0a4df783df1dc6816f9c0e9"}},{"ruleId":"D1","level":"warning","message":{"text":"markview::fonts::report::merge_progress (cyclomatic 17): markview::fonts::report::merge_progress has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fonts/report.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bf46ef5e64fba8547c988bc592c6d5d54aed61030f3f7a0fecce02069a68a6"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceEvents.replace (cyclomatic 17): ResourceEvents.replace has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 79, current, a function literal at line 101, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/markview/src/resources.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"38774906e20c6df60f0b2d253fe9ee647ce356e6cd28c9ed55656d5ef118bace"}},{"ruleId":"D1","level":"warning","message":{"text":"Viewer.#frame (cyclomatic 17): Viewer.#frame has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/markview/src/viewer.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"650a32b880d45d60d50934d057ec3164f68a229a55f73defdd5e3a6c123a15cd"}},{"ruleId":"D1","level":"warning","message":{"text":"SearchIndex::find_cancellable (cyclomatic 16): SearchIndex::find_cancellable 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/markview-layout/src/search.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"524c1b85d4e19cb4f057922310b6c0885012d77d1bb38f3b8e9d815ff73f018e"}},{"ruleId":"D1","level":"warning","message":{"text":"TextShaper::build_layout (cyclomatic 16): TextShaper::build_layout has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/shaping.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b4c012a008acece352cfecc15854c467619f0e764632972d4dd47d593154e1"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceIndex::scroll_anchors (cyclomatic 16): SourceIndex::scroll_anchors 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/markview-layout/src/source.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"392a0605faa0d6ed48989ec44484f103d563d6ba3bcb3c159006cd6686761fd3"}},{"ruleId":"D1","level":"warning","message":{"text":"SourceIndex::visit (cyclomatic 16): SourceIndex::visit 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/markview-layout/src/source.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"409e3a85e5600017874aa3cc59565f0024e6c8383b0646c3e9e0d9d0c504350b"}},{"ruleId":"D1","level":"warning","message":{"text":"Painter::math (cyclomatic 16): Painter::math 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/markview-pdf/src/paint.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bb94311c901b8735308723704abb36653418cea05c53cd30e94d2822d959fb"}},{"ruleId":"D1","level":"warning","message":{"text":"process.runNative (cyclomatic 16): process.runNative has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 59, 21, 37, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/vsc-ext/vscode/src/shared/process.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c736b2d6f72d0c535dce745460ea0483a46fa98e2d6bbb3f67cc15876af96bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Lower::table (cognitive 128): Lower::table has cognitive complexity 128 (threshold 15). Drivers by points: if/else 22 (66 pts), loops 15 (43 pts), match/switch 5 (15 pts), boolean chains 4 (nesting depth added 82). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-webpage/src/lower.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58f34f2f08dcfae99443dec07049f53835b71b00fd4a527392912a73b3a6c82"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::draw (cognitive 89): Renderer::draw has cognitive complexity 89 (threshold 15). Drivers by points: if/else 28 (68 pts), loops 5 (17 pts), match/switch 2 (4 pts) (nesting depth added 54). 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/markview-render/src/paint.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a2a2debc48f2243a445b6031e66a23557d5d93d2bbe4810cbb55d1b47ff338"}},{"ruleId":"D2","level":"warning","message":{"text":"TextShaper::shape (cognitive 88): TextShaper::shape has cognitive complexity 88 (threshold 15). Drivers by points: if/else 20 (54 pts), loops 10 (28 pts), boolean chains 6 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/shaping.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78929a40d5939200b59ed9bbb1b67f1e75e9d54f227b466d693171f52d3c430"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::draw (cognitive 78): Painter::draw has cognitive complexity 78 (threshold 15). Drivers by points: if/else 30 (63 pts), loops 4 (10 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-pdf/src/paint.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"079d722a3daa213e3945c327feb08fb034c3bfd10d90724c7f755eac4e61f965"}},{"ruleId":"D2","level":"warning","message":{"text":"App::handle_user_event (cognitive 74): App::handle_user_event has cognitive complexity 74 (threshold 15). Drivers by points: if/else 27 (63 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 37). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/lifecycle.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"185987f2375f297d89d597a07cc4469c398d223a5dc721b340d886dcf43c4362"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::with_services_and_parsed (cognitive 69): Worker::with_services_and_parsed has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (50 pts), match/switch 3 (10 pts), boolean chains 8, loops 1 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d3b57f18a720f5d66e5917c6256b19d302d5d33d997c753dcd0c8736e9090c"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::linebreak::optimize (cognitive 66): markview_layout::linebreak::optimize has cognitive complexity 66 (threshold 15). Drivers by points: if/else 23 (51 pts), boolean chains 8, loops 4 (7 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/linebreak.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6750828fbb27f28b21aada4ba857860828c3877b0d9aece771170cdf210535"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockContext::table (cognitive 61): BlockContext::table has cognitive complexity 61 (threshold 15). Drivers by points: if/else 23 (43 pts), loops 11 (18 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/table.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbf32273c8eb67d41f66b04b103ff76e7be9ef340edc7699e73013d2aac6fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::child_block (cognitive 60): Reader::child_block has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 5 (14 pts), loops 2 (7 pts), boolean chains 3 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/parse.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb8c4cec0f052c0f9ee20cbf5a517a0d0ba4ca0b1982506ecb19eb3664d21a4"}},{"ruleId":"D2","level":"warning","message":{"text":"extension.activate.open (cognitive 53): extension.activate.open has cognitive complexity 53 (threshold 15). Drivers by points: if/else 27 (37 pts), boolean chains 9, ternaries 4, error handling 2 (3 pts) (nesting depth added 11). Most of this is not in the body itself: 2 of the 53 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 135, publish, a function literal at line 235, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/vsc-ext/vscode/src/preview/extension.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3d023ffa1540833eee6a97d16363fb4e237c176b25d6911d1bbc419c6d43c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Rule::overlay (cognitive 52): Rule::overlay has cognitive complexity 52 (threshold 15). Drivers by points: if/else 52. 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/markview-layout/src/style/types.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37b94bf9110716ef9829d7428b1c0a13c7f99343fc0d9843d8a15fb0c4c1e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"TextShaper::resolve_fonts (cognitive 49): TextShaper::resolve_fonts has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (33 pts), match/switch 3 (8 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/shaping.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea995d213cbf86fad7366296ac40dcf5e7ff4cfb63c9898e21b215a79b6c8af"}},{"ruleId":"D2","level":"warning","message":{"text":"CanvasReader.bindInput (cognitive 47): CanvasReader.bindInput has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (20 pts), ternaries 8 (19 pts), boolean chains 8 (nesting depth added 14). None of this is in the body itself: all 47 points belong to 8 function literals inside it that branch (lines 265, 259, 235, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/markview/src/reader.ts"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"32904bb73c3e77b93cfd2b1528d52b105cc47b11a00365e074254aff92972a67"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockContext::build_grid (cognitive 45): BlockContext::build_grid has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 8 (21 pts), boolean chains 2 (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/markview-layout/src/layout/table.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ac1e9b8f2455a5bce0849aa398309e2cc8185b6491a37dad47c79898af5fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::fonts::report::merge_progress (cognitive 44): markview::fonts::report::merge_progress has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (32 pts), match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fonts/report.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d579dba81fe2284ed8216de8d807f2bab9081d6368a2dd289572a43e1cdb9fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"MermaidStyle::overlay (cognitive 41): MermaidStyle::overlay has cognitive complexity 41 (threshold 15). Drivers by points: if/else 41. 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/markview-layout/src/style/types.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab40f7decb0e2db2262432eb19532883d0d283e487412abb49d2ccce24a3e20"}},{"ruleId":"D2","level":"warning","message":{"text":"App::scroll_event (cognitive 40): App::scroll_event has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (32 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/window.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6bee227164f40ebed2d76cac808ef74990ac9b5c46db089c88e84c670971ea"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::images::diagram::resolve (cognitive 40): markview::images::diagram::resolve has cognitive complexity 40 (threshold 15). Drivers by points: if/else 40. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/images/diagram.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"884def128afae0a0316717ee9883195af31f3f0572ab7867e6e180b3f248fd47"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkviewActivity.receiveResult (cognitive 40): MarkviewActivity.receiveResult has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (20 pts), ternaries 3 (7 pts), boolean chains 5, loops 2 (5 pts), error handling 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/java/io/github/szdytom/markview/MarkviewActivity.java"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6fd8d44b1ff2c1b62089e8f34e5713e49ad750843f9cb4f5e7ed2ebe764ded"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutSnapshot::geometry_selection_rects_in (cognitive 39): LayoutSnapshot::geometry_selection_rects_in has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 3 (6 pts), boolean chains 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/markview-layout/src/text/geometry.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"079f0146b0ac9ceaa0538da9da6be7e5b47d81c3ee1d473a3b3bc98809b2721b"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutSnapshot::visit_search_clusters (cognitive 38): LayoutSnapshot::visit_search_clusters has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (27 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/search.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5140b0106a644d295db044c5bfe42001390174a4d81a3e5aa5d455314bd7c9bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::math (cognitive 38): Painter::math has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 2 (5 pts), match/switch 1 (2 pts) (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/markview-pdf/src/paint.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a66143ca53434e308a545b1947fdc8f6f1508db28e8d86eee586183db7c37f0"}},{"ruleId":"D2","level":"warning","message":{"text":"build.main (cognitive 38): build.main has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 9 (13 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/build.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"207f2ccec808e11316d628d9b3936c969e35a112cceca55355e96a5eb8aa7224"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_document::visit::walk (cognitive 37): markview_document::visit::walk has cognitive complexity 37 (threshold 15). Drivers by points: loops 12 (29 pts), if/else 4 (7 pts), match/switch 1 (nesting depth added 20). 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/markview-document/src/visit.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64b2c004323da76a24ecf4adacfdb6db1f57ee7b2054ce0d16f7ab5114b2b29"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutSnapshot::geometry_hit_test_text (cognitive 37): LayoutSnapshot::geometry_hit_test_text has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 3 (6 pts) (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/markview-layout/src/text/geometry.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"00af655df0441b58db081ba3733782defb6e0e1c3d1e425fedea2fef253401ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Block::images (cognitive 36): Block::images has cognitive complexity 36 (threshold 15). Drivers by points: loops 12 (28 pts), if/else 4 (7 pts), match/switch 1 (nesting depth added 19). Of this number, 32 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. 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/markview-document/src/lib.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b6611769794178c2dc35b84fd48c288ed53e4ba94ce60940310e9a07df176c"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceIndex::visit (cognitive 36): SourceIndex::visit has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/source.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df169199eebf69ddec9c30a3999f7dbbbeb15e287435dd1688a1448e8b62deb"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchIndex::find_cancellable (cognitive 35): SearchIndex::find_cancellable has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/search.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aefb20afcb27680b19c2115eb0ea18fbb529d005573e9da91bfa4ad23bbb0f"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayState::can_display (cognitive 35): DisplayState::can_display has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (24 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/display.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78c85a3c386378703ff8aae16ba4bc98262c0228a4a082329e742fca1175128"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayState::capture_images (cognitive 34): DisplayState::capture_images has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (31 pts), 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":"src/app/preview.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50fde7a0a2f4c03c885e42143a92bc07a057879de05337c34664bb3ced2d092"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_commonmark::make::walk_fields (cognitive 32): markview_commonmark::make::walk_fields has cognitive complexity 32 (threshold 15). Drivers by points: loops 11 (27 pts), if/else 2 (4 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/make.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bea928777c1e6889d5f3b3fc44d78deea34e118993a19bf954d3f3e10f74350"}},{"ruleId":"D2","level":"warning","message":{"text":"App::render (cognitive 32): App::render has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 6, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/painting.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52354dc2597f4a2778d752f551c97054ba15054ca96f5a2140ed30449f7e655"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::complexity::exemption (cognitive 32): xtask::complexity::exemption has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/complexity.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c49ca4edd29a042a99dcf5cf3f7119038264e49c9fc29769824c770bfcdf346"}},{"ruleId":"D2","level":"warning","message":{"text":"ContainerStack::consume (cognitive 31): ContainerStack::consume has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/container.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f51831495426aeb7ece092acc8402b6e80eb2f9cf11756622ed98873a919f86"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockLayout::resolve_flow (cognitive 31): BlockLayout::resolve_flow has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (8 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/flow.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88b718d19f00cba06bab8998f66c3d3b4d347e1c55d78814284169cb9a92110"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageTextures::prewarm (cognitive 31): ImageTextures::prewarm has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-render/src/images.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8944541d708d32178dbbeaa6d7138769d9f3ec3168144a4ad280062786b5537"}},{"ruleId":"D2","level":"warning","message":{"text":"Form::new (cognitive 31): Form::new has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/components.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b768b6e6ea33b569a22e03d146bf661db963cd62c6ea1a71d25cbb6aeb1bb80"}},{"ruleId":"D2","level":"warning","message":{"text":"Form::draw_rows (cognitive 31): Form::draw_rows has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/components.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"264521a57d90549bd697c4255a3b1c1b78ba7caa5fd7a282997231100ab2a15e"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::chrome::frame::caption_paint (cognitive 31): markview::app::chrome::frame::caption_paint has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (28 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/frame.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"551675eca257753b1856c679d8688e16190835cf309debb89bd5f6640f527490"}},{"ruleId":"D2","level":"warning","message":{"text":"TextShaper::scan_collection (cognitive 30): TextShaper::scan_collection has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/shaping.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d80b1122c520709d081a08178d63561fe35c9967c07989597313d3a1329b20f"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::layout::cache::block_link_origins::walk (cognitive 30): markview_layout::layout::cache::block_link_origins::walk has cognitive complexity 30 (threshold 15). Drivers by points: loops 10 (25 pts), if/else 2 (4 pts), match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/cache.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"6566c52c21fe0cb5852c0a13f0bb0129b94a28229fb86a2669691ec256ffc4bb"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::layout::table::borders::rectangles (cognitive 30): markview_layout::layout::table::borders::rectangles has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (26 pts), loops 3, boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/table/borders.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3026e993342186e1f358d3e2d882e4b625181efe308fc40f124ec5e5bb085fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_document::semantic_key (cognitive 29): markview_document::semantic_key has cognitive complexity 29 (threshold 15). Drivers by points: loops 9 (21 pts), if/else 4 (7 pts), match/switch 1 (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-document/src/lib.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db6b702b574674f1acce2c3adc8e31e6a1f4840c2a19b5563886ac33e226743"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockLayout::seal_scene (cognitive 29): BlockLayout::seal_scene has cognitive complexity 29 (threshold 15). Drivers by points: loops 11 (19 pts), if/else 5 (10 pts) (nesting depth added 13). Of this number, 27 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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/markview-layout/src/scene/flow.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7d1f0abafe913ad0155e9b13dd4a8c03cb268bcc0106bf92cd7cb8adcf777d"}},{"ruleId":"D2","level":"warning","message":{"text":"TextShaper::build_layout (cognitive 29): TextShaper::build_layout has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 6 (10 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/shaping.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f99de5c91691a9cc7553c02fff0637561dae15c13bd06f828420f869334e20"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::paginate::paginate (cognitive 29): markview_layout::paginate::paginate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/paginate.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73c810a26bba5470cb8c7dd66c472a7d3af760e9c923cc03d4dc631e0b5fb7a"}},{"ruleId":"D2","level":"warning","message":{"text":"App::apply_search_navigation (cognitive 29): App::apply_search_navigation has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 5, 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":"src/app/search.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46256971646e01583298c3a37acdc70eb2b2df2db3eea64e03e758744b0e6e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Images::prepare_sources (cognitive 29): Images::prepare_sources has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (19 pts), boolean chains 5, match/switch 2 (4 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":"src/images.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4fcdf77c0437c58a9243e68717ca4bd07fb8363de1954a09920c7f50a703ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadExecutor::try_submit (cognitive 28): ThreadExecutor::try_submit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (13 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/markview-layout/src/background.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7a2269d7f6c41badd078551d070584983883fe3aa5076f67c912f70752e56a"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutSnapshot::geometry_extract_text (cognitive 28): LayoutSnapshot::geometry_extract_text has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/text.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbaf7842c969cd20dfb13a744636fec4a2a95d02f5e35f4cc4c232ef710408a"}},{"ruleId":"D2","level":"warning","message":{"text":"Painter::furniture (cognitive 28): Painter::furniture has cognitive complexity 28 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 3 (7 pts), match/switch 2 (7 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-pdf/src/paint.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"22405a999979ce9fc32fa998dfefe966c6a273bac59e0669eb1ff54c4a2b9459"}},{"ruleId":"D2","level":"warning","message":{"text":"webview.update (cognitive 28): webview.update has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 7, ternaries 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/vsc-ext/vscode/src/preview/webview.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5fcab584edfa2f4484ad5144c4496fb5563f65eb8d2c62bba0ba5a7a92c994"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::layout::anchor::anchored_scroll (cognitive 27): markview_layout::layout::anchor::anchored_scroll has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (7 pts), boolean chains 3 (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/markview-layout/src/layout/anchor.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"931fb48bbda76c6154223e89e0aa91ff29aa802b1e383b78fab49c4d536576ac"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_commonmark::incremental::definitions (cognitive 26): markview_commonmark::incremental::definitions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/incremental.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"f156c316d320ad5f649ef236ab6ddb51a8aa49f9466d196baa8298cc56127458"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::linebreak::greedy_with_first (cognitive 26): markview_layout::linebreak::greedy_with_first has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/linebreak.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24ace31293df862ca7c68544311199552b7ba7c801250301fc1db30b840d7ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::prepare (cognitive 26): Renderer::prepare has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 7 (8 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-render/src/frame.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5302cbdaf74137ffd5209546599fedf982d1cf29cdae6b2470d428046615ad4e"}},{"ruleId":"D2","level":"warning","message":{"text":"App::dispatch_key (cognitive 26): App::dispatch_key has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/window.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc812cf99a47c91c52df2576c195c7bbdd374e92e01e7dfdae40c30b8e66e56"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockContext::paragraph_bounded (cognitive 25): BlockContext::paragraph_bounded has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/paragraph.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8158661c289eab8a9b4c63da4997f739133cd18b86469f6f800af762d1eb1c90"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutSnapshot::geometry_rebase_selection (cognitive 25): LayoutSnapshot::geometry_rebase_selection has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/text/selection.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e909913112c683b94998d017d78ab0b620820f31aaac3addecce85ab9b906d"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::layout::inline::hyphenation_candidates (cognitive 25): markview_layout::layout::inline::hyphenation_candidates has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (7 pts), boolean chains 3 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/inline.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b58c79f4cc146d55476221d20d78f93ad63ed601a9f6bbe8e135acd74c08617"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::layout::table::borders::collapse_borders (cognitive 25): markview_layout::layout::table::borders::collapse_borders has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 8, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/table/borders.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bb03d3683c67b11c5f2b963c89678de1fdbd9659c30dc377488648168c65c8"}},{"ruleId":"D2","level":"warning","message":{"text":"FileWatch::observe (cognitive 25): FileWatch::observe has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/watch.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"05533d9d2503d86eb25d980892a38dd82a6ef69196cbbddd44878349572d00bd"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::chrome::styles::style_rows (cognitive 25): markview::app::chrome::styles::style_rows has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), match/switch 1 (4 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":"src/app/chrome/styles.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f35d7d3aaf8a8a9d0006c4c778601b88b7d52d6b163d10c509896c026b1f99"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::font_panel::view::fonts_controls (cognitive 25): markview::app::font_panel::view::fonts_controls has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/font_panel/view.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ea494936b8c937bc50d4e0fb5820534f7cf30d5e28bdcc372e9035406598e"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::preview::fit_scene (cognitive 25): markview::app::preview::fit_scene has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (7 pts), match/switch 1 (3 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":"src/app/preview.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae814240ead92bd40b8de3cd5706e9763cb1c0aeea99ce29ada390fb104c080"}},{"ruleId":"D2","level":"warning","message":{"text":"FontIndex.scan (cognitive 25): FontIndex.scan has cognitive complexity 25 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (8 pts), error handling 2 (3 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/vsc-ext/vscode/src/shared/fonts.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabc9f7530bf964c72554b01dfb3eae3536c952d8601c31fd85468ee8e420fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockContext::code (cognitive 24): BlockContext::code has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/code.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddb5208a14f8ea5fcf3c5c39a86f4f22abef7888e71a93ac72e879b9969ccba"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::text::text_position (cognitive 24): markview_layout::text::text_position has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/text.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e976e2bcdfb0e06907b341acbe5d13d26add3bc2388c46f247622e87cd10dde"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::chrome::outline::draw_with_rows (cognitive 24): markview::app::chrome::outline::draw_with_rows has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/outline.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87d2bc72a2ab0e35da53768772b09a1333c408da6fc9fb33f902433a63a0d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"SpannedText::spans (cognitive 23): SpannedText::spans has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/rich.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4469ac9cd19df30dee90057e57eb4f5c5aff727cff13f3f356df432ef197a831"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceIndex::scroll_anchors (cognitive 23): SourceIndex::scroll_anchors has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/source.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e81736ae1e2da993599c98547616cda7cf7233273a07fd1c2605c6f3f820c4b"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::paginate::furniture::page_furniture (cognitive 23): markview_layout::paginate::furniture::page_furniture has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (7 pts), match/switch 2 (7 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/markview-layout/src/paginate/furniture.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0a22d4f747d5b41a9d67d7d12c0571e4540c5af3ce57afb102f36349c08ac4"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::font_panel::view::draw_font_body (cognitive 23): markview::app::font_panel::view::draw_font_body has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/font_panel/view.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"60468450b65bca79252b0307da814b43ec2fbc0a49b7211e3ac546aa558d0b28"}},{"ruleId":"D2","level":"warning","message":{"text":"Producer::remap_block (cognitive 22): Producer::remap_block has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (20 pts), if/else 1, match/switch 1 (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/markview-commonmark/src/make.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"227962f09aaeab3dc5f36e47273656b2d1b06adee2a0b5be4d77dfb8a9989191"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_commonmark::make::rebase_links (cognitive 22): markview_commonmark::make::rebase_links has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 4 (8 pts), match/switch 1 (nesting depth added 11). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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/markview-commonmark/src/make.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"3936a3ea08afaad9b4306c0196b1f9d12d2f3b3ae9f7167644806d3758d95ddb"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMap::validate (cognitive 22): SourceMap::validate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-document/src/source.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e97251fa7795c1700fb673d21a7d67040e237e5cafcf38bc5610fd57112437"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::style::parse::validate_numbers (cognitive 22): markview_layout::style::parse::validate_numbers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/parse.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb090313849a698122663f4bf23650e7ec216ff495429440684a23dc0eba870f"}},{"ruleId":"D2","level":"warning","message":{"text":"Lower::lower_block (cognitive 22): Lower::lower_block has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-webpage/src/lower.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4991eb93dfd847192cc631de0cdd94948f98341e8a4530c585a71c68aed52bc"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::new (cognitive 22): Worker::new has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/search.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"be89900acb250d5b9222bcd3b885d8538e14f8dc006f3b50417b026aeb53e64f"}},{"ruleId":"D2","level":"warning","message":{"text":"Tabs::restore_session (cognitive 22): Tabs::restore_session has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/session.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35714c41c61a997e75b28fdd2876ff67faee1f3e5ecd82feb8ad030066001b5"}},{"ruleId":"D2","level":"warning","message":{"text":"App::page_command (cognitive 22): App::page_command has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 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":"src/app/ui.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fc35267e64fd61e67412e1a146898d7f3503143614dbe2b9388ec45039d125"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::stylesheet::catalog_for (cognitive 22): markview::stylesheet::catalog_for has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/stylesheet.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8a32b95a9c1de19c3d4e6e89158e2f57441c7b4fcd0127a3d1b5d1a2d06ec7"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateSettings.resolve (cognitive 22): TemplateSettings.resolve has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), ternaries 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/vsc-ext/vscode/src/shared/template-settings.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"062cce077a4363710c43d5b75f21ba12f57f9773eac087762fb99f27c531b3a2"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_commonmark::make::build_map::nested (cognitive 21): markview_commonmark::make::build_map::nested has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (20 pts), match/switch 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/markview-commonmark/src/make.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bfcf48d3fca6dfce9f26024ef639c0afd4aeb8e09a65a54a07d4f09b1d5dc0"}},{"ruleId":"D2","level":"warning","message":{"text":"Block::for_each_code_block (cognitive 21): Block::for_each_code_block has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (20 pts), match/switch 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/markview-document/src/lib.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae1aafcc9ce0bf7eb1e007ef272bda1ee136fa32e0dcd775b30f10fa0240036"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_document::visit::visit_blocks (cognitive 21): markview_document::visit::visit_blocks has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (20 pts), match/switch 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/markview-document/src/visit.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b711470caa1513bdabcdddeabc54b9821a16e3aa95291843f17e16c7032247db"}},{"ruleId":"D2","level":"warning","message":{"text":"ScrollPhysics::advance_momentum (cognitive 21): ScrollPhysics::advance_momentum has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-interaction/src/scroll.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08cd2a934a5bc5f50eefa6ef41021ed9e9b5d0ebcae4b1450a5eef5bfa4b153"}},{"ruleId":"D2","level":"warning","message":{"text":"ButtonVisual::fill (cognitive 21): ButtonVisual::fill has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/components.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff069bf22da1a41394fcf067680e5c5a3c91b2e8b19950599e7ef6aa0a27d25"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::submit (cognitive 21): Worker::submit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/preview/work.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"057b11a63e208c9e67c09326d0256e37a38e4f9db594ca2691a911d9ab19fe69"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_commonmark::html::block_events (cognitive 20): markview_commonmark::html::block_events has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/html.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56729f9aa365d0f85739d368e7f347a397207bb7753eabbac0dbcd0f64bdf3f"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_commonmark::html::block_from (cognitive 20): markview_commonmark::html::block_from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/html.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"3013012adb3953305fc8fecdf16685f63b3285dbf1a270d4cab8f81a585bbd77"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockContext::prepare (cognitive 20): BlockContext::prepare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/inline.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e213720f1e55524a3fde9fca923192e6e85ebfceef56dafa5aa6936fea9411c"}},{"ruleId":"D2","level":"warning","message":{"text":"TextInput::draw (cognitive 20): TextInput::draw has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 6 (8 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/text_input.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35e397da3b482105ea5e0677ffde9d311e3070b05c941765084dfe60f988bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_webpage::preserve_semantics (cognitive 20): markview_webpage::preserve_semantics has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-webpage/src/lib.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"2831b4ab8d52a15117f23a5593742df5b4d3c4c4d5a09d7d8545bdeca37e0127"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_webpage::lower::apply_link (cognitive 20): markview_webpage::lower::apply_link has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 3 (5 pts), match/switch 1 (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. 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/markview-webpage/src/lower.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c87e4e9a185739f8711465466f4e765eaad22cdf3f5eabc537edf86c345ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"State::refresh (cognitive 20): State::refresh has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/folder/observe.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dbd679fbdf5223750b45fff8f3978a197d069a894b954f487444bdc049db14"}},{"ruleId":"D2","level":"warning","message":{"text":"Tree::patch (cognitive 20): Tree::patch has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/folder.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe02c2d225c0ba3d06e44cd54c34f82bb951ccfa725d072f32335ccaef84f148"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsStore::encoded_settings (cognitive 20): SettingsStore::encoded_settings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 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":"src/settings/store.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"db58a1d3407c94fb96fecdcb2e5e04cce914defaa950d308790640bf237037f0"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::chrome::empty::geometry (cognitive 20): markview::app::chrome::empty::geometry has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18, boolean chains 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/empty.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3e3a505b5e95f1ee20ea8528a78c9729848bd0a4f1ec47d311facb91313876"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::file_search::find (cognitive 20): markview::app::file_search::find has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/file_search.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c5550093fb5b1318d549852210dd8bf540383885f01b3911dea8191c7fa7b9"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkviewActivity.receive (cognitive 20): MarkviewActivity.receive has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, ternaries 1 (2 pts), error handling 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":"android/java/io/github/szdytom/markview/MarkviewActivity.java"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4143aa73bac4b589a8236890bd1fde8760332f2fd2487c75432a15b94c4dff2"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_image::decode::decode_bitmap (cognitive 19): markview_image::decode::decode_bitmap has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 11). 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/markview-image/src/decode.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5445f0ed3956c85e4459e4a0de33e4dff4bb4866fd0e4362f88aa6519adb94"}},{"ruleId":"D2","level":"warning","message":{"text":"ParagraphLayout::reshape_to_fit (cognitive 19): ParagraphLayout::reshape_to_fit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/paragraph.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8384c3565e3066709b78108aba0bb0ce1bc11c90ac2ebdb4b5181e04161dd5ea"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockContext::units (cognitive 19): BlockContext::units has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, loops 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/markview-layout/src/layout/inline.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4bda32e513b2af51c03fbb53f20ee145c330dab76a1b37a25757459cb21da2"}},{"ruleId":"D2","level":"warning","message":{"text":"DrawBuffer::from_paint_iter (cognitive 19): DrawBuffer::from_paint_iter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, 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/markview-layout/src/scene/draws.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20990a19e62a1f12efc18220ec485008fb9f7b686c122488b5a20946350ca3"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutSnapshot::geometry_search_selection (cognitive 19): LayoutSnapshot::geometry_search_selection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/search.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5332febf14ecf5200c018aeb3ff1e725328798944c795d892e9a22ecb16c9bd"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::style::parse::split_rule (cognitive 19): markview_layout::style::parse::split_rule has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/parse.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d6609793088142b40f0130f5772501ea3a34c19fa160f817b86f86054f31d3"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::text::word_range (cognitive 19): markview_layout::text::word_range has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/text.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66a9a321e2aef0aada0c5eccf47166df01ece61b712485741d26ceccdb06809"}},{"ruleId":"D2","level":"warning","message":{"text":"ButtonVisual::content (cognitive 19): ButtonVisual::content has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/components.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"988d8705bacdecc10d749ff6fe4b8a681ec601aa5ec50478fe33ca84a57a3fbe"}},{"ruleId":"D2","level":"warning","message":{"text":"App::touch_surface (cognitive 19): App::touch_surface has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (3 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":"src/app/gestures.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"802b6d6dff404df6c2f985d0d729e03ea20ec80a7eecb61678baf558acf805d3"}},{"ruleId":"D2","level":"warning","message":{"text":"App::pointer_moved (cognitive 19): App::pointer_moved has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/pointer.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"842883684e2649673717cd34c271a70900c2fdb98092c41fa2371c26778a82ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache::evict (cognitive 19): Cache::evict has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/images/cache.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a449ef05ad8846faf4cf1cedcce40e160d80364544db701c0288ef0d1dfe7e"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::chrome::styles::draw_styles (cognitive 19): markview::app::chrome::styles::draw_styles has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 4, boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/styles.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6d7cb3cb656002e1a8e60445862f7293c80c32a2981976217878aa6e3a5552"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::fonts::catalog::install (cognitive 19): markview::fonts::catalog::install has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fonts/catalog.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61813a0003f0c723280f4230883416cce0b125b7141c1d3842d10b887d041ca"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkviewActivity.showError (cognitive 19): MarkviewActivity.showError has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, error handling 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":"android/java/io/github/szdytom/markview/MarkviewActivity.java"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dce69b131fd219433bf0f4ec468dfce2e4a2560b1541297fce23d80f0cc8c42"}},{"ruleId":"D2","level":"warning","message":{"text":"PreviewScrollSync.frame (cognitive 19): PreviewScrollSync.frame has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (7 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/vsc-ext/vscode/src/preview/scroll-sync-webview.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20e55ea620c0a8f57d2858ea9c31c0450f804536280c1509e09046bc5f385ac"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_commonmark::html::normalize (cognitive 18): markview_commonmark::html::normalize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/html.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3702656f8a830c72e5c4f1120e28362126cdd89f3b9d34f67bc063e8f5815e0"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_commonmark::incremental::parse_prefix_with (cognitive 18): markview_commonmark::incremental::parse_prefix_with has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 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/markview-commonmark/src/incremental.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5615357dc0900d9e3a150d3e0bc63a4df21975665766ae7c37b416e074e0cc82"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::microtype::space_mixed_scripts (cognitive 18): markview_layout::microtype::space_mixed_scripts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/microtype.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fec810c99f1635115b74a6d49aa9add72987e1f76565952d9af9eed5f107d8"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::paginate::collect_anchors (cognitive 18): markview_layout::paginate::collect_anchors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/paginate.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c39ff0f965d0b37570f0bf5f2a2b00b6f691ab4487b03811600ae2336c16bf8"}},{"ruleId":"D2","level":"warning","message":{"text":"Lower::inline_element (cognitive 18): Lower::inline_element has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-webpage/src/lower.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"77658e5afab0161441d8b7710b77e61c483c96c9cf73183ef22b347052676d53"}},{"ruleId":"D2","level":"warning","message":{"text":"Chrome::buttons_for (cognitive 18): Chrome::buttons_for has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d226ccd65ec3ffafa4faffc7669495041ffdfc1257fba276256dec5650c864"}},{"ruleId":"D2","level":"warning","message":{"text":"App::folder_loaded (cognitive 18): App::folder_loaded has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/folder.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"c383640248a7fd058e1b139b7d552be84be8d48acdf7a4914d612e93fe118d09"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::chrome::controls::wrap (cognitive 18): markview::app::chrome::controls::wrap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/controls.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c6f7f88bffd1980be10c1e2bd1057762748441ba26fd2b58358157306f05d1"}},{"ruleId":"D2","level":"warning","message":{"text":"SpannedText::merged (cognitive 17): SpannedText::merged has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, 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/markview-commonmark/src/rich.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3e2a9e571b93119aada7c3290f75a7d5605bd8a10725b7e04a0c51b7b6502d"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_commonmark::incremental::parse_incremental (cognitive 17): markview_commonmark::incremental::parse_incremental has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 4, boolean chains 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/incremental.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58415f52b21146feb9d66ef5baf1ce8acdf2ddd5e2aeb3c368443506a516d1f"}},{"ruleId":"D2","level":"warning","message":{"text":"SourceMap::semantic_to_source (cognitive 17): SourceMap::semantic_to_source has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, loops 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/markview-document/src/source.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac2d9ae2695509e687aa1754fce7f4fc44dd455a14ce4e6b8d120a6ade7586f"}},{"ruleId":"D2","level":"warning","message":{"text":"PlacedBlock::flat_layout (cognitive 17): PlacedBlock::flat_layout has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5 (8 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/flow.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"40637e70c26ee54222529b7582a9e60513d0e34a66a762fe89725acb014f0b35"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutSnapshot::image_at (cognitive 17): LayoutSnapshot::image_at has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"062b23eb556a0fb7ff00e910dec343bb2aa723dbf0b239195ac058ae257f0da8"}},{"ruleId":"D2","level":"warning","message":{"text":"MermaidStyle::validate (cognitive 17): MermaidStyle::validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/types.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f4d9019bbc5f3e535af62519f6264aa181c0a4e00bb4ada469da060b83af7b"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::linebreak::line_score (cognitive 17): markview_layout::linebreak::line_score has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/linebreak.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1044cc0f319d17049e714be89f1752e2cf7db5a10420c5112e8bc6e00c5905e2"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::paginate::apply_page_constraints (cognitive 17): markview_layout::paginate::apply_page_constraints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/paginate.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4e27015ac8b1c466a07148c55bcbbad1c010635789c4fa2773bb6261d3354a"}},{"ruleId":"D2","level":"warning","message":{"text":"Geometry::decorated_base (cognitive 17): Geometry::decorated_base has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-render/src/geometry.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45cf8fa9365c3a5e93fee336f7b8fadb693b346d5b721be284b5ce299cb2a05"}},{"ruleId":"D2","level":"warning","message":{"text":"Chrome::draw_resource_feedback (cognitive 17): Chrome::draw_resource_feedback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dfe5dd9c999405430fabef698cbcbac5484602e284a35ca56cc172860fc417"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::update (cognitive 17): Model::update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 2 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/settings_panel.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"941236f593a5de859c47f8689c37550c5d1f575f0394f60321554415e2947405"}},{"ruleId":"D2","level":"warning","message":{"text":"App::trackpad_scroll (cognitive 17): App::trackpad_scroll has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/gestures.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca245d087ea03be644c2c2f57cfa2f3a80c40e0b800965f1686234ecfe48953"}},{"ruleId":"D2","level":"warning","message":{"text":"App::refresh_settings_resources (cognitive 17): App::refresh_settings_resources has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/settings_load.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f7730598ac0f97050b587a9295a91556b1b3f1a027d208a3a883d9cd1d7133"}},{"ruleId":"D2","level":"warning","message":{"text":"Images::prepare_blocks (cognitive 17): Images::prepare_blocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5 (8 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/images.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"001b715912420eacc170b4d5544bee678a299c4b7553e1a195b453142fe3d65b"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsStore::load (cognitive 17): SettingsStore::load has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (8 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/settings/store.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"09899a6ea254f3bfa8d296a24fa04e87b53404e7b62a97db4723cda9f3c3d671"}},{"ruleId":"D2","level":"warning","message":{"text":"WheelGesture::feed (cognitive 17): WheelGesture::feed has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"11813fe6390c400a38dd79ec800fa94b2f6c2924ff76eac6ce2c1639eeae773e"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::chrome::empty::draw_row (cognitive 17): markview::app::chrome::empty::draw_row has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/empty.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"991d25c0216d9c62536b96f71378d7b443fbe59f11ddd09000a8826c4801dba9"}},{"ruleId":"D2","level":"warning","message":{"text":"process.runNative (cognitive 17): process.runNative has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, ternaries 5 (6 pts), boolean chains 3, error handling 1 (nesting depth added 1). Most of this is not in the body itself: 5 of the 17 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 59, 68, 21, \u2026). The decisions are inside those literals, 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 literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/vsc-ext/vscode/src/shared/process.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed713c1d63548d9fb04d4b1d6f50c365fc2b3474101bb30119cc36aa77c95551"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::svg (cognitive 16): Reader::svg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/parse.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1370a19cb26515aa43a01fb16c94d6b34f954c3e7c4895cd7151f02bf63441a"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_commonmark::html::classify (cognitive 16): markview_commonmark::html::classify has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3 (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/markview-commonmark/src/html.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86109d36c3732d0d3aea1d93abaf57af0961178e026334fcab93f08ac447d0a"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockContext::measured_block (cognitive 16): BlockContext::measured_block has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 4, loops 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/markview-layout/src/layout/blocks.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"4caf8435979c41d50183453ae8f8f89079e68060edf4eae190206c4e22e5f82c"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutSnapshot::link_ref_at (cognitive 16): LayoutSnapshot::link_ref_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0f9613f2171be9dd8ec59a3afaf35cb3555cd00fc04772910bdf7a0f45c266"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::microtype::adjust (cognitive 16): markview_layout::microtype::adjust has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 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, 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/markview-layout/src/microtype.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4abe7a81689604bb5cc5fa5b3a462c0775743bdaad9bde95f39843197339df"}},{"ruleId":"D2","level":"warning","message":{"text":"markview_layout::paginate::bands (cognitive 16): markview_layout::paginate::bands has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 5 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/paginate.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c805154bd44110423b2b268e65008d517f82aaa896872c5ccf7ce0b4496a4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"App::frame_press (cognitive 16): App::frame_press has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/frame.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89ed1d949ef3cb965150b664b28d3a883f761ffc39b6630fd8dcabe2bcb0953"}},{"ruleId":"D2","level":"warning","message":{"text":"App::open_web_page (cognitive 16): App::open_web_page has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/web_page.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2229de9432f6419c8fef157af20f920722104d5eda7ae2e469381313b8a34c"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::chrome::empty::buttons (cognitive 16): markview::app::chrome::empty::buttons has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), 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":"src/app/chrome/empty.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d374fb4907707428c9eb08219b1afa3b9fc17018c286313dece1fd2b5bb3a6"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::chrome::outline::buttons_with_rows (cognitive 16): markview::app::chrome::outline::buttons_with_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/outline.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"321ddf7f8e0c987e8455c23c9b4c939343d8be5f29004b37f3d5b85706d6e83d"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::font_panel::view::download_control_rect (cognitive 16): markview::app::font_panel::view::download_control_rect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/font_panel/view.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"b464d49f14c042e7a6ae1db3bb57a7fed668adfffe6d7b5243bb6499aa4586a8"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::app::font_panel::view::draw_fonts (cognitive 16): markview::app::font_panel::view::draw_fonts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/font_panel/view.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ae65cc449d8db54b371e17618c33520eb7d50876b2fd6ebdd46adfdcefa19a"}},{"ruleId":"D2","level":"warning","message":{"text":"markview::latency::edit_scenario (cognitive 16): markview::latency::edit_scenario has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/latency.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5a949a78116537982ba6f68cdc408a083171b92882443d352ad1c165ac2382"}},{"ruleId":"D2","level":"warning","message":{"text":"xtask::coupling::check_baseline (cognitive 16): xtask::coupling::check_baseline has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/coupling.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"017c92aadd771932b0ef78f8610e9df498b9720991020db5e62582014b101885"}},{"ruleId":"D2","level":"warning","message":{"text":"Editor.#scrollMap (cognitive 16): Editor.#scrollMap has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/editor/src/index.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"173ad42afd992b32c54e4939ec07c4581988a13d2b9a430163a354f69625b1bf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 433 methods, declared across 37 files: app/pointer.rs (44), app/folder.rs (34), app/ui.rs (34), app/text_input.rs (29), \u002B33 more file(s). The bar is 30 methods; this is 403 over it, 14.43\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":"src/app.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd02129916eafd53227758b70cc4135e52b4ccabe7574217004568a79b42d819"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Worker.with_services_and_parsed: MethodTooLong \u2014 with_services_and_parsed runs 352 significant 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 252 over it, 3.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":"src/worker.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70090d6b2e27dac956e0903c2e33cd9153d4fca96faa65546f319645c73b236"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parse.rs: FileTooLong \u2014 1639 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: Reader (3 blocks, 170-1611). The bar is 500 significant lines; this is 1139 over it, 3.28\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/markview-commonmark/src/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b5e1a41779f30dde183002c61879f3b600ba71b0bb44b7659405e733738f8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.draw: MethodTooLong \u2014 draw runs 326 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 226 over it, 3.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-render/src/paint.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c251af020ea7ff6ad51dba85579217cb62faf07fa0d2fe416a96906292d7681e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower.rs: FileTooLong \u2014 1371 significant 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 68% of them inside a single declaration: Lower (2 blocks, 45-1283), declaring 33 free functions. The bar is 500 significant lines; this is 871 over it, 2.74\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/markview-webpage/src/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9b58c1db173eeb710fbefa1abcde50effa5845244e6f946284b56a9342b474"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Reader: ClassTooLong \u2014 1054 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 3 blocks, lines 170-1611. The bar is 400 significant lines; this is 654 over it, 2.64\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/markview-commonmark/src/parse.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd934a5732d717a37700be632036f5b3cbd8c963c1757ef2f262ea2b58e282ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: extension.activate: FunctionTooLong \u2014 activate runs 263 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 163 over it, 2.63\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":"web/app/vsc-ext/vscode/src/preview/extension.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02f9f8693fb3292c1bea2cf66ea57b915b53a62c103521b2357a4b03c5440db"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.handle_user_event: MethodTooLong \u2014 handle_user_event runs 257 significant 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 157 over it, 2.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":"src/app/lifecycle.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f255368e1e528dcf609a30881bd6d068b37259a035726e323d14753bdd1553dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Markview: TooManyMethods \u2014 73 methods. The bar is 30 methods; this is 43 over it, 2.43\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/markview-web/src/api.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fde75049a04c11c8c050cd8c2cec15c129509f86cae048ee0eaa1f20fb8c6a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlockContext.table: MethodTooLong \u2014 table runs 241 significant 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 141 over it, 2.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/table.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8d53a97e44af05e84dabf0bf76996341851c483025fce188643cc9ee4cdca1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/api.rs: FileTooLong \u2014 1178 significant 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: Markview (3 blocks, 184-1463). The bar is 500 significant lines; this is 678 over it, 2.36\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/markview-web/src/api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"187a797f4bd3cd44442c5f71e3bc2f8303dc963a4033bcd6177e3cec6d768367"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Lower: ClassTooLong \u2014 937 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 2 blocks, lines 45-1283. The bar is 400 significant lines; this is 537 over it, 2.34\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/markview-webpage/src/lower.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"671b93b63744837dacdcd7e7f31ee81badf76b5b26bf2211f376d11eda6219d0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Markview: ClassTooLong \u2014 914 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 73 methods, 3 blocks, lines 184-1463. The bar is 400 significant lines; this is 514 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/markview-web/src/api.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b23613e9875ff2c9cffa012bd9bb58f23476686b46e79d4eb59126b34b9d9cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chrome/components.rs: FileTooLong \u2014 1142 significant 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 642 over it, 2.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/components.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72e82fef7711fa06d3a034f249a35d85cba9fe58ef7a1d999cf23e2aa28ac0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.child_block: MethodTooLong \u2014 child_block runs 227 significant 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 127 over it, 2.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/markview-commonmark/src/parse.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb2108632dfe2055cd292caa8c409fb203df492ffc2f4d77c0af6b5c9868e33"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markview::app::chrome::controls::rows: FunctionTooLong \u2014 markview::app::chrome::controls::rows runs 227 significant 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 127 over it, 2.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":"src/app/chrome/controls.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"06694b45db7b216f833ee072389262b214a6530c84564aca6de6fea1d8029a6d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Chrome: ClassTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 39 methods, 2 blocks, lines 232-1410. The bar is 400 significant lines; this is 465 over it, 2.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"f278e9c2cf0996c31adfe8165958578257afd33bc79931a039b090d856e2419b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/blocks.rs: FileTooLong \u2014 1069 significant 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: BlockContext (333-1292). The bar is 500 significant lines; this is 569 over it, 2.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/blocks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e2e272ea276b93db5ca30a44f4712a001b204ef00060dcaf5aad9daff6a188"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: style/types.rs: FileTooLong \u2014 1065 significant 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 565 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/markview-layout/src/style/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5586df7b55007f3d0552b7043717f21423aa23685382da506d7594551d52067"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/paint.rs: FileTooLong \u2014 1053 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: Painter (2 blocks, 146-1259). The bar is 500 significant lines; this is 553 over it, 2.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-pdf/src/paint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c558dc8ad0e83d94583c3fcf7523c5af4425a7b7c239607ab698ee01c8f721e6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TextShaper: ClassTooLong \u2014 836 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 3 blocks, lines 149-1410. The bar is 400 significant lines; this is 436 over it, 2.09\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/markview-layout/src/shaping.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f344b570ee1066b1d301839ec0b4c8b6d4c3518caaee2583c4616bc88fca488"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/chrome.rs: FileTooLong \u2014 1038 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: Chrome (2 blocks, 232-1410). The bar is 500 significant lines; this is 538 over it, 2.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"121c4beac074ef8ea009181ad96222a6852482166a8940d8d5972d7955bde08a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Lower.table: MethodTooLong \u2014 table runs 196 significant 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 96 over it, 1.96\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/markview-webpage/src/lower.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"d249786205f3794b3ff3dff047059a0e69c45fde70103fb3aaf9a784988df39a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/folder.rs: FileTooLong \u2014 977 significant 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 477 over it, 1.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/folder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e14e5bb0c8a23c3504ece7132e6dabc7c504948e3027afa008cf2c638ec5df3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Painter: ClassTooLong \u2014 762 significant 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, 2 blocks, lines 146-1259. The bar is 400 significant lines; this is 362 over it, 1.91\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/markview-pdf/src/paint.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"91aeb3e874b556e38a647ab05d3125e6a385676a832ee32754f5ac2d4a7b2bb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shaping.rs: FileTooLong \u2014 952 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: TextShaper (3 blocks, 149-1410). The bar is 500 significant lines; this is 452 over it, 1.90\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/markview-layout/src/shaping.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fa146fa3728cd126e52d7929cf994c3c582d9c8915d7f58ec66b46b8adca7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scene/flow.rs: FileTooLong \u2014 904 significant 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 404 over it, 1.81\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"509073dc11075806c2c066ff58d1a9e7f36d87b3b21e0c3439fb20a289ac9644"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/images.rs: FileTooLong \u2014 904 significant 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 76% of them inside a single declaration: Images (2 blocks, 335-1355). The bar is 500 significant lines; this is 404 over it, 1.81\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/images.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3014617bf0b80c206c72572e996f51caf2e8e4eb4a7d5f0adc140232bcc94558"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 53 stored fields beside 433 methods. The bar is 30 stored fields; this is 23 over it, 1.77\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ae3fde481afa13e68d2d4d986ede09c81c93499da40e4b5e7c13258e323be8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/pointer.rs: FileTooLong \u2014 882 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: App (284-1323). The bar is 500 significant lines; this is 382 over it, 1.76\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/pointer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8dfcb26578bf067a957828996d3306be432c739f4e2ee813d45af4a95ed286"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Rule: TooManyFields \u2014 52 stored fields beside 3 methods. The bar is 30 stored fields; this is 22 over it, 1.73\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/types.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d5ae3d23bc72d3df4037f5d1080df85e4b57ed97f4c756ca331a4de0e2e6cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Painter.draw: MethodTooLong \u2014 draw 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/markview-pdf/src/paint.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5488343c36a07d0f84ecfee3071a53ff99c010343147345a52e7aef98e8338e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Images: ClassTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 2 blocks, lines 335-1355. The bar is 400 significant lines; this is 288 over it, 1.72\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/images.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c2e5069403effb3e2e129008bfddba699f22cb960ec1f92904c67e8388261a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/preview.rs: FileTooLong \u2014 838 significant 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 338 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/preview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16891666488b5c57e4682944ef8bc18cfb2ab1c0344e70c0377247fa991958f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Stylesheet: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\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/markview-layout/src/style.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a49124564834eb199a52e0b5c82ddb88014474b2248983805c4f80f0e1df15"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MarkviewActivity: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\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":"android/java/io/github/szdytom/markview/MarkviewActivity.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1935ceee3ff68ffc3c843ae312a5b122f44855579181beef970560cf015568d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cli.rs: FileTooLong \u2014 810 significant 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 310 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f109f4ba98439ac843f4ce5c70fd5c8c5a6f795cac2fdf369f601e1a346deb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextShaper.shape: MethodTooLong \u2014 shape runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/shaping.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca7c19dd7e377a0fe1b0a1afac956df9d8db7fa9b5e0e8057aa2000cd56776e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markview::benchmark::run: FunctionTooLong \u2014 markview::benchmark::run runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/benchmark.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb3e349d53876860460dbd61018db672123ef974b924631c99d58484d79b2ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: font_panel/view.rs: FileTooLong \u2014 771 significant 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 271 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":"src/app/font_panel/view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24369e64b3f3817f47db83f59d722c9ed94c53857b5e91c3b69801a212af699"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/text_input.rs: FileTooLong \u2014 760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: App (250-1030). The bar is 500 significant lines; this is 260 over it, 1.52\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/text_input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"537ab994714e42a21de328a06d13f1942cebfe3fe57ef44364df1336b4c8053e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlockContext.code: MethodTooLong \u2014 code 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/markview-layout/src/layout/code.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06854df94945a2bfa421c182470d1cace95a63f11a7180f7e5fde5f01eeb2df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlockContext.prepare: MethodTooLong \u2014 prepare runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/inline.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4914b102fd851ae12f1924c5c70863a95761d7e084e98d1d1319bd00a85c522"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.render: MethodTooLong \u2014 render runs 145 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 45 over it, 1.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/painting.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc643fa2e62d1c97b4b1ac8192191193997aec6c5f197684fd766b484c63a45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/window.rs: FileTooLong \u2014 719 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: App (77-1061). The bar is 500 significant lines; this is 219 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b098c391b6030d15328eb0e43f14252062b718cbc2a6490d71775f3aab48cd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markview::latency::run: FunctionTooLong \u2014 markview::latency::run runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/latency.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c2dfe531ca71afe5d3479cd87676c69f6b9954e3f6722ca58cef3c3d1b2dd3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/html.rs: FileTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 201 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/html.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1540d770b12bd314648bff685a92d69d00ddec2a87797d0f0897b008f356eb5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tabs: TooManyMethods \u2014 42 methods, declared across 2 files: app/tabs.rs (39), app/session.rs (3). The bar is 30 methods; this is 12 over it, 1.40\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":"src/app/tabs.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"425b756c766a5c40106ac0c9b223d9cdc75d5433ac49c61c8635efeb5b5deca9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlockContext.paragraph_bounded: MethodTooLong \u2014 paragraph_bounded runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/paragraph.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"27aee6a4922e743e3d563561ba2747add3422de8df055751eb9d165375ac178c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Painter.math: MethodTooLong \u2014 math runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-pdf/src/paint.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"053054c91bac44f656a454f9419a031c0308acdb76551f32ce7adc02fc29fe29"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/style.rs: FileTooLong \u2014 696 significant 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 77% of them inside a single declaration: Stylesheet (4 blocks, 103-940). The bar is 500 significant lines; this is 196 over it, 1.39\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/markview-layout/src/style.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc6ff192cce7affb6fc5b53534901bebc89aae6f0df9d17ddf2d2af7b225cb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BlockContext: TooManyMethods \u2014 41 methods, declared across 9 files: layout/blocks.rs (15), layout/inline.rs (7), layout/images.rs (5), layout/table.rs (5), \u002B5 more file(s). The bar is 30 methods; this is 11 over it, 1.37\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/markview-layout/src/layout.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"27906a498792ec9305d5646f9a5f54740f209011c1499589493e9a666bf399dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Markview: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 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":"web/packages/markview/src/markview.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a010e6d595585416e0e378a07e92e413e4d3544ae7746c658955e2a890d7847"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MermaidStyle: TooManyFields \u2014 41 stored fields beside 3 methods. The bar is 30 stored fields; this is 11 over it, 1.37\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/types.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"967dde65243551f740ac427e7eaa1da24ae0c915128378176dcc74191546c882"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlockContext.block_inner: MethodTooLong \u2014 block_inner runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/blocks.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf4cb6547e8c4114afc260d3fccf572ef43e7bb97e11aec6f3c1aebaebb6a7d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Stylesheet: ClassTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 50 methods, 4 blocks, lines 103-940. The bar is 400 significant lines; this is 139 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8f152b39b13158da5b5b7d267aa29c06f907c99d50f403e6968aa1ff230aa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 671 significant 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 171 over it, 1.34\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/markview-document/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02316fe449aee78f4d4b31e207ba190aecdc3b42f62f9121a64c94ff27a6da8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LayoutEngine.begin_layout_root: MethodTooLong \u2014 begin_layout_root 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/markview-layout/src/layout/progressive.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc3e70be58f2925ffcd9adb28abf8e2c5596e4cd33a7574f1909920de042002"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.prepare: MethodTooLong \u2014 prepare runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-render/src/frame.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"307ebcb7c04c2e430ffa4cdc4d07f512061127a9f62c513b7d525609f111071e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextShaper.build_layout: MethodTooLong \u2014 build_layout runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/shaping.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca95b217e28bd469d2554291d89528881ff4c6d81a3cc9de6736c2c29c1bb1d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Chrome: TooManyMethods \u2014 39 methods, declared across 2 files: app/chrome.rs (37), chrome/codeblock.rs (2). The bar is 30 methods; this is 9 over it, 1.30\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":"src/app/chrome.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"51605d3c03f2f6f639680a0c0a42d2ee82b223b9411c840008a457cd7028b54c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/search.rs: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: App (217-845). The bar is 500 significant lines; this is 150 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a71e74536a2258ab1461420bd04f241e51bc325ab0f364f4b4e646f8b5cb84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/state.rs: FileTooLong \u2014 644 significant 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 144 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73ce58cfdc3aea78fb99798aab230310b574873fd478db7e3a3577e4427e91f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: markview_commonmark::incremental: TooManyFunctions \u2014 38 free functions. The bar is 30 free functions; this is 8 over it, 1.27\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/markview-commonmark/src/incremental.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e90923750c26c14b96d528b6f080c1a4a2a8fd982951dfc9d75b8857c05c3e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LayoutSnapshot: TooManyMethods \u2014 38 methods, declared across 8 files: text/semantic.rs (13), src/scene.rs (7), text/geometry.rs (6), text/selection.rs (5), \u002B4 more file(s). The bar is 30 methods; this is 8 over it, 1.27\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/markview-layout/src/scene.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48f03f3b5cc447329c455158d2eac7d924cb112d845ab84d71705330eb65971"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Renderer: TooManyMethods \u2014 38 methods, declared across 3 files: src/lib.rs (24), src/frame.rs (11), src/paint.rs (3). The bar is 30 methods; this is 8 over it, 1.27\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/markview-render/src/lib.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f825faba63e5c99cbe09bcc2c8d7e4bc66a300cfbd75b7b8b1a4012a971d1218"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scene.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/markview-layout/src/scene.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13278a1c563c2ddf40bfbc4dec9b0afa8b8d2c6231d5066b552ef2c78fc085b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markview::app::chrome::outline::draw_with_rows: FunctionTooLong \u2014 markview::app::chrome::outline::draw_with_rows runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/outline.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a766f0cf8f72b8eb6fd05a203f6dfebe450dbb83e16c683efe39e87a981ee101"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Markview: TooManyFields \u2014 36 stored fields beside 73 methods. The bar is 30 stored fields; this is 6 over it, 1.20\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/markview-web/src/api.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"082cf67cd9a47079f7ae0b049174281a60c2efade017920fb420f2626b0fa6ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Form.new: MethodTooLong \u2014 new runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/components.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a90b1938dd73d3ff89e08ad075c44785be856fcefdc2055fae86ca69d9a5990"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.update: MethodTooLong \u2014 update runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/settings_panel.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b961131c54790c97b14f4487fe5b38d307aa3ffa2da3b1c7edd448df087842d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/gestures.rs: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: App (94-820). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/gestures.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d568f96140300310b5c9743f52ddbf5b70647b0438d433ae53a13c75a8ee2808"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Images.start: MethodTooLong \u2014 start runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/images.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"9129140d609e540c32d43da5325e1cc932fa7f5a2fe103f31a75675f2fb47d2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/export.rs: FileTooLong \u2014 580 significant 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 80 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":"src/app/export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1740ee6db67ecc6f88b1a683ed5961fd884afe25a112bf37d0183b3e07af8b51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markview_layout::linebreak::optimize: FunctionTooLong \u2014 markview_layout::linebreak::optimize 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/markview-layout/src/linebreak.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a2ddb1e0df4feba62910e41c937c2f53e2507b2f3cfe9655b4ec594a863bf8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlockContext.measured_block: MethodTooLong \u2014 measured_block runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/blocks.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29c7589bfcf4eca7fa6aefe3b2397082197d8b7096b323fe9026e7c0c6ac4be"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LayoutEngine: TooManyMethods \u2014 34 methods, declared across 5 files: src/layout.rs (21), layout/progressive.rs (6), layout/subtree.rs (4), progressive/parallel.rs (2), \u002B1 more file(s). The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc97fe262a2bde8cdff9f774b47f8d2ff8e3c091977cdc1bd320bfcad51a4d5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ReaderSession: TooManyFields \u2014 34 stored fields beside 30 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad67aaed3133460166b8f42f440d6f67741d913f667b8d9d04c62349af4131a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.new: MethodTooLong \u2014 new 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":"src/app.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e816e4eaca713bf8f4e8637c957ca8c0fbc419574a35a5eecc3ef74c61b31d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markview::app::font_panel::view::fonts_controls: FunctionTooLong \u2014 markview::app::font_panel::view::fonts_controls 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":"src/app/font_panel/view.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d27cfe893c8dbf49c392454f36cb1ae75a395892b7ad6f0d26b6623299ffd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 559 significant 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 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c754c8bbeb53a8a563bd91426dec0339aaa4fa0a965a2eaafe8f2c58777e0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/session.rs: FileTooLong \u2014 554 significant 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 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"967cfa2b89bdb8108c5e53cb7b8924da442772d3009db1654a6ca5a331ef37fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RasterCache: TooManyMethods \u2014 33 methods, declared across 2 files: src/raster.rs (28), raster/path.rs (5). The bar is 30 methods; this is 3 over it, 1.10\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/markview-render/src/raster.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04931ae36ca0bb4ee571a05bc744c3bb4a724f5410119a1560c8275817adc04"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TextInput.draw: MethodTooLong \u2014 draw runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/text_input.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c28c6a8c963b199eade7ce18884e301a5a50921ec4df5b794818af3c7b68ec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Geometry.decorated_base: MethodTooLong \u2014 decorated_base runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-render/src/geometry.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cdb7a06d65db4a8068b9c0b73cfa75ace0550cf51393526aa6e736a83bdcdcd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/inline.rs: FileTooLong \u2014 542 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 72% of them inside a single declaration: BlockContext (47-552). The bar is 500 significant lines; this is 42 over it, 1.08\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/markview-layout/src/layout/inline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a8bc966efc6f738cf6bd2b3744ecb29544346b10bd80f49ea0751c72af14f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/ui.rs: FileTooLong \u2014 540 significant 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 99% of them inside a single declaration: App (10-770). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69af3be608d776f6d7b89cdbdbe99b1423994d261252d94cefb87a2d21827ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/table.rs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 89% of them inside a single declaration: BlockContext (35-616). The bar is 500 significant lines; this is 36 over it, 1.07\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/markview-layout/src/layout/table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f1e88eecfd526b1b375ef610471ca1fe55dbf8b59880bde2d84cf04ade3c6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markview::app::font_panel::view::draw_fonts: FunctionTooLong \u2014 markview::app::font_panel::view::draw_fonts runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/font_panel/view.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ed85e41588bf65ce5c1c334d72a63176b54ab4b914ff17f1851ec27d034912"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Images: TooManyFields \u2014 32 stored fields beside 30 methods. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/images.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae6ccd7036e28ae4a86ea89bec2bd7214fee249692226a151d9bae0647e800b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Worker: ClassTooLong \u2014 425 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 4 blocks, lines 112-667. The bar is 400 significant lines; this is 25 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c7c987af753c81c5233a69d399872ce6aff19cfe2093c6a2d2261d10a9a584"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.inline_step: MethodTooLong \u2014 inline_step runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/parse.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"21892e7983224acef8231eaf8a93ac495fe32b0cd77affe6354de4b9027bbf97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chrome/empty.rs: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/empty.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b930ac4732bf699f05470d721d193e307afededd122fa6bb4bad2465d5586261"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/coupling.rs: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"xtask/src/coupling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f5c9fca14ae713828525bee8e93c0a51929af160ef04cecbfecc797bbfa965"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/worker.rs: FileTooLong \u2014 524 significant 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: Worker (4 blocks, 112-667). The bar is 500 significant lines; this is 24 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"433da3d0b0b3912ab01828b2ef0300750d1c134ab87e81dfead3d77f013e6f67"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Form: ClassTooLong \u2014 417 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 3 blocks, lines 778-1362. The bar is 400 significant lines; this is 17 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":"src/app/chrome/components.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b138a80db58face7521f6b565702c2afbdc509417a764747d87cb3a5a96755"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markview_document::semantic_key: FunctionTooLong \u2014 markview_document::semantic_key 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/markview-document/src/lib.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e25e4cafd3b86d7437e26d76f7cb5b5c42a5a032d5dc00a5bd6e3c27b2fa20"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chrome/controls.rs: FileTooLong \u2014 518 significant 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 18 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":"src/app/chrome/controls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca32d5a2663224466c8b256775021bf8a0d1dab40f1cf03cf12d7eb8b52c8ea0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/latency.rs: FileTooLong \u2014 518 significant 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 18 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":"src/latency.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c2bf601d4dad8ce5baa5322a273bf267b2ff25b72c43fc03caac4adb0640db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: State: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/pointer.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"636848f2177d020da8b1641634cfdddce86381d0830a9cd44afb6c5ed5a4a36e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: style/parse.rs: FileTooLong \u2014 512 significant 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 12 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"992b7f9cc98dec5600ab65d1d40d4602720754c789deea0686cd8926f8e3daec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlockContext.list_item: MethodTooLong \u2014 list_item runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/blocks/list.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce973b6c1c3c2431b95d7457fe39a387002c1b6b1e74318025d1b40d90c918e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlockContext.build_grid: MethodTooLong \u2014 build_grid runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/table.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba23874de77b7a1d2510bb46265317766d66374200fc14bd166d8cce9346cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeInput.input_with_keyboard: MethodTooLong \u2014 input_with_keyboard runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-platform/src/event.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"243d4897d5b42044446270026e827673da5e418d8875e442eaff1878c99f7fb6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: webview.update: FunctionTooLong \u2014 update runs 102 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/vsc-ext/vscode/src/preview/webview.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed2718d40544221c004a04cfc5a4cd8ec343af06464e6f19941ea9510329f13"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markview::app::chrome::export::rows: FunctionTooLong \u2014 markview::app::chrome::export::rows runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/export.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"615c22fb90bc2217ad340e1949c4b840270685a92c971466109726f0dfc608cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: markview::app::chrome::styles::draw_styles: FunctionTooLong \u2014 markview::app::chrome::styles::draw_styles runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/styles.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6383c6211084c1525ec4e8725a3e5026f5d65c7a70f2734068c5018a6d4dc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/markview-webpage/src/lower.rs:610-644 | crates/markview-webpage/src/lower.rs:650-681 \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/markview-webpage/src/lower.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"816f35706194be22096bac69473e328af9b6890d13818f93933ad47cd88a39d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/markview-commonmark/src/html.rs:366-406 | crates/markview-commonmark/src/html.rs:743-785 \u2014 These two members are one piece of code written twice and then edited apart: 41 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/markview-commonmark/src/html.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37c53b5f80b5135dcc6bbcade341bfca5068c617d5f47246f57c88af5a77985"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): src/fonts/download.rs:453-495 | src/fonts/download.rs:503-553 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"src/fonts/download.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a3bde33c85d4590e674c06165a0d6c2c702055357779aa41305388a188b418"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 42\u002B corresponding lines): crates/markview-commonmark/src/make.rs:104-145 | crates/markview-document/src/lib.rs:890-931 | crates/markview-document/src/visit.rs:150-192 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 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/markview-commonmark/src/make.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bad766b67b4e129228e0a3894407c5209cb70d5bcc3bf3071a5eb3c2622994c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/markview-document/src/index.rs:163-184 | fuzz/fuzzlib/src/bin/webdump.rs:141-159 | fuzz/fuzzlib/src/webpage.rs:608-629 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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/markview-document/src/index.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b1d5e20c6883d1ec4c9025aad85fa39e60a5d961e7ad0ddf3f9106a9c2747e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/markview-render/src/raster.rs:135-174 | crates/markview-render/src/raster/color.rs:34-77 \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/markview-render/src/raster.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d409b4fa6c8c15403c3e14e86605e1bda8b9f30be985f625873ec4ad8eecac04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/app/start.rs:384-401 | src/app/start.rs:402-426 \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":"src/app/start.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67d87a4238df6581eaf98733d40a4b4305a165e75ab591ae0babc46e332987f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/markview-layout/src/scene/draws.rs:113-131 | crates/markview-layout/src/scene/draws.rs:136-158 \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/markview-layout/src/scene/draws.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cec5d54f2a9e737263fdd139ae1f8708f6948b07f2bc47e502c924703ad9b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/markview-layout/src/text.rs:239-260 | crates/markview-layout/src/text.rs:266-287 \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/markview-layout/src/text.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"948bcfa519cfa612353104e7df0614b9035a7b7a43b11aef8287d81cbc3285e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/markview-commonmark/src/incremental.rs:552-574 | fuzz/fuzzlib/src/seam.rs:628-648 \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/markview-commonmark/src/incremental.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff02541215a09e1ff9c113b2dbc4d5c69368dfd7b274addb6b07eabe90a7bc25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/markview-layout/src/fonts/mod.rs:134-147 | crates/markview-layout/src/fonts/mod.rs:156-170 \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/markview-layout/src/fonts/mod.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2ccff8f8cadb792104281fbc1508662f9c5a5fcb84d68991ae57c1e2862ba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/markview-layout/src/style.rs:548-568 | crates/markview-layout/src/style/source.rs:43-90 \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/markview-layout/src/style.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"478a1ba1d16ec2e777333bf2603e050f7e93309fb6738fb0b9eee92d73dde42e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/markview-geometry/src/lib.rs:13-19 | crates/markview-render/src/lib.rs:406-412 \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/markview-geometry/src/lib.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa73f98e1cb7b12cde4400f9b564e629e065ffc1ade3de5a6ef80096e75faf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/markview-layout/src/scene/draws.rs:514-528 | crates/markview-layout/src/scene/draws.rs:534-546 \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/markview-layout/src/scene/draws.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3caa38aa8167532c07dd85f8980a56ebf3b48fbe5d86ee0c4c55b25c8f81ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/markview-layout/src/layout/inline.rs:570-584 | crates/markview-layout/src/microtype.rs:504-523 \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/markview-layout/src/layout/inline.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"26feb8498475d8e51f5ae6901c1b1f2bde72566960b6b6d24940be326af3f228"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/app/tabs.rs:166-182 | src/app/tabs.rs:191-205 \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":"src/app/tabs.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7420be8e25d03e9f5007f91f40dbe85b261e4a7298a26e41f5166732c8fe1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/benchmark.rs:36-45 | src/latency.rs:57-70 \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":"src/benchmark.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4253451d1b63bd2d6e0fee4e4495a7519c9c7120a61ffa722b14a0043456ea1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): crates/markview-layout/src/style/parse.rs:166-181 | crates/markview-layout/src/style/parse.rs:338-351 | crates/markview-layout/src/style/parse.rs:355-370 | crates/markview-layout/src/style/parse.rs:374-389 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/parse.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e8dc06c3ac6505e918b5e788cf8202728e8bee620414476d6bef1914fc3a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/markview-image/src/decode.rs:254-260 | src/images.rs:209-215 \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/markview-image/src/decode.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b6c7dc019cf49a0c9b246cb3ab90315dbe968d83d21e0ec288edf517104a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/markview-webpage/src/metadata.rs:78-93 | fuzz/fuzzlib/src/seam.rs:581-596 \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/markview-webpage/src/metadata.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec81fa5e67b87f0894029af8dc5a0e1f1d03a2d9118d4be79f817df88539d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/app/chrome/styles.rs:109-125 | src/app/font_panel/view.rs:86-106 \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":"src/app/chrome/styles.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"861c1da555bf6d51543679a129525f1b8318ab58e57057d7d2f9bc694f02a58c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/app/folder.rs:1304-1313 | src/app/folder.rs:1319-1327 \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":"src/app/folder.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62775327b25858258cf975e91dd1287db3a44cc08554e2e1f4a2d3f86204c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/markview-image/src/decode.rs:407-423 | crates/markview-image/src/decode.rs:429-439 \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/markview-image/src/decode.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"4734d753d310f80db7244510a6b059e7a4ea076677b3b549115397cbd337bc84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/markview-pdf/src/paint.rs:358-366 | crates/markview-pdf/src/paint.rs:891-905 \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/markview-pdf/src/paint.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce55c0f5494822164de0d50abb11dc1a5ae62fee9ef6e8822b3d0e9966f184a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/markview-platform/src/lib.rs:254-268 | crates/markview-platform/src/lib.rs:281-292 \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/markview-platform/src/lib.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb1fddcb0ecbe3c53ef7db9c16a735b7934773019e218e2e7e7d2b11f6df4bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/app/search.rs:197-210 | src/app/start.rs:287-296 | src/worker.rs:646-660 \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":"src/app/search.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2159c51dc6c91a76a656228846caf32f8cf7c840478e1f0c3615a1c8025304a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/app/tabs.rs:347-361 | src/app/tabs.rs:366-376 \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":"src/app/tabs.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51735fc66573f889db570e571ba7da930901861b7e105f59cabfdd9f04cb4e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/app/outline.rs:402-409 | src/app/outline.rs:415-422 \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":"src/app/outline.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdacd3eb4e274f8705d8ea0d2a9e7cf32f0bdee7dbf1da7abf19a1e93ccd587"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/markview-layout/src/scene/draws.rs:80-86 | crates/markview-layout/src/scene/draws.rs:91-97 \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/markview-layout/src/scene/draws.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec7b35c9213a3218ffc6e88588a4c77b0787689e3e005ca21ca216e285a55e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/app/chrome/components.rs:1044-1056 | src/app/chrome/list.rs:143-155 \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":"src/app/chrome/components.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"5649e253b21f631bf37b8032867e29aa7092a617cc69a45164e82f5a509170f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/markview-layout/src/layout.rs:435-444 | crates/markview-layout/src/layout.rs:450-459 \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/markview-layout/src/layout.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f55117bf6dd92512782b95a5308f1b8b8280104be41f3931d58b2bc4a7962ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/markview-commonmark/src/incremental.rs:603-610 | crates/markview-commonmark/src/incremental.rs:614-621 \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/markview-commonmark/src/incremental.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9b00940bd3cfd21c35a52d71bf7f4e44153367d7f2981533c5a79031cf045b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/file.rs:40-46 | src/app/folder.rs:425-431 \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":"src/file.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2170a0cc343c2e3343819fabe7aafcfbf14b3b2b2d59ba31db356f71ca03f9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/app/chrome/modal.rs:181-187 | src/app/chrome/preview.rs:110-116 \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":"src/app/chrome/modal.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81de91b260fa19a12d01df13b358e8969f63fdcfceee84aabbed435ddd9dc01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/app/font_panel/view.rs:371-377 | src/app/fonts_command.rs:138-146 \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":"src/app/font_panel/view.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec69dd02f683573d02199f8d75f705077ea5819b4b924ec6b865fb0f005c20a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/app/web_page.rs:6-11 | src/fonts/download.rs:280-285 \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":"src/app/web_page.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f60b94aa91d9633e3fed2d00dabbfdf93540551cb2b9de9887be294c2abbf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/app/fonts_command.rs:496-505 | src/export_cli.rs:66-71 \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":"src/app/fonts_command.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"92871d048921fe6f340c95c7e8ec0f0fdffeb18356de75d6c6e09505a526301f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): src/fonts/mod.rs:48-51 | src/images/cache.rs:182-185 | src/stylesheet.rs:42-45 \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":"src/fonts/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be456f159194b5772b6dee37061dd3d4ff796b77f7bf4a9e30eb97e759c858d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/markview-document/src/lib.rs:697-701 | src/app/widgets.rs:76-80 \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/markview-document/src/lib.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0d8de524a18d686f78305b08a5632755592befc2e033f42662ec7dad2b9317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): crates/markview-pdf/src/paint.rs:488-514 | crates/markview-pdf/src/paint.rs:1165-1188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/markview-pdf/src/paint.rs:515\u0060 calls \u0060set_fill\u0060, \u0060Some\u0060, \u0060fill\u0060 and \u0060crates/markview-pdf/src/paint.rs:1189\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/markview-pdf/src/paint.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03d57e272a3362a24be6edce3898bb54259173ec16a0e276d3c5212b82ddc4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/markview-layout/src/text.rs:243-260 | crates/markview-layout/src/text.rs:270-287 \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/markview-layout/src/text.rs:243\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/markview-layout/src/text.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddbe40d385aa8dce69b9db897d748899ffdfb890fad19d87394f8e645250337"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/markview-webpage/src/lower.rs:620-638 | crates/markview-webpage/src/lower.rs:661-679 \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/markview-webpage/src/lower.rs:620\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/markview-webpage/src/lower.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a873d701bdb99e009c94c5562c808a0e831815a8dfe72a3782a4a103f9ab646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/markview-document/src/index.rs:165-178 | fuzz/fuzzlib/src/bin/webdump.rs:143-156 | fuzz/fuzzlib/src/webpage.rs:610-623 \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/markview-document/src/index.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f260fbf67b780a25c696fc1c8a4ac60db31dc335a4d70e923c627f59b5b0c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/app/chrome/components.rs:1238-1251 | src/app/chrome/styles.rs:424-437 | src/app/font_panel/view.rs:704-717 \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 \u0060src/app/chrome/components.rs:1238\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":"src/app/chrome/components.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6657cf05f9c7935cfb0b437b2c112feb113a3831594aeb682cc51710eb5ae5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/markview-commonmark/src/parse.rs:1059-1071 | crates/markview-commonmark/src/parse.rs:1649-1662 \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/markview-commonmark/src/parse.rs:1059\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/markview-commonmark/src/parse.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad288029bacf5a6433db50d655232075c374e489aa546aaee16357bbf7fa59da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/markview-web/src/api.rs:500-513 | crates/markview-web/src/api.rs:1386-1399 \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/markview-web/src/api.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbfe60e351a1a8838854be477bc5714d74610b198d0fa070eaa1f89fba78246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): xtask/src/complexity.rs:184-197 | xtask/src/complexity.rs:393-406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"xtask/src/complexity.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8c631a16dec4347dfa271aa2d48caf6981d3d789d9e23ece44c144cf0ef217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/markview-webpage/src/lower.rs:901-910 | fuzz/fuzzlib/src/webpage.rs:917-928 \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/markview-webpage/src/lower.rs:901\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-webpage/src/lower.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"25582fddb6d257427313f65687bea83b0a6f906f8f06bbc456b07d39fe508644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/benchmark.rs:283-294 | src/latency.rs:664-675 \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 \u0060src/benchmark.rs:283\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":"src/benchmark.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"623178e0cd44dec45576501c66ba64fc29582aaed70c7cadae79a0157f2252a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): scripts/webpage_baseline.rs:67-77 | scripts/webpage_baseline_rss.rs:11-21 | src/paste.rs:10-19 \u2014 before extracting anything, compare \u0060scripts/webpage_baseline.rs\u0060 and \u0060scripts/webpage_baseline_rss.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 168 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":"scripts/webpage_baseline.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"719c3cb88fc4fdf24c86209d1e96df3a4548aa7633e8d10124e958d84b9121d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/markview-layout/src/layout/inline.rs:571-578 | crates/markview-layout/src/microtype.rs:505-515 \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/markview-layout/src/layout/inline.rs:571\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/inline.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"618529a14ac49ca13340509f54d51b2d20573469baa81c8f0802d80e35474ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/app/chrome.rs:1100-1112 | src/app/chrome/folder.rs:178-188 \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 \u0060src/app/chrome.rs:1100\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2973f1f359577ef2ba8a2f8668adb8ce5fc8bcb04fd821c567c185c8f27ec09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/markview-layout/src/search.rs:217-226 | crates/markview-layout/src/source.rs:437-446 \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/markview-layout/src/search.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. 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/markview-layout/src/search.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1936b8b7e51a6985f27aa406084137fb6e1ddb8eb4d90b2afdc9f263c3bc40bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/app/export.rs:411-420 | src/app/export.rs:613-622 \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 \u0060src/app/export.rs:411\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn export_finished(\u0026mut\u0060 in one and \u0060\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/export.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55aa1d644099e82b7c4bbda7af4485a6d75561523d90b1a19e2120c2bc09644"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/markview-commonmark/src/incremental.rs:627-635 | fuzz/fuzzlib/src/seam.rs:653-661 \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/markview-commonmark/src/incremental.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a094e030e98d386ea1bb008c85958fe8857b2a3ce16b7d8bf749b80597fd4d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): crates/markview-layout/src/paginate.rs:198-204 | crates/markview-pdf/src/paint.rs:1313-1321 \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/markview-layout/src/paginate.rs:198\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/markview-layout/src/paginate.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"df8a94b0199797b36dd04bdb55f71ea342bacf93bf5c3ece01c1c8a0c8e59abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/markview-pdf/src/paint.rs:999-1008 | crates/markview-pdf/src/paint.rs:1034-1042 \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/markview-pdf/src/paint.rs:999\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/markview-pdf/src/paint.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e810c35c7916ca0501ddab3ad6e5746828df01f78fe8d769dc6d357102c06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/markview-commonmark/src/html.rs:376-383 | crates/markview-commonmark/src/html.rs:753-760 \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/markview-commonmark/src/html.rs:376\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/html.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a34b2c329a742e89a00791085692c94d18de4ba9731b3ec37ac949c9c5212a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/markview-web/src/images.rs:233-240 | crates/markview-web/src/images.rs:249-256 \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/markview-web/src/images.rs:233\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/markview-web/src/images.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a576bee5e1a4e012f3804dc125ff10bfd781188639550589f2ca5f64f74eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/app/search.rs:200-207 | src/worker.rs:648-655 \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 \u0060src/app/search.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn shutdown(\u0026mut\u0060 in one and \u0060crate) fn shutdown(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/search.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d204382b4d0eee53cb4962d9deb373c889318a4a2a5b82c7d559ab026ba640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/markview-layout/src/text/clusters.rs:155-161 | crates/markview-layout/src/text/clusters.rs:170-177 \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/markview-layout/src/text/clusters.rs:155\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/markview-layout/src/text/clusters.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f80261eaca96ee6a72124632fdabe92f4475e9b834a6cf31c1bca8e4509344ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/markview-layout/src/layout/code.rs:112-117 | crates/markview-layout/src/layout/paragraph.rs:228-233 \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/markview-layout/src/layout/code.rs:112\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/markview-layout/src/layout/code.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75c12263273e4530712f01a1f4396e892e6eba58386671845551f6e396d02ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/app/chrome/folder.rs:470-476 | src/app/chrome/outline.rs:426-432 \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 \u0060src/app/chrome/folder.rs:470\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":"src/app/chrome/folder.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef79263ef23709bcb2158066ad1e62ed1dd5a341dd9487cc5a662d2be6700ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/images.rs:679-684 | src/images.rs:1348-1353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/images.rs:685\u0060 calls \u0060into\u0060 and \u0060src/images.rs:1354\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":"src/images.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c865188fee0da388cc1f48233f37fc2ff0ef21c646e66acc3de613ca6e7b73b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/markview-image/src/decode.rs:255-260 | src/images.rs:210-215 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060column\u0060 to \u0060f32) -\u003E (u32\u0060 in one and \u0060f32\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-image/src/decode.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c1b2d1bbf8a3631a71e6f8a95622a5e430b1efe3ad22cdf1dc79a9fdc42deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/markview-layout/src/style/parse.rs:200-204 | crates/markview-layout/src/style/parse.rs:253-257 \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/markview-layout/src/style/parse.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/parse.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ee40e2ec16fe82fef76861a9f398ee52c1d38161d5b4246739abc87af3047e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/markview-webpage/src/lower.rs:1778-1782 | fuzz/fuzzlib/src/webpage.rs:1098-1102 \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/markview-webpage/src/lower.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"541c4c963a5573093f210e46c45abd0bc41c6d4506d77b9b1c1f13197166fed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/app/chrome/modal.rs:296-301 | src/app/chrome/modal.rs:340-345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/modal.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0ff5f53997d3ae5e5503e12abbffebb80c17d29b43b81e92133697448b372e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/app/launch.rs:207-211 | src/benchmark.rs:134-138 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/launch.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad1122f63102edba710eab62533f64a1ea62ef7ec8c1e836ca6df1b1d10cf40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/benchmark.rs:39-45 | src/latency.rs:64-70 \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 \u0060src/benchmark.rs:39\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":"src/benchmark.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c2fa7dbb4e622e9c5f0d01288ec61ad0aa8dd280b9ab54a65cb517dbe5743d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/markview-commonmark/src/html.rs:120-126 | crates/markview-document/src/lib.rs:261-267 \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/markview-commonmark/src/html.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2035dc5159351efe5e02b54a040bf02eb597d002a20a739fac3261eac02d5ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/markview-image/src/decode.rs:447-456 | src/images/fonts.rs:227-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/markview-image/src/decode.rs:447\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/markview-image/src/decode.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44a334438125a8fcc75fbfcef6437ca504ba0f8d2c5e6816eb8447ea78db7a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/app/chrome/modal.rs:172-179 | src/app/chrome/preview.rs:70-76 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/modal.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2731c6d8e505d436ec1e15fb16d97655442682982473f84ac3fe033b15680d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/app/folder.rs:520-529 | src/app/outline.rs:192-201 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn advance_animation(\u0026mut\u0060 in one and \u0060crate) fn advance_animation(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/folder.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ef3b850baf41cc5c0b52d2c0579a2256aaa2a640c3cbb9b58de546dbc8311c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/app/preview.rs:292-300 | src/app/session.rs:236-244 \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 \u0060src/app/session.rs:236\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":"src/app/preview.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c90225dd300bccca81365a358e2c163b3a4a7aa0221dc0d31438205e5f7d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/app/chrome/footer.rs:7-14 | src/app/tab_metrics.rs:77-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/footer.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a21601a57a5193ccdbb7f668bfd0bb305896d3340f1766e34b3becc3a89af9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/markview-render/src/raster.rs:136-145 | crates/markview-render/src/raster/color.rs:35-44 \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/markview-render/src/raster.rs: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-render/src/raster.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed97a7f158eb3e744296128ceb56b47c7ec0ebc726af64644c8bd6e3bd2c93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 38 shared lines): fuzz/fuzzlib/src/mutators.rs:391-462 | fuzz/fuzzlib/src/mutators.rs:593-648 | fuzz/fuzzlib/src/mutators.rs:747-810 \u2014 These 3 members are variants of one another: a block of 38 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fuzz/fuzzlib/src/mutators.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"01baa0cfbb321991ef93d53be65e8f480252f7ec11a60a1ce2afaa1448eaed03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): fuzz/fuzzlib/src/web_layout.rs:39-74 | fuzz/fuzzlib/src/web_layout.rs:185-220 \u2014 These two members are one piece of code written twice and then edited apart: 36 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":"fuzz/fuzzlib/src/web_layout.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"323af3002ef41020f68dde961ffd472618fa712e762d43122a3849fbe2db9c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): fuzz/fuzz_targets/refdef.rs:307-329 | fuzz/fuzz_targets/refdef.rs:333-354 \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":"fuzz/fuzz_targets/refdef.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"477279ae6244384acb16f173fd612a247baa6a72f56123126791c8e45dfdc07c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): fuzz/fuzzlib/src/mutators.rs:893-906 | fuzz/fuzzlib/src/mutators.rs:915-928 \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":"fuzz/fuzzlib/src/mutators.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"752b9e0ccaf69602472118a78d3ebb0bb6744a6d1b49afb6d577cfe1a8fdb523"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): fuzz/fuzzlib/src/highlight.rs:6-18 | fuzz/fuzzlib/src/highlight_schedule.rs:66-78 \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":"fuzz/fuzzlib/src/highlight.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d4a99ce15d2217ea6d2cb9d1aa5da85f086ea06694190568487457f7578347"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): fuzz/fuzzlib/src/behavior.rs:8-10 | fuzz/fuzzlib/src/oracle.rs:561-563 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fuzz/fuzzlib/src/behavior.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bffccd5eacd02d456f7929bb84b0cd1f576a921aecc813e37ea7114d6e6ab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): scripts/webpage_baseline.rs:122-180 | scripts/webpage_baseline_rss.rs:66-124 \u2014 before extracting anything, compare \u0060scripts/webpage_baseline.rs\u0060 and \u0060scripts/webpage_baseline_rss.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 168 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":"scripts/webpage_baseline.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48130bd525159b24d56842322ad85a7951ee768c81ecc8ef89b3722aa4eacce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): scripts/webpage_baseline.rs:184-242 | scripts/webpage_baseline_rss.rs:128-186 \u2014 before extracting anything, compare \u0060scripts/webpage_baseline.rs\u0060 and \u0060scripts/webpage_baseline_rss.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 168 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":"scripts/webpage_baseline.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"511b2fc0c7535b09252b3eeec4c6ff50eb55d28d06202d68dd4d5632b8f074af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): scripts/webpage_baseline.rs:80-118 | scripts/webpage_baseline_rss.rs:24-62 \u2014 before extracting anything, compare \u0060scripts/webpage_baseline.rs\u0060 and \u0060scripts/webpage_baseline_rss.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 168 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":"scripts/webpage_baseline.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4709b73807ba96754871d9527718f913364183c0c7867ac66a2d8fa28a79d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): fuzz/fuzzlib/src/seam.rs:114-131 | fuzz/fuzzlib/src/seam.rs:174-191 \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 \u0060fuzz/fuzzlib/src/seam.rs:114\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":"fuzz/fuzzlib/src/seam.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d33142163f3358e45837218efd1c9bc7bd0b3dfa0a1be58e0228992d3b26a4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): fuzz/fuzzlib/src/seam.rs:776-793 | fuzz/fuzzlib/src/seam.rs:873-888 \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 \u0060fuzz/fuzzlib/src/seam.rs:776\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":"fuzz/fuzzlib/src/seam.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f255116409354d186c5d25fdce5ded58ea7a249fba2ec0a2ba17027fb53809"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 3): fuzz/fuzzlib/src/mutators.rs:446-462 | fuzz/fuzzlib/src/mutators.rs:635-648 | fuzz/fuzzlib/src/mutators.rs:797-810 \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 \u0060fuzz/fuzzlib/src/mutators.rs:446\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":"fuzz/fuzzlib/src/mutators.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d59f54ea3a700ac9d5efb4554be8c65b35f53f1486de1cacb5a96942ae3dbee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): fuzz/fuzzlib/src/mutators.rs:392-405 | fuzz/fuzzlib/src/mutators.rs:594-607 | fuzz/fuzzlib/src/mutators.rs:748-761 \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 \u0060fuzz/fuzzlib/src/mutators.rs:392\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":"fuzz/fuzzlib/src/mutators.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb0e5bf1ef3f7d819d5994d5abda28b4e96b042f7fa0e22c319bc905d7b90d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 3): fuzz/fuzz_targets/details_structure.rs:55-67 | fuzz/fuzz_targets/prefix.rs:22-31 | fuzz/fuzz_targets/sourcepos_content.rs:109-118 \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 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fuzz/fuzz_targets/details_structure.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cec9de5c85ec1c0d8d7356a0b88f0ef30092ac607972fba8d6fae62f210218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): fuzz/fuzzlib/src/bin/webdump.rs:21-33 | fuzz/fuzzlib/src/bin/webdump.rs:45-57 \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 \u0060fuzz/fuzzlib/src/bin/webdump.rs:21\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":"fuzz/fuzzlib/src/bin/webdump.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"991df9c1b1a8508a03d5b2d821b6bc438e8736d5230b142c691a7499df69fe40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): fuzz/fuzzlib/src/mutators.rs:413-424 | fuzz/fuzzlib/src/mutators.rs:616-625 | fuzz/fuzzlib/src/mutators.rs:764-775 \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 \u0060fuzz/fuzzlib/src/mutators.rs:413\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":"fuzz/fuzzlib/src/mutators.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27c8b367e606abb9a9a8e5e40b51be20e76b5ab64e0d268794ad307c6e96bff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): fuzz/fuzzlib/src/oracle.rs:338-349 | fuzz/fuzzlib/src/oracle.rs:355-366 \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 \u0060fuzz/fuzzlib/src/oracle.rs:338\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":"fuzz/fuzzlib/src/oracle.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc550fa73b9851d236c21c502785d1b5c119bde74d4cc9b506590909ca59a002"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fuzz/fuzzlib/src/oracle.rs:383-392 | fuzz/fuzzlib/src/oracle.rs:404-413 \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 \u0060fuzz/fuzzlib/src/oracle.rs:383\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":"fuzz/fuzzlib/src/oracle.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bf1b4899a7167ff550a390ff85b4fbadb3032cb91cb0d6aa1ef467d908f6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fuzz/fuzz_targets/reparse.rs:29-37 | fuzz/fuzzlib/src/reparse_sequence.rs:103-111 \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 \u0060fuzz/fuzz_targets/reparse.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":"fuzz/fuzz_targets/reparse.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"69779790f138419afe7fc329c79b64350020089f218a6ec6478c44e82db288f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): fuzz/fuzzlib/src/mutators.rs:423-430 | fuzz/fuzzlib/src/mutators.rs:780-787 \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 \u0060fuzz/fuzzlib/src/mutators.rs:423\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":"fuzz/fuzzlib/src/mutators.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d55d88969cb12acd6a022e749edeacbe9bc55f8ba661801e91932eeb3ca63a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): fuzz/fuzzlib/src/reading.rs:228-235 | fuzz/fuzzlib/src/reading.rs:343-348 \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 \u0060fuzz/fuzzlib/src/reading.rs:228\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fuzz/fuzzlib/src/reading.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96fc942c1bd676b191d9df2876e218daf1d6a6643e9dada0c00207cde4b2f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): fuzz/fuzzlib/src/bin/dump.rs:35-40 | fuzz/fuzzlib/src/bin/dump.rs:51-56 \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 \u0060fuzz/fuzzlib/src/bin/dump.rs:35\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060fuzz/fuzzlib/src/bin/dump.rs:50\u0060 calls \u0060blocks\u0060 and \u0060fuzz/fuzzlib/src/bin/dump.rs:34\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":"fuzz/fuzzlib/src/bin/dump.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ab82fb09c6bff3e13d14b4d3f016f251f771c893be4a6c2e376f21262afd2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): fuzz/fuzzlib/src/bin/mathprobe.rs:564-573 | fuzz/fuzzlib/src/probe.rs:94-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":"fuzz/fuzzlib/src/bin/mathprobe.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bead410da857962922c686a3c5231da9711a9c16f9c3ffe7a56c67c9d18d64b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): fuzz/fuzzlib/src/web_layout.rs:50-62 | fuzz/fuzzlib/src/web_layout.rs:197-207 \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 \u0060fuzz/fuzzlib/src/web_layout.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":"fuzz/fuzzlib/src/web_layout.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1f7af83188fe1e66d2afdf8e3e1c80f04f774d270db1922958c0a677383bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fuzz/fuzzlib/src/web_layout.rs:90-98 | fuzz/fuzzlib/src/web_layout.rs:99-107 \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":"fuzz/fuzzlib/src/web_layout.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec23aaf4c3074b69db03b4b6d60025bcd02c15f93eaf5ddb0cb4bce6c2058ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): fuzz/fuzzlib/src/parallel.rs:135-140 | fuzz/fuzzlib/src/parallel.rs:147-154 \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 \u0060fuzz/fuzzlib/src/parallel.rs:135\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":"fuzz/fuzzlib/src/parallel.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5023b173be2301a54f8a6a9bec01b5cd34b3f687b806972d8d0814288ac99f0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): fuzz/fuzzlib/src/bin/mathprobe.rs:119-123 | fuzz/fuzzlib/src/bin/mathprobe.rs:126-130 | fuzz/fuzzlib/src/bin/mathprobe.rs:133-137 | fuzz/fuzzlib/src/bin/mathprobe.rs:184-188 | fuzz/fuzzlib/src/bin/mathprobe.rs:191-195 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fuzz/fuzzlib/src/bin/mathprobe.rs:119\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":"fuzz/fuzzlib/src/bin/mathprobe.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc88a9cf04aae457672de0ee724b29cf90b176b216f8429f4de20e6ad3be3b4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @markview/scroll-sync: @markview/scroll-sync: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"377da77805e39bd49dd6dc972f5ecb77c3b6631d14468dd4765ac6bf3017e91d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: markview-font-archive: markview-font-archive: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"97e833a19d3ba737a93176d3348492ce1b8fe5d3a66ea2c161c6ad61096f0c96"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: markview-geometry: markview-geometry: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"60ca8fc593ed830842655a47b57e7781c59ad2371480d90c3315ed9177f36b98"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: markview-platform: markview-platform: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"34428c2503323a4f4c06cf7e2e9786e71f27e985c5935626111daf1ef4a35d09"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: markview-document: markview-document: abstractness 0.03, instability 0.00, distance 0.97 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bbc21cfbd0202cc6492e1d343f071b6fd99a44fbe6ea6b30786fb481ad3690b5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: markview-layout: markview-layout: abstractness 0.01, instability 0.25, distance 0.74 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b73ebfca596a1bad8fb750289f4b3e5d429345ddbd3f665939846e1cc438a427"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Row (LCOM4 4): Row\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":"src/app/chrome/components.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d335d4e16545c82aaecb400d1073e37f7347e3117f1ab71c8d777032f7f7ae"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Check (LCOM4 4): Check\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":"xtask/src/complexity.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb4a56fa5d6d20928e5a95d16bcbc1e33aa6cd68ca13376f08eb8df9d97d7af"}},{"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 web/app/vsc-ext/ ran and not one test passed (\u2718 [ERROR] Could not resolve \u0022../wasm/markview_web.js\u0022), so the coverage would describe the failed run, not the code. 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":"D10","level":"warning","message":{"text":"No assertions: the initial document has blocks \u003E 0 and contentHeight \u003E 0: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/demo.spec.mjs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f02f9f083066af6535ff70802599e708a5033f5955cae4cb16767325c37bdc2"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: typing into #source re-renders the canvas: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/demo.spec.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c639bcf7736aebeb9127f88c28c16e5498b1db9265a69cdbe6995329296400"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: glyphs \u003E 0 and frames \u003E 0 after the rAF loop runs: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/demo.spec.mjs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"21264eb8d92af594d748dd9403574f55ca21cd5d95fdf65b32473b044f9027a1"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: a second edit reuses blocks and changes contentHeight: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/demo.spec.mjs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a58e3c689366eeb05682440e50fe4700e2f0ab35abf64d05f15e49c8e366a4"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: divider grip stays centered across layouts and host styles: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/tests/editor.spec.mjs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"171828bec5154326822ced50c87a4be73ef10ee0b39d6746df304555c81289ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/lifecycle.rs: src/app/lifecycle.rs changed 76 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in App::handle_user_event at line 180. 13 of those changes were fix/bug commits, and the other 63 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- src/app/lifecycle.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/lifecycle.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad560d9a8dd5c90cbea480bd922e5650690bdf4a5ae175db3e98121ba38e644"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/window.rs: src/app/window.rs changed 81 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in App::dispatch_key at line 616. 18 of those changes were fix/bug commits, and the other 63 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- src/app/window.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/window.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"81450052ff54c7cd0378511bd73b75255b05cb8dd46620d0a9cf48dab08f13ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/style/types.rs: crates/markview-layout/src/style/types.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in Rule::overlay at line 937. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/style/types.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/markview-layout/src/style/types.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"2852a8f0a213bf8af2c7526e35f5571f9ff2c13d847df701e86509d8c591657f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-commonmark/src/parse.rs: crates/markview-commonmark/src/parse.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Reader::child_block at line 1043. 4 of those changes were fix/bug commits, and the other 48 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-commonmark/src/parse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-commonmark/src/parse.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"61de4695f7ac2f469ea72515537ae2e8516cca6346720a99ec7b4cbb015cfe62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/shaping.rs: crates/markview-layout/src/shaping.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in TextShaper::shape at line 903. 1 of those changes was a fix/bug commit, and the other 39 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/shaping.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/markview-layout/src/shaping.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f7e19ad5721cd9d5f0f1aa0a166e9de87b344ad79af80026758c8679f3be9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/worker.rs: src/worker.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Worker::with_services_and_parsed at line 150. 7 of those changes were fix/bug commits, and the other 29 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- src/worker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"7980b393beb22a2ad921559358f565f3408b7cc66f51b9a43451796229dadb64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-document/src/lib.rs: crates/markview-document/src/lib.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Block::images at line 789. 3 of those changes were fix/bug commits, and the other 38 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-document/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-document/src/lib.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3faeb40f52c4bffeb2fd473896946a7d88b21048a0fef1bcf8b0f448eeb075"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-pdf/src/paint.rs: crates/markview-pdf/src/paint.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in Painter::draw at line 659. 5 of those changes were fix/bug commits, and the other 20 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-pdf/src/paint.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/markview-pdf/src/paint.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ad31221c8ff47570bf649aaad7a39c9aaf3d3d1aeba7503bc23a84d99d6a72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/painting.rs: src/app/painting.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in App::render at line 29. 4 of those changes were fix/bug commits, and the other 31 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- src/app/painting.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/painting.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"280eeda1c456f99450c9758db020d47dfbf62693e441ce01996990895e7e52a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-render/src/paint.rs: crates/markview-render/src/paint.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Renderer::draw at line 128. 6 of those changes were fix/bug commits, 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-render/src/paint.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/markview-render/src/paint.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3126f49192aa11183f541d9687d16a3332fad8af170f6e55c190a746e1dfa2fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fuzz/fuzzlib/src/seam.rs: fuzz/fuzzlib/src/seam.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in mvfuzz::seam::definition_scan at line 279. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- fuzz/fuzzlib/src/seam.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":"fuzz/fuzzlib/src/seam.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"8737af8c2653e89e6fe743f17461ced3eaeda1be444f559891d78f4e29d395f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/style/parse.rs: crates/markview-layout/src/style/parse.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in markview_layout::style::parse::validate_numbers at line 457. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/style/parse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/parse.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"6757db400fa6a57fe3bba76949b3d00da78e6376b29c997e995843c70733b617"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/settings_panel.rs: src/app/settings_panel.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Model::update at line 152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- src/app/settings_panel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/settings_panel.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96df5cc3afe7d5d0ecee9f7e934a88546c1df07e86babe8f06e3e037abf0bfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/layout/paragraph.rs: crates/markview-layout/src/layout/paragraph.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BlockContext::paragraph_bounded at line 329. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/layout/paragraph.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/markview-layout/src/layout/paragraph.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa1a31c05d768e6a49bfa06709d07d48baefc3ccf4c60772d878b31230a8609"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/layout/table.rs: crates/markview-layout/src/layout/table.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in BlockContext::table at line 79. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/layout/table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/table.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"559d86976991612630123d2b49e9a66514ef3ffc8c66451f6c4517a2c93044d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/app/search.rs: src/app/search.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in App::apply_search_navigation at line 531. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- src/app/search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/search.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68004cdd9609c57f2bcd61bd3ba0581bae93c8cd681ba47fc00c308b8460d2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-render/src/frame.rs: crates/markview-render/src/frame.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Renderer::prepare at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-render/src/frame.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/markview-render/src/frame.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"911c8fe8b68a14000a7de61f17bbb968dbd07277008594316ed68234539b103b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/test.py: android/test.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in test.main at line 137. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- android/test.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":"android/test.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad17518352f6e2ed40ea03379798a9ad66eae69e06d2be3de619fd1276a4d81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-webpage/src/lower.rs: crates/markview-webpage/src/lower.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in Lower::table at line 792. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-webpage/src/lower.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/markview-webpage/src/lower.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbafd3dfb4c57a5e494f867bcac6855f1627adcd149fb10f61d99c3cb937c6c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/images/diagram.rs: src/images/diagram.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in markview::images::diagram::resolve at line 101. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- src/images/diagram.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/images/diagram.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"687175452b13a1bc5a70f62ec11ab78515be11ab5e6fad31ac18b8d50ca0fba3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/java/io/github/szdytom/markview/MarkviewActivity.java: android/java/io/github/szdytom/markview/MarkviewActivity.java changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in MarkviewActivity.receiveResult 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- android/java/io/github/szdytom/markview/MarkviewActivity.java\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":"android/java/io/github/szdytom/markview/MarkviewActivity.java"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff7f876010589ed5a260fe2b027ff4ef2120ab1be494f47fbc985bc8da25bb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/scene/flow.rs: crates/markview-layout/src/scene/flow.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in BlockLayout::seal_scene at line 356. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/scene/flow.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/markview-layout/src/scene/flow.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f502896f64500755d0da5b35523dc10c718b4ced8817c1ad8bb76c198755f0c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fuzz/fuzzlib/src/oracle.rs: fuzz/fuzzlib/src/oracle.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in mvfuzz::oracle::document at line 73. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- fuzz/fuzzlib/src/oracle.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":"fuzz/fuzzlib/src/oracle.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"761632e0d0e7646f9adbca5bdfbbb1cab0b684e920087c2ccf3c0078ce72132d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/paginate.rs: crates/markview-layout/src/paginate.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in markview_layout::paginate::bands at line 179. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/paginate.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/markview-layout/src/paginate.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"773d6e034d55ab4e873e69bba81fb990336e1ca14257c72e341aace1586707e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/layout/cache.rs: crates/markview-layout/src/layout/cache.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in markview_layout::layout::cache::block_link_origins at line 186. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/layout/cache.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/markview-layout/src/layout/cache.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2be1a27eb3bd87bb86775882643c189d03ccae4afd965f3f16b474ba635d949"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/linebreak.rs: crates/markview-layout/src/linebreak.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in markview_layout::linebreak::optimize at line 225. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/linebreak.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/markview-layout/src/linebreak.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1ed709e6018b8172bbdc36bf1a4f5617c643316be9326cbe0d91b3c3f2cd88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/app/vsc-ext/vscode/src/preview/extension.ts: web/app/vsc-ext/vscode/src/preview/extension.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in extension.activate.open at line 20. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- web/app/vsc-ext/vscode/src/preview/extension.ts\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":"web/app/vsc-ext/vscode/src/preview/extension.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"014ca59983240ff844eac1fcd21e0edfca31b1cf3d75ede35b91cde62f0e7bf3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/build.py: android/build.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in build.main at line 42. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- android/build.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":"android/build.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93e0c8f625e375f610e61b3ddb741a538c44d1db911a8b74fec482191d8ef92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/apps/demo/src/main.ts: web/apps/demo/src/main.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in main.boot at line 208. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- web/apps/demo/src/main.ts\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":"web/apps/demo/src/main.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3358e01b0f472c8936fb28996ed10ccd054d39b2109ddeed4ec1a3de0fa48739"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-platform/src/window_frame.rs: crates/markview-platform/src/window_frame.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in markview_platform::window_frame::subclass at line 152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-platform/src/window_frame.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/markview-platform/src/window_frame.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7988cbea2fe912255c38fcc54b31180b2ed84096a2b4d5d268ef6a3f9751f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/app/vsc-ext/vscode/src/preview/webview.ts: web/app/vsc-ext/vscode/src/preview/webview.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in webview.update at line 63. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- web/app/vsc-ext/vscode/src/preview/webview.ts\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":"web/app/vsc-ext/vscode/src/preview/webview.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d65b09ee7082c4e6eb102deed2d7061d4beeb6b86cdeda9db89a67f872239d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/text/selection.rs: crates/markview-layout/src/text/selection.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in LayoutSnapshot::geometry_rebase_selection at line 24. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/text/selection.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/markview-layout/src/text/selection.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed7c48a33fb90cc716641257af08e8845fa407c206a7b64034d39dbcb0ec126"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/packages/markview/src/viewer.ts: web/packages/markview/src/viewer.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Viewer.#frame at line 247. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- web/packages/markview/src/viewer.ts\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":"web/packages/markview/src/viewer.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8f22a97fa1c75db9b9c24f6436c4b4d805655cfe3ac73f4fef2988363fbd0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fuzz/fuzzlib/src/pdf_oracle.rs: fuzz/fuzzlib/src/pdf_oracle.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Structure::assert_links at line 305. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- fuzz/fuzzlib/src/pdf_oracle.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":"fuzz/fuzzlib/src/pdf_oracle.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ceb77ce756139f2d6b3481c324fad2a5d69c69bb2ee4a2fbd62e64a47620f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/compare_readers.py: scripts/compare_readers.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in compare_readers.main at line 409. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- scripts/compare_readers.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/compare_readers.py"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcc0e0f0c455c9d77310ed8af1831d6c6b004e08eeb6580049edb079c52f830"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/markview-layout/src/source.rs: crates/markview-layout/src/source.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SourceIndex::scroll_anchors at line 169. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-layout/src/source.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/markview-layout/src/source.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfabdc4cd078910f06842e306f74bcd6bb8dd6231d3764f80c0a1220f24158cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fuzz/scripts/prepare_pipeline_seeds.py: fuzz/scripts/prepare_pipeline_seeds.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in prepare_pipeline_seeds.write_markdown_seeds at line 272. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- fuzz/scripts/prepare_pipeline_seeds.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":"fuzz/scripts/prepare_pipeline_seeds.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b3620474fd42b0207ff03af50616df001c3131cdc20e73c9a88c56cc581a8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fuzz/fuzzlib/src/history.rs: fuzz/fuzzlib/src/history.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in mvfuzz::history::check at line 12. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- fuzz/fuzzlib/src/history.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":"fuzz/fuzzlib/src/history.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe56afc2ea59ddc3a3941e2f273f98039ad3c2e06e5a09da18b088711ccef163"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/state/display.rs: src/state/display.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DisplayState::can_display at line 17. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- src/state/display.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/display.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e2d89ad5011e7b440e67b1963a7a3a070539a63738ff0521911508ec6cd8ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fuzz/fuzzlib/src/interaction_sequence.rs: fuzz/fuzzlib/src/interaction_sequence.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in mvfuzz::interaction_sequence::check at line 71. 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 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- fuzz/fuzzlib/src/interaction_sequence.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":"fuzz/fuzzlib/src/interaction_sequence.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3e75b6a6c274ac6713f176724e7409d4c50561d6d4b53a4255a805600c898a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: scripts/generate_test_fonts.py: scripts/generate_test_fonts.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is generate_test_fonts.render_regional_fonts at line 112), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Ctest: expand rendering regression coverage\u201D; \u201Cfix: pin fonts across all automated tests\u201D; \u201Cfix: keep exported text complete and pin the fonts tests shape with\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- scripts/generate_test_fonts.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_test_fonts.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"939d9326d980ee2b2be90d1497e2d184881e87abd5bdff538ecc2da733c4c3e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/markview-pdf/src/image.rs: crates/markview-pdf/src/image.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is PreparedImage::new at line 19), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: use as_chunks to satisfy clippy in PDF image encoding\u201D; \u201Cfix: compress PDF images with bounded loading and rayon\u201D; \u201Cfix: recover poisoned mutexes in fonts, images, and worker state\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-18..2026-11-16, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-18 19:58:37 \u002B08:00\u0027 --until=\u00272026-11-16 19:58:37 \u002B08:00\u0027 --full-history --no-merges -- crates/markview-pdf/src/image.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/markview-pdf/src/image.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e65fb16828cf6ed9de1d8c4943ee7236d0ee9d5a92d56d35e814ecd4418e49e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement viewport zoom without changing the document layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/window.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"274e952cf24e53ba38e0e08a045067fe2b16de1638da1944e4acbd20cebe57e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement viewport zoom without changing the document layout. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/window.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4c7c77be681fb7fd2e709877c12d5d015a485d92811f29ad8b8061894f0bd7"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060Cargo.toml\u0060 makes this repository a deployable product (line 239)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (90176 LoC, 182 module-visible types across 15 directories) overshoots its size bounds. 2 of 26 build unit(s) (Cargo, npm) overshoot their size bounds, lowering Project Cohesion to 8.5/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":"Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47e8df767bfc37da3227cdd4038c0a9e51cc4af34f700a3047c62f87429ba9d"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/markview-layout\u0060 (32604 LoC, 163 module-visible types across 11 directories) overshoots its size bounds. 2 of 26 build unit(s) (Cargo, npm) overshoot their size bounds, lowering Project Cohesion to 8.5/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/markview-layout/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b25ad065b64b25d31f4436c0457a1e3be3c08864bd4e0daa03f8e46d2e2a0c"}},{"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":"f34cda4d9b618715052df467e687657680d13824eda223ae9ea123aa83b9714e"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14f99a98b4f9f0155a9c06542817b42e8f77b17f616a26ede6c1e474f792c163"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b15fcb99513575cf0f6a4ac9e7b918cbf2cbab61bdf7cd4823d783f16e529b85"},"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":"3c2d03de5dc87b32508943afff72e64d7ac8362677d083d39a5a36375bba22dd"},"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":"ae3f9651ce307d6a7fdea47dc611916c57db885eb20e13e6c6c6a6553071fb0d"},"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":"65b9117e7776206b0d0fbb3de2957a516eb7f184cabfc4d1e5edbd3949a5938f"},"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":"899ed15c0cd0cceebcdbe5720192ebe105fd7b912f1518652c54d0390df461ca"},"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":"df0b511dfbde9cbb395c29ff1e8fe68c14077374c92d0a3246a3b13c44ac9f2a"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"57b66fb97fca583d8e5d5673138109bce808acb802a51ce30a4b6f2ba4fad10f"},"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":"7e6401aef40fa273160fec1efb0b3c4d132034b9f9fc8acead504de34ff79800"},"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":"0730847df21c4986f9f73fdb9c63aba20163225c65e36f0b63516b29224c25dc"},"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":"ac1b6de529ec325d0846e680ba786f7e8a4a0b369357a12e7d37e6aa0beb5c35"},"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":"bc7132d15236d2aac05f28b153386d63e7836c2311539211ea335172b737d93b"},"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":"dc8481f67fcd2a887ef37d4fbfc94459f9cfb1a46c95ac5b30295880cb784edf"},"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":"a368f6213a0392bc1665999d11e58b294d9e2a70f62ec40da7976d28c5c82578"},"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":"29fd55f77a35850634208bb1d81f8f86c49507794757e16b07b07c7313c3c471"},"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":"0fd1026fb8b6baf77454d142f85e266c06ab29dfcc9e8866b87bf69ca23e6da4"},"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":"fd21698c32d78d94931e4f929466c7d8ff69499891fab6ef091cc48b30ac6ee6"},"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":"6ad112367ee8781de80e9a9ea2c5442abd2b56a7e05efca7c15d1c94d5085249"},"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":"4de64e11766eeb36f47056a5152643221e3ec70cd1352372253a4bac31f365bc"},"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":"95f9a11574eda16acb819183cd00f38152b2f419763ffe68f403321c78d66df4"},"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":"fc29cfca53b0af2eb18e3f92605362c8a879854d27ee79108d9ef39b10471f08"},"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":"dae378141a404591a73008f8c54611b5990afcd916e33e6886491dfd4068cc35"},"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":"f5bba60ddf22db4c4c30d83b65dc14e1c4f30f97dd927be8e412a31a68213cd7"},"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":"f9e0e756e8686003e30f0c5cbc44d5f20bc29da6ec3eafadca006a67f3583420"},"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":"28f1946785258e7cd925d8fe89b9cc64b3b025b8b8357b16fcc161e93d0650d4"},"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":"4bddb174865a7ed8a92c9137857aa825b318b470ef0cb00d5ea9edaaf9d842da"},"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":"ba334be1b7d1ab01f0e5714a0ff84bebc1616ed3f6ceec77edfd952033487924"},"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":"c16d3c42af671ccd9a3f8c8fbfd8cb2e9b8098849255a038dbd3956faea1aafb"},"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":"8a8840f6871dff3abfef788412679fc089fe78f7f010564be551738b3ffde7a8"},"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":"d316515c02596f01d811341583e3a7fb6b2a63039a18b7839f508b7c152ed372"},"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":"2feb5746f6ab7b13feb42577b5a6bada29c6ca5617def30fa0a957aba2c87d19"},"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":"6e16d1f8af4ccb30879979367fd1d87fc784d1c7f8ab8c779b5c042cfb5cfced"},"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":"9032363ec2893a370f4db43710956344a1fa72e681c12bb4aa9be78181b63566"},"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":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"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":"866f5db9e17cba13054be81498300d5689d6380b38ab693dd948f99e20adbff5"},"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":"54015389eb5f9a0beb6433e209224f32665bbffd45f48b4ac71eacdc7584cddd"},"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":"f1e1192c47a921b2ff67aa0fdfcba02b9247ddb8ce6d0a069e043a2c0948c6f7"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"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":"71d409363b55a1d24dc05307b924cc6c6729c6dbea72afa05fed85828fe13b0b"},"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":"f3c5d3262642571eb86fb6dc739cbea7d01bb98f44e21f0cc3f4e745944454d2"},"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":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"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":"493308c88e8c66fcb98ce33fa8a7c07e2fee06375429dcf7629ec741ee5f79d7"},"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":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"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":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"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":"9fdace52517967069682f4d541cf1db103d249850b9ff9e28bca1b7ce09cb58b"},"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":"05dd1cc6a6536213feac72458953b3ecc92da85b7219289a9d2c68054660f8e9"},"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":"58416306c1a27a37c4768b939e55dd2865e8672774adab59964be2ffeffdd74f"},"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":"23f8947fd2adf8ba79fd867fa13548be4dfe17c4da762edae6f85ca659592f61"},"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":"b362c2741e360a5fb44c822f259620ea912355cd4023e57174bf0b7415ef333e"},"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":"7e72509928bbe84d0cea22de6085571c4fdbc87d96ca4a6e21fe741253de6e0f"},"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":"3c81963ab08ad31018dc0e58e480efebb594e590a3992edd2926b863ca5d3d0d"},"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":"283f9b1329dd9c531a97b91f445bdf75776fe57d640b14fe41889f78b617f81d"},"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":"125b80dfc480bd1aa5a6006ea1200b0b956b8c125db4b013c76d99373da13936"},"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":"02c6c014aad5ac545c1fd470faa7a26e209a78a8f52148ea9e4d8103ff6809d8"},"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":"38823e68c397aae9f5f9afcdae47da5188a0d33cbcb80c3f93e974d74472cdd9"},"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":"cb7b68b4fc1c21c60a9a7b8a37b6d668a4d6bcefb42035549bed74f644cb0639"},"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":"ae1d8298c933733790260d07fa2ecc535735862fe1731623c2b5c8bdf90fc124"},"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":"c57c771bc0311323c685c6cd9013dfaf09ccdd254f7d8907faee948b978ea0e0"},"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":"49e7145363c347537927ad9a0a7ffce7ebfaf45fee7c633a7a6a34e18bf6b259"},"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":"a6496e25baa575e84a64636f0c1e6d2a82449ff421599ea0ede4400581fb4cf8"},"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":"e7dcc1f789b91f364901a3adb45c6e04a3f628be0e8fe8b852145ee23f497eb8"},"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":"443677395f9005823fb20184aa3ad36b7f56a545b4244d0bc785020d5227061d"},"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":"ddd2cd88efd2fc077e7341fe3d213413eef438c0853ecfc875e11741c7ac986b"},"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":"0d1d49d9ea364a425add5a958fcbbcb7e4fd381979a35084cca846a0ab1b81d8"},"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":"684064d51093ee5fc93670ff8146ef5d0a05737ca50bd656491b5fcacdd89790"},"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":"fd1ff54861b7322014ac12e24372af7ff20d8d35a510f20ec99efee0935b026e"},"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":"dea0918b508554255c5047e3b97d318b33694b0664e76ba67a58d68c6a6e0d01"},"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":"66904d686a1a5a1f251d4906ff0a6fa7049016dba619512b335983e288ab5bda"},"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":"e285b72acb1a23d6dd2b9a00a891286d8f5b362f54edc4221283b59f72af4b57"},"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":"6c111469c1a568718f6cfbeb46920bb81e0dfc1d20b2c95d43c8e9f8cae01bdb"},"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":"0577654b96537a3faaabdc5092bff891c7faa02457e26e05baf95bf95e2e9392"},"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":"93ce9774a4b422c3382f92b837f60b2cbfb87c0e7ea488397f450e7c1b5662d0"},"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":"462ad28396cd5dbc71cd243d68ba9b6274de2b47fa866d6e056a49feb871f964"},"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":"3dbd344fd1008e3e0f4845178a1a4ef9b4670bbf04bc8d176e1085575a66c355"},"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":"0f34fa1b15ddfebcfa185e744e229ffa00f965fb6209b0d96244cf3557c7235c"},"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":"6e088df0c4e837e989af105888f4996fcc07e1b7b8df6f3afd507c3430083f8f"},"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":"00a81cf2a4c01818ce1bf57b9f05cad24a102a2f0ba0d9fc88dbf3ea630f6d76"},"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":"093daf7d834936128276b4c937ebf83618915fe179cccfb34004b67152633945"},"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":"82b7a6a3b49a9ad91ac1869d56701b2306286640d7758c22a2219ebf00fde45c"},"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":"1cfc24ab7ee7dc1d010ed21e0c1a75c88d4d16ed4c48eb6ae4826bdec821cceb"},"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":"59358dbbd9cb1fd798ffd9eb474a2fdb5c720818fb79e7e373de7a05e483f5d1"},"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":"b9c47fc93295464d5cc3adc0717e769665df5b0d738d3c2ed88f210570b493ec"},"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":"9195bf602e013276d5a5ed386a783300b488b6b7d211f7de88f326ace652bcb5"},"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":"7429e989af27a5d562ecb897d857897bc9cb3d90a54a846d156d1a86da30c94e"},"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":"10a40e25db5a5c8a85ec6777b278fc6619cfec5e8f4ef3d889ce52fb79888256"},"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":"ceb79c0b2f17ea872cbc751720dbb2784e6b3247a50a41c8f48244934295c001"},"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":"0695f758fe675ffe7f54fdbb1a92afdf2cc055659193c1e64f89628dae6a5d4d"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"455cce69224d7e351bbb4a92ae21ef29299ce47e235f98bf032cab7e5feb3834"},"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":"ffbc72e8cd6341236bbe72af3833ae9e9eafd2558faac637085cffe510b7cd74"},"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":"67e2b930b8358f3416ec577e0e13b7953aaaa36e430edcdc8077eb43c33027ec"},"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":"9b61a38b316915e03afdd9c59c976b665108ffb02f73ef7f94e853c92c683f20"},"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":"b120aca97cd132382de2403c18b512c9f6bb11e086cdb74f75eff02423c3798f"},"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":"b025c489fb07cacd9881a03123c2b430e55d30a35bb42413e3ae9ad91c676a8a"},"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":"8ef984e297525fcac7faab9d61f4e5ac1976926b3a41a463457284ccad464730"},"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":"f393f6c500d55581db623bd9061b9e01711d2857440f5b5376d0b8b6a4d25a02"},"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":"966062044caa66975ef1108895b6aef18f65ddbd3f3828fbc03a8a5605102f5a"},"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":"8ad0d24ac92229dac41174188b75c8624ea3e97dcb50276918c66657a6fa67d8"},"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":"4c6acd659bd00330352140287dfe8b1b43ef6da8157d3549687845d39dc67ba0"},"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":"5d13af9da20dcec5369d804a2817c2be8b13089006611a36581edd129c3f2b76"},"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":"3cd8144a6c5acf008a8a6b4d62674663e44e2d595753dcbf552fde3ac5491373"},"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":"9281d30c41c8f3188972f6bea146000994886d628fe1d80c85b979ab2b5432ea"},"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":"4a9e922ef991c9d2086fc73fbb0ba77716b5862063723b85fff39ebe077a7d15"},"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":"06daafe2709e468287b505c00bf9feb366987173d1ade4b317a3c3dfe35f4e51"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"f1b966c70d2e5f6ab697ac6d268d54938c60e802d8ea58ea6ff9cb7e10a35f70"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"f4c98c98541a54b0a01af4adaa864ceaab9a6f71372985da44cfe686401ae741"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"015c9c7752dd1aa71bc153a231e960a050e714282f20cabc99d14db926f6f680"},"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":"26cc640180ec0bdc2c62ff750a3bd5a95de52c587e08cf017581ea281d9487f4"},"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":"1de4e8df69f8ea88743a72dc79ebdff0df14ccb12667fe14ae5c33266501ddc5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"64478662fa5e1544368a8d37a73d78bfc90ea789fe52460bc2794d70b8e273b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"5a0307a0e95589e470722eaa1f6edefde899ff9d045423b92eaede73ef396b02"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"59bdb5a1e8e9e2536fc49c741fcb4259a61a8678fc811d3adeb596662203897f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"04b15c1d822501a1f3b0513e178960337673a790f4f183f2453907ced2d2833f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"fd34071f0a37397b22950926e6e7d533f19a1ab2e35c80a3ec230eef7195ce4c"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"9e05a9afdb159c3b4e03fba36ee6c997dfff609cf8e7411f86b673ca79d09a53"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"1d11b483dfcf915b1cf80342d758e26c1a3f32b269afb2615b61f8aa4d116443"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"5820d2832b24c301dfa745945b6d73762e17d6f8190921e1bba42ea7ccd769f9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"d3863a2595bb228753ae718bfb2db02eb99929aa10f09e1bd606c6259c16041d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"a5a94de598d5f66dcc4ccfd4adeb9bbd82d59e61120ddfa86a1354ef816f7094"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94112b1d706b2f9d9118c577518290919c2d702aa0b944fa06a5bcbb51101185"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cd6ba725d4cfdefa0b9a1fc9a630396a4a700aff93699a8233f4a088607d6d7"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e277379638cb16fff7275c5b7c5b105a2d7fc784aadcba10718a975f632bfadb"},"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":"011c010b2ca5ce813356c840f6c119e11b5a9d2fb89357ee072b729f012282fb"},"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":"563a8f482c35e5b684e67cc98a2fb6c11f994362c4377bc98eeb45234fb16a61"},"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":"5032bb9acb669777967e60e32055b24e6d47fbb288c7fa5ccc529cc885731661"},"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":"e38e43908501b274dcc1906ceeb99ef6ab57ed2c1b4f20dae92e4271371a0f40"},"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":"896d2570a04d56854412456b78ec056bb9bccbb8f5b5e1af2c4179af62507eab"},"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":"3eb1478a417c493f40ff8de244b27eb20489dff9397c28527092db7390e06068"},"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":"08ca8332ca1750cf70ac9393491610836a2b03bbd19a6009011b0e751d09fd61"},"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":"669a1c459c774cbda7cc5eb54794d3c38b3ae5725a281b1927fae432ee65af4b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b74abf03c25959b9ebd22ff7711b559aca564ba6aec6501794c35c115247ff12"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45d162bb378d486a7bcc633554891266f2f093b64e0c83b06447bbb7b54992b3"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"d30da30f89d9a74c266d4251b3c7f0f8f405df0b95780db1bb6f8cb17aae78f5"},"taxa":[{"id":"CWE-926","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"a606f28b725ebb30254c5320fdc9720d0205278275b93f7c0cc42cd06f09cf73"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"600dace85ffddec34a1603d6832486149e4e197d44efe1f0e740ef81fce4452f"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"b7f0a71e31b0e927743cd1155c7cebc25d81a0494be0c83150596e3c4b6f9dbb"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"d818d83dc41901de2a69e72c0823c82250532f253cfe29ebce4f9282facaf7a2"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"5f18facc4a6605d681b4e49d62e24f4546b34dff189f1d8aeda2cb712c61e41d"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"7465f058ebb7d6430eb067c87468eb3099d5790944167bc34fd72d735d2ae0d1"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"8a949a600f80248aa152b52460b879de044792eba940f0d72fe7e904a6b7642c"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"01daa918f90f0fd08a3be78dc60f0e6b8cf4762985c2df59469442ed0d351bfc"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"bb733f5ee3ed86234038b7549a7eb58cb54fbeee9f61f1ded87ffc526a631f94"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"8ab09fb77277da0f8b4e154a45f036edb41fb44df3c45a12f7621599f6e2b2af"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"6004bee31be5f55467f29f4ee88f6f3e8d1be62064b45986e5ffd7ab2de822a3"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","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":"c356dafc2d2f879539349393edf47ceccc3e0771bf15e4dae816abd8594fd25c"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","severity":"medium","relation":"direct","declaredRange":"0.25","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.5","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.1","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.1","advisory":"RUSTSEC-2026-0372","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: controls.rs \u2194 store.rs: \u0060src/app/chrome/controls.rs\u0060 (context chrome) and \u0060src/settings/store.rs\u0060 (context settings) sit in DIFFERENT parts of the tree yet change together 83% of the time (10 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) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060b55a9821\u0060 feat: restore browsing sessions across launches; \u0060186c8f8e\u0060 fix: move tab style to user settings and default to underline; \u0060b30c8836\u0060 feat: add optional single-instance window reuse \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/controls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19d75f058d523695e9994a573c34c2546c6df7a5f5b4ae8f9054940bae9967e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: interaction.rs \u2192 controls.rs, icons.rs, preferences.rs, store.rs: \u0060src/app/interaction.rs\u0060 changes together with 4 other files \u2014 \u0060src/app/chrome/controls.rs\u0060, \u0060src/app/chrome/icons.rs\u0060, \u0060src/app/preferences.rs\u0060, \u0060src/settings/store.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/interaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbf5580c85ec70dc15c94b75534fd428ccd93898b230ee43b7b8a62c0a1d951"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: state.rs \u2192 icons.rs, preferences.rs, store.rs: \u0060src/state.rs\u0060 changes together with 3 other files \u2014 \u0060src/app/chrome/icons.rs\u0060, \u0060src/app/preferences.rs\u0060, \u0060src/settings/store.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1304399611271fa4a9b23c5b003af28757f6e2465f9560710ebd1fe5fef9237f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: controls.rs \u2194 preferences.rs: \u0060src/app/chrome/controls.rs\u0060 and \u0060src/app/preferences.rs\u0060 change together 60% of the time (9 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060b55a9821\u0060 feat: restore browsing sessions across launches; \u0060e007a987\u0060 feat: reorganize settings and show restart hints; \u0060186c8f8e\u0060 fix: move tab style to user settings and default to underline \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/controls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d423c669282dbb98776f0acf4eacfabb5b7d8424cec0d534db0551cebda0a6"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: export.rs \u2194 worker.rs: \u0060src/export.rs\u0060 and \u0060src/worker.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060428f78a8\u0060 feat: render raw markdown urls directly; \u0060b7ff362c\u0060 feat: open and export standalone images; \u00603e0efdb5\u0060 feat: render obsidian wikilink image embeds \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42dae90e300040717d533bea8699844be2fb108ec6ff9b2f9d1637c25f425ac"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23242335439540a7f0752c9def5c038b557d1cb0f8e6f7b448b5f69adcab3c1d"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"acf2bfab54704ada202a247df310a4bc395851eaeb11f8297c2aeb57062bd23e"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060warm_fonts\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/markview-layout/src/shaping.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a9d566eb5807a7143966c4fd79478c9c5366d430cd85c0236f5d2090a126e4"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060validate\u0060 does real work, but one of its branches is \u0060bail!\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/markview-layout/src/style/types.rs"},"region":{"startLine":1252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57eb43f420fa15c5bc30ff43e5519f62b67218e34448b647cf136ac26568186"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060call_string\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/markview-platform/src/android_stub.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e4918cb756e4d21a5ffb548c7aa8eca1fa36d50b182f9a900d81de848e5772"}},{"ruleId":"IC1","level":"warning","message":{"text":"Skeleton type \u2014 most members are unfinished: \u0060impl DirectManipulation\u0060 has 4 unfinished methods out of 7 \u2014 a scaffolded type that was never implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-platform/src/dm.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"a034a8286aefe14dbbe1e14dae2de52640c6cc6986220b3ae12cf2edd82baf93"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060new\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/markview-platform/src/dm.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a4488597b7a6622495501cb1f81d7afd2d41908c5265026367b5ff70a68a1d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060contact\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/markview-platform/src/dm.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aff87d4cba992acb0616f256ca270ce3d947c17c0fd45f57c38a9ca83a08be"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060resize\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/markview-platform/src/dm.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"9952b96f8400b864964d7adbad5c1e0a190db25a60fad6bdc0b95b3ebb67561e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060deadline\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/markview-platform/src/dm.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ffd3d6a13ea92bdd49a3f0f8373b8c9c9ecd078bdd742db27ff53e30833aa6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Skeleton type \u2014 most members are unfinished: \u0060impl NativeFrame\u0060 has 2 unfinished methods out of 4 \u2014 a scaffolded type that was never implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-platform/src/window.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56162bfcbb04a0f84157fa9450f99ad88052cc7dc34c1e7d3fe05bca9e1490e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060new\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/markview-platform/src/window.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf3a90d4932b4186238175e1e0d62652be803e8771fff37c84204be0803c93f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_fullscreen\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/markview-platform/src/window.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd50348c1af680ece1e8345666cf33d8f3d416c022e540cb3ba94c0956658742"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060validate\u0060 does real work, but one of its branches is \u0060bail!\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":"src/export/config.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"47692c53335cb352a975e33b58aa5f209806870d528c510a1589f708fa703ff9"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060remove\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":"src/images/cache.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89cfbb545afbbfd7cd1a0ef17e81b7f66bbfcd9e7c1614c72e72f38f28e0610"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060report\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":"src/logging.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd63c7565a734bb9bf7e1deab66898536774b7f2d7bfde79c206bc63a82849e3"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 4/8 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060fuzz/fuzzlib\u0060, \u0060web\u0060, \u0060xtask\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060web/app/vsc-ext/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":"web/app/vsc-ext/package.json"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f817cbe1bb4cd7b9c046885a951e7f0db894ee20043b034f5fa9855cc3a03ff"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 20 typed \u00B7 21 plain JS \u2014 the untyped files are web/build.mjs, web/check-packages.mjs, web/measure-fonts.mjs, web/packages/build-package.mjs, web/packages/scroll-sync/tests/scroll-sync.test.mjs, web/scripts/wasm.mjs (\u002B15 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/check-packages.mjs:112 \u00B7 web/measure-fonts.mjs:23 \u2014 the 2 copies are spread across 2 files, 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":"web/check-packages.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed35b82d992f0ae473c6ae24c9721a233db093b93f1bd09bd7882479d61f771"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/packages/fonts/src/index.ts:94 \u00B7 web/packages/markview/src/fonts.ts:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/fonts/src/index.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d898ce942639d4f0fc093ff7e519f7d066c7256dc700a25ca1347b3d39ac01fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodePng (cyclomatic 26, cognitive 42): decodePng has cyclomatic complexity 26 and cognitive complexity 42; 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":"web/tests/png.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39277e23f8408ebd5c2e55a51e29eac04ecb2ac3cf5ee0d20b013e7d075749e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #frame (cyclomatic 18, cognitive 17): #frame has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/markview/src/viewer.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d98aa3a84ea4c86f194a672b225033a60f3736b63f4fc37126da2409ba7324"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 21): (anonymous) has cyclomatic complexity 14 and cognitive complexity 21; 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":"web/packages/markview/src/reader.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b7df9ec8c1f5d812b117078af44260748f43d8df8c818dd687b494dce5e106"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #scrollMap (cyclomatic 12, cognitive 16): #scrollMap has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive 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":"web/packages/editor/src/index.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b731cff454539e3b58def3dd17d6055d8d2732f640d10d15944b10896cf37afa"}},{"ruleId":"R3","level":"warning","message":{"text":"web/packages/editor/src/index.ts: 521 lines of code: web/packages/editor/src/index.ts has 521 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/editor/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1044a08a50b5ef70f0706efc83e7d6821a1140d5f12be0cf7b14c33660452674"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/editor/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f0dd4d39df936035019a204e00b4ea56ab41d0b4a75a482385be58563971ef"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/check-packages.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e80b56dd219a9c97f80c2e5211abdb704fc62ec0d7afd1ef8bc5165c5ac4b2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/measure-fonts.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"431b581fde5e2ac84f28e0bdf3f64f1684621438b7200640131cccf18aa42e9c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/fonts/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9089e1d0a46e8c291daaf5224ea95a39ccf375f3be31d763b424112c34f62e10"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"270159d589958e6f612a6aa3ba4d686524c3bb81bb9fca51d8565074c3d802bf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/build-package.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb63ae7f0e7e71397429663c2d37cc134792705ac479d0d8e16d489051bfe88"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/editor/src/style.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c814361b7b40a44a814130779baf9c2bd090f4fa7b2d51dd5760fbd298d6fc9"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): web/packages/markview/src/font-set.ts \u2192 web/packages/markview/src/index.ts \u2192 web/packages/markview/src/font-set.ts (one verified cycle inside a mutually-dependent group of 3 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/markview/src/font-set.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcf18d02a560644d3352f2c415edc0eab7d6303679aa22e718ef867772a3b98"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060color.r == 0.0 \u0026\u0026 color.g == 0.0 \u0026\u0026 color.b == 0.0\u0060 appears character-identically in 2 files \u2014 crates/markview-pdf/src/paint.rs, crates/markview-render/src/paint.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/markview-pdf/src/paint.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f12c9c04ecc4e82ec0bd7f8c04911777b8d2441e06f6e3b62a79bfcaa03152"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cursor \u003C spans.len() \u0026\u0026 spans[cursor].range.end \u003C= cluster.range.start\u0060 appears character-identically in 2 files \u2014 crates/markview-layout/src/layout/inline.rs, crates/markview-layout/src/microtype.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/markview-layout/src/layout/inline.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"28be3e75a62738b1160144d724cb4c402d4b2d705fb3540faa887d9c9687a52d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060inbox.pending.is_none() \u0026\u0026 !inbox.stopped \u0026\u0026 !inbox.release\u0060 appears character-identically in 2 files \u2014 src/app/search.rs, src/worker.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/search.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3522fbd7048f61782c9c3332dcf624a455683e8416bcd692376a75ca2a2e8145"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.units.end \u003E line.units.start \u0026\u0026 units[line.units.end - 1].discard\u0060 appears character-identically in 2 files \u2014 crates/markview-layout/src/layout/paragraph.rs, crates/markview-layout/src/layout/paragraph/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/markview-layout/src/layout/paragraph.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85e840a3da0b3ba05fc0132de33494d698876158713708b139bc3392d9678df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060modifiers.control_key() || modifiers.meta_key()\u0060 appears character-identically in 2 files \u2014 src/app/preview/input.rs, src/app/window.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/preview/input.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"441f5b5de8ae1a8e6b3628d4b4b92f4742a40b71aac7fcf78b6268e1e57d5187"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060panel.contains(b.rect.x, b.rect.y) \u0026\u0026 panel.contains(b.rect.x \u002B b.rect.w, b.rect.y \u002B b.rect.h)\u0060 appears character-identically in 2 files \u2014 src/app/chrome/styles.rs, src/app/font_panel/view.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/styles.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9951a0954402a7852f8eed07f847291ee3c68e6290c7f3013be85a96f63232"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060renderer.adapter_name.starts_with(\u0022llvmpipe\u0022) \u0026\u0026 renderer.adapter_name.ends_with(\u0022(Vulkan, Cpu)\u0022)\u0060 appears character-identically in 4 files \u2014 src/app/chrome/golden.rs, src/app/chrome/tabs/tests.rs, src/app/search/tests.rs, src/images/golden.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/golden.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ddf2c94c288a9524bbf383277953c91ddb93d415edb923f7416c97d19a052a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.animation.is_some() || self.rows.animating()\u0060 appears character-identically in 2 files \u2014 src/app/folder.rs, src/app/outline.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/folder.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82ffd11d7fccda6fc911df612de25246eac8ff054adc5dd507fab8331495b46"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.folder.open || self.phone_folder_open()\u0060 appears character-identically in 2 files \u2014 src/app/android.rs, src/app/folder.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/android.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be52e3fb43aa355986a62ea3764177e7bc37f9386f91a5b46fe25399c6c3802"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.interaction.overlays.modal_open() || self.interaction.overlays.quick_open.open()\u0060 appears character-identically in 2 files \u2014 src/app/gestures.rs, src/app/pointer.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/gestures.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb824f482c00920176e3d90c62b5dcda797191eb358761a5caa0d79e9b7d8ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.interaction.pointer.drag().is_some() \u0026\u0026 self.interaction.pointer.dragged()\u0060 appears character-identically in 3 files \u2014 src/app/animation.rs, src/app/gestures.rs, src/app/interaction.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/animation.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50c4c268d476fb95dbb835be8d2f00c0aa329c18e45825d7098b645405dc05e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.pointer_in_outline() || self.pointer_in_folder()\u0060 appears character-identically in 2 files \u2014 src/app/gestures.rs, src/app/preview.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/gestures.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3555f37d39188d47a78b378e0dea3418f3ad8694daa4e2f77eea3d47af7111c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.readers.session.path.is_some() || !self.readers.session.display.snapshot.blocks.is_empty()\u0060 appears character-identically in 2 files \u2014 src/app/start.rs, src/app/text_input.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/start.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be1d5dbb074d5158b52a04cdbfaeae8cd690ad7814a03ff7135b8b5a096ae20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.contains(\u0022Visible\u0022) \u0026\u0026 text.contains(\u0022%%CODEKEEP%%\u0022)\u0060 appears character-identically in 2 files \u2014 src/app/export.rs, src/export/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":"src/app/export.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e338d8510323275f02bb51d4b8838307c47d8f0f8230c13d093ccd647ff3a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.is_empty() || text.len() \u003E crate::file::MAX_FILE_BYTES as usize\u0060 appears character-identically in 2 files \u2014 scripts/webpage_baseline_rss.rs, src/paste.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":"scripts/webpage_baseline_rss.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b033f8a6022d8e02eb1d19a712c72318b5462915ca2dd81feba7135270b88fd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060widget_id\u0060 is public and takes a \u0060Command\u0060 as its receiver from its caller, and it calls itself at line 182 with a piece of the document (and at line 183, line 184, line 185, line 186) \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 \u0060widget_id\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/state/command.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6620ca98ea89d4ccc50cdf6ee9f4efb5e2a522c53e73608cb10dc75d8098e1f3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060contact\u0060 is public and takes a \u0060DirectManipulation\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 \u0060contact\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/dm.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee2835d02066d9a114d5a7a0e6fd1a5917c60c3da3889714896857bbeccf67a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060resize\u0060 is public and takes a \u0060DirectManipulation\u0060 as its receiver from its caller, and it calls itself at line 113 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 \u0060resize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/dm.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafd0a83094033f4ba44153eb1a157c75385daf0fa04789829dd795b931887c7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060abandon\u0060 is public and takes a \u0060DirectManipulation\u0060 as its receiver from its caller, and it calls itself at line 116 with a piece of the document (and at line 118) \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 \u0060abandon\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/dm.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"842daae7b3f4a91839f94700fa89c66f10e08068620f2ed8d400725eb9a5a40b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deadline\u0060 is public and takes a \u0060DirectManipulation\u0060 as its receiver from its caller, and it calls itself at line 124 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 \u0060deadline\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/dm.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8875f49c92c3b032e6fcb02b1ca885332c52b423d6761a0341660e5b6a4aa691"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pump\u0060 is public and takes a \u0060DirectManipulation\u0060 as its receiver from its caller, and it calls itself at line 127 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 \u0060pump\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/dm.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92def5140181d2feef036f38ba87915302c22bb61b09617c654037eb8c77076"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060toggle\u0060 is public, takes a document from its caller (line 351) and hands it to \u0060remove\u0060, which calls itself at line 254 with a piece of the document (and at line 255, line 256, line 257, line 259) \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 \u0060remove\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/folder.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a2ba205bede0540429080c49da12ae52f65381548c39035ed13f1975a50b51"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060toggle\u0060 is public, takes a document from its caller (line 351) and hands it to \u0060insert\u0060, which calls itself at line 324 with a piece of the document (and at line 325) \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 \u0060insert\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/folder.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f3ce575f3b038ddac642999835e491be0c0973fc0a68f80b375fa1bdba91f8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060take\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 94 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 \u0060take\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/modal.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d049eb96ccf370db4651b103db6109504e5d3a443eee4502cd0b64cc1f8dd4d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060animating\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 189 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 \u0060animating\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/outline.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eeeada84b4d45b18857acf165c310c12721a52f1614a8e4051977bc5d3ac1fd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060reset\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 43 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 \u0060reset\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/quick_open.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4347d4275fb6c616bcc3540cb268ab33047b69d8a43f079e8d755cfddd057ac7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060take\u0060 is public and takes a \u0060State\u0060 as its receiver from its caller, and it calls itself at line 32 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 \u0060take\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/sidebar.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1361cd9aed773aadcee8360e058b6195090ea3cface3894d7927bad0a9f99c9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060view\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 44 with a piece of the document (and at line 45) \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 \u0060view\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/ui_model.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"936617b8bb37d1b4a5dd0bc729a36f299cf78c850a06930e385091c586965a5e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060update\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 51 with a piece of the document (and at line 54, line 57) \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 \u0060update\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/ui_model.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e4a840e9fa0964550b78924f5391f9379f9bb18cb30c39db4a1025e8abb71d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060refresh\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 376 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 \u0060refresh\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/viewer.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a52bf123969920c99f76fdf5cdf32ccc266c429fe5b7806c75ea65f647bdad6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060cancel_press\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 383 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 \u0060cancel_press\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/viewer.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc6d55b9a6bb825e05e5cd8a8876266c4253169bb41f30fc4d83dcf9f4ba9bd"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060cancel\u0060 is public and takes a \u0060Worker\u0060 as its receiver from its caller, and it calls itself at line 210 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 \u0060cancel\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/preview/work.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4500cc0dda284ee90f281418c73908336400532c60aacdf544cd0e3696100d86"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060translate\u0060 is public and takes a \u0060Draw\u0060 as its receiver from its caller, and it calls itself at line 228 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 \u0060translate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c25237bbe6278d5afbf9b964499829e346210002663a22c5a9fc961d1f2d47"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060len\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 82 with a piece of the document (and at line 84) \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 \u0060len\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a14a39c3bbbf9923b2d69a1686cbbf846f67be572a2229ad724f7147ed28be"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060capacity\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 93 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 \u0060capacity\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"11239da01fa2f0a0860deacf0a65a58d81c61a9cd958b36a640ac9749280711e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060iter_mut\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 178 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 \u0060iter_mut\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb31016aaa2249c5bd7ad3291bbf89dd28c89d32370992c42abdbcfe5a5e1a85"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060push\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it recurses at line 184 through \u0060tail_mut\u0060 and back with a piece of the document (and at line 195) \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 \u0060push\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a743ff332010e7cafcadbb45740558633954480db8dcc39ff14d0e2f8dabe0f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060reserve\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 181 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 \u0060reserve\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5fee11473a4e74d98245126f32440af149a0eeae03be573a574d255b0212c2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060extend\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 187 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 \u0060extend\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1071c9e3a643312b31f0e792ebee22730c29b58677f62b4f086d161851adc3d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060independent_range\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 254 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 \u0060independent_range\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7461f15590506c653ab4961ce22f929de3b5f7ec5d98101c1954b3ac3a6728"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060seal\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 296 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 \u0060seal\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba1546556138583540fc41c72a76402107471f160b9fa8b6efdfc71a156004c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060shrink_to_fit\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 288 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 \u0060shrink_to_fit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e171cf43c307f783ecda5635f21182d6f6fde9a93399ee9f93e6a422985c48c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060storage_bytes\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 434 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 \u0060storage_bytes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cae913d0c267e1b5d0e4bc36fe02ce878eed02e59799598630a25124f5ea1f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060heap_bytes\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 411 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 \u0060heap_bytes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"373268f50162f03223373be96ae6592fb17082547f28c687434c3dc064b81d75"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060packed_counts\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 457 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 \u0060packed_counts\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"3833aba52fd6fe7d416a1f8582c8ebe0546f668fc1c07e2a9bd3ea0e6191077b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060visit_storage\u0060 is public and takes a \u0060DrawBuffer\u0060 as its receiver from its caller, and it calls itself at line 593 with a piece of the document (and at line 595, line 597) \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 \u0060visit_storage\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"238b1e6f063369df9e7842daa434190dcc2d76bc1f270ab3315300b5acfa392c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060heap_bytes\u0060 is public and takes a \u0060Draw\u0060 as its receiver from its caller, and it calls itself at line 13 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 \u0060heap_bytes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/memory.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"86708992990fc4d549a3c24461ccd922f0496125cf3a43b10f79cea650a6342c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060hash\u0060 is public and takes a \u0060Block\u0060 as its receiver from its caller, and it calls itself at line 519 with a piece of the document (and at line 520) \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 \u0060hash\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-document/src/lib.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa4d44cf6a2537fc1ae6e8f974b41daa88ef2617b2656f97c822d14e64238ab"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060images\u0060 is public and takes a \u0060Block\u0060 as its receiver from its caller, and it calls itself at line 817 with a piece of the document (and at line 822, line 830, line 837, line 846, line 856, line 866) \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 \u0060images\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-document/src/lib.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"417b9f26b9c7f2dba1dc5ff0520a61026d9c3db07cca834bec5a3469200d6fdb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060for_each_code_block\u0060 is public and takes a \u0060Block\u0060 as its receiver from its caller, and it calls itself at line 898 with a piece of the document (and at line 904, line 910, line 917, line 924) \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 \u0060for_each_code_block\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-document/src/lib.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b87c023e530723498dfc24a25f3cbcff6c7bffa8c7f3b42f7d3256939446b74"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060details_declared\u0060 is public and takes a \u0060Block\u0060 as its receiver from its caller, and it calls itself at line 950 with a piece of the document (and at line 954, line 957, line 960, line 964, line 968) \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 \u0060details_declared\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-document/src/lib.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"44dd199a2bc8b519ff352b27a7345ff4633184a84edc6939d920b3c6b2fcb3c4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060visit_fields\u0060 is public, takes a document from its caller (line 34) and hands it to \u0060walk\u0060, which calls itself at line 76 with a piece of the document (and at line 89, line 96, line 108, line 115, line 129, line 135, line 141) \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 \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-document/src/visit.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"896dab50c38cedecdf040bf031d6191b8097de4d70af69a34cf266303cbc0047"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060visit_blocks\u0060 is public and takes \u0060block: \u0026Block\u0060 from its caller, and it calls itself at line 158 with a piece of the document (and at line 164, line 170, line 177, line 184) \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 \u0060visit_blocks\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-document/src/visit.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"592bead05e8ecf68dfa189238dd6b9f7fae156bde6947f1d4758504889e53409"}},{"ruleId":"X18","level":"warning","message":{"text":"Raw handle taken from an owned value and never reclaimed: \u0060image.into_raw()\u0060 (line 56) gives up ownership in exchange for a raw handle \u2014 the value\u0027s \u0060Drop\u0060 will no longer run \u2014 and nothing in the crate\u0027s code ever reclaims a \u0060image\u0060 from a raw pointer (\u0060image::from_raw\u0060). The memory or descriptor stays allocated until the process ends, once per call. Pair the hand-out with its reclaim (a \u0060free\u0060 function that rebuilds the owner with \u0060from_raw\u0060 and drops it), or keep the owning value."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-platform/src/icon.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea684f148ca61d914aecf02448fe837a8d42ee40a95d97a50b9951b98133ab2"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 1/2 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; 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":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadFontSources: \u0060loadFontSources\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/packages/markview/src/fonts.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ccd41a36a6dd574aaaabe722fd8fd095f40abe07c38849f28b472142c07f9f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.primary_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4c057c2fb254666b9e280017bd313709e03f1595b8e61a3392cc0e2c2e7d37"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.primary_text_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"967f6abee05d25af379aaeb2fb89fad9695eee5845047f4107d0e3f7defe44da"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.primary_border_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9bd4f33233c4e8ae07df3af980467868994309c3e3b78f2d48231d3e111183"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.line_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2c36f8f2af3b95055302672733c627d3fb2b08895ba203fdf728f980ad868f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.secondary_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1295}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de832dc0d838dd5f26a16c4bd09a3747ff7fd7d85cc53a33c95cfb088ddc0b8"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.tertiary_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"523e5336c23889469783b98fce06946e859db9febe8a94f80d9da9e03203cb91"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.edge_label_background\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/markview-layout/src/style/types.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dcc03687da0c8dc5e80256037377bbbe761c6d98c8fc592d1aa1ebda9e174f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.cluster_background\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/markview-layout/src/style/types.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf7a5f1234c1bb86ae772d898febd98a22575fbeeb02f059aabaf52d105f972"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.cluster_border\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/types.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2ddb12836f30c319aa581c723a6ae4b1938f1ee35e8837154852b18c2b21ac"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.sequence_actor_fill\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/markview-layout/src/style/types.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb023026fc548c65faf412ff51481f920bf65198f961bcf72b240eeba130bc9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.sequence_actor_border\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/types.rs"},"region":{"startLine":1302}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57dfb414d627f10056338ceb430b3804bc679a69137bfe879d578ca9ff11b71"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.sequence_actor_line\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/markview-layout/src/style/types.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1463bd0cbed998ee778295c0a015de2097d89d08b47857bd7aa640dce7832d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.sequence_note_fill\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/markview-layout/src/style/types.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e2f5c00a9741706dbb7eb4c91f17cb4977eeede514fd32294c28a5f10dc0a5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.sequence_note_border\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/types.rs"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"307a4cf18392e4a950ecc02431814b3897c654470e319319ff3b008d303f93c5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.sequence_activation_fill\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/markview-layout/src/style/types.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1929a7ed82fe944b753db3799ca7fbad61d4dc76861ad66006940da8d3ef6774"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.sequence_activation_border\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/types.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"645bd0723f06871dec1fe88b09bcfd4db6d063c42f4a7539b5605419dce34073"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.text_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92f7c69899721f5e5a45fd9455939549e38b1978b3e302f496e02e943380abe"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.git_colors\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/markview-layout/src/style/types.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba99dbff2d5bb289cb91e46c31e419e00d83f61bb8b72677cab6ba275dbe4652"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.git_inv_colors\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/markview-layout/src/style/types.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a6747449588fa829f194c814e76d824add5e95f4f2ea624e70c6de434a831c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.git_branch_label_colors\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/markview-layout/src/style/types.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dcd63cbc74c51a334c47b64b63278944a9f9ef8b42ef7719db3169f2505910"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.git_commit_label_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7852a634eb4c72e91396bb8f1fc0415500e8db578dd0b51e630b6e3121caa2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.git_commit_label_background\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/markview-layout/src/style/types.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d40a81e54c83a023726421d98ccc53bdce63ea26448ad2342ff75ac4f69996"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.git_tag_label_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66271e1225509fd1d97319e7974da9e421a71663864c67480a8a105be265a4d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.git_tag_label_background\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/markview-layout/src/style/types.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"136fc3bcfe1cd9e75f5fe1abf5b0760269d45d5f8b0e272e7be1db34f8ba5d2d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.git_tag_label_border\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/style/types.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b766cc976ab9c4cacf71b2196260620e51d799d3f7a53c8bcb9e219d2060d7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.pie_colors\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/markview-layout/src/style/types.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bf366ff6fe086fd1ffe6aa4ac2c1de7e73a76fb463302e7bf32dd3419f050d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.pie_title_text_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbba03802b26ce25676ecba5394685b7ab3ab7484901930761c9642a1d7b369"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.pie_section_text_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0629700a642ea364487e8645895f0a8222666bbeae5992eeb47c82af4c1bb781"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.pie_legend_text_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1312ebf6d2f906f5d31ebbe41dc4194cc5fb1e177824e399b7972373c4f29ccd"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.pie_stroke_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb095f1e7b8d92f8e1238f7342ad74ca8e73541e6c08b93244588f2bddfff38"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MermaidStyle.pie_outer_stroke_color\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/markview-layout/src/style/types.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe9d3120cbd0a8f19a5406c3b8f26db50fcd192e6d4fe19236f6d07ed8ea921"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value.parse::\u003Cu64\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 \u0060build_metadata\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":"build.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a81242748b7e23bc573e4271ade67e0c0639ae51ec4430648ef133241c098c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::time::SystemTime::now().duration_since(std::time::UNIX_EPOCH)\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 \u0060build_metadata\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":"build.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4cb46092d1df2a659cff535ab3fe29749b460d8baf38aa5c4434c58b6d4072"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060metadata[\u0022metadata\u0022][\u0022lint\u0022][\u0022cyclomatic-complexity-threshold\u0022].as_u64()\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 \u0060audit\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":"xtask/src/complexity.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec4fcd11bcecad1f07fe9b108c5173bf4ed2138f13015ded7f427b36f045039"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PathBuf::from(env!(\u0022CARGO_MANIFEST_DIR\u0022)).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 \u0060workspace_root\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":"xtask/src/complexity.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"384e3aace0ff75a39aedb37bb87dff3a824efb4488541262bbaea93546ab019d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.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 \u0060external_module\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":"xtask/src/complexity.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9755333d5b4d69a3b2f6ed979c9176286575a4206ad7e0f9752b45d012b03f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060metadata[\u0022packages\u0022].as_array()\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 \u0060targets\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":"xtask/src/complexity.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ac63aaf977064f592821e7720372fb3adf1bffdc33cb7145f6b0d36bb8766d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060package[\u0022targets\u0022].as_array()\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 \u0060targets\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":"xtask/src/complexity.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1975da2c3b1217b9df27fe0ef261a3e404520520a724bbf8a1394c521cd7a6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target[\u0022kind\u0022].as_array()\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 \u0060targets\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":"xtask/src/complexity.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"094b13dfa1471bab2b41fc3178680523e4622250f26470c68c946756fed04022"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target[\u0022src_path\u0022].as_str()\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 \u0060targets\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":"xtask/src/complexity.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"41380de4d258cabe7bcfc9fd428690f67306d1b9582d912bf2b24871068b110b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.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 \u0060targets\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":"xtask/src/complexity.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dc1e07962245dcd341c9f0376f4a4052ad263283e45b659831a4c82e24ba1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060list.parse_args_with(Punctuated::\u003CMeta,Token![,]\u003E::parse_terminated,)\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 \u0060requires_test\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":"xtask/src/complexity.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fb79b7eb06aeabaab82700a6401f1aa55a46908a47071f85ec18fd48d6112d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.scores.pop()\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 \u0060function\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":"xtask/src/complexity.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b7c832ec89363138e9829c444ab9919b1fc830740f097c09df73bb8233769a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.functions.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060measure\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":"xtask/src/coupling.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"5691272ba91b347570206c2b43b85fb852cd8eb525fcc58fb5dbbcedd54f5a36"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_stem()\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 \u0060callout_icons\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":"xtask/src/icons.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba272b987cb4b7c0761feadf552323eff62efae6ebb7c856e76799a2be55424"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_stem().unwrap().to_str()\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 \u0060callout_icons\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":"xtask/src/icons.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3f8543ae392c134ed7ab4246d9b78ff2149c88e871171cda3766f4dec25b35"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060markview_platform::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 \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":"src/app.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc67ef5d263dff38f5d1850c0dffd2ee90342c15c87eec00d9ec4944e102bc5b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060times.last()\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 \u0060percentiles\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":"src/benchmark.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f84b079b209a44e58f8941f631cd7830826355f1197730071f263c95f42b44"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.entries.get_mut(\u0026source)\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 \u0060schedule_entry\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":"src/images.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f32461824ec2afe4956c4fe58de9984646e3706185b6bbdbed8bbb5a1933ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.document.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060export_source\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":"src/pdf.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cb36cc52b39644e4ba4cc72bec4b53090835b9fc7c97750af2f43554357c3f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(hex,\u0022{byte:02x}\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060hex_digest\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":"src/security.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf95ece3c0200983d7b37ec3e1121e1a1e74d9cf8f9dd8013aab1f9b9a6169a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(grant)\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 \u0060cache_key\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":"src/security.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"863a1ed3140fd28f27d78999d26efa191df640712c6140b1fc0a451c7772536c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026key)\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 \u0060cache_key\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":"src/security.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9079a37cc1e87ea2b348a2b01fdcfc2d509703645e7f2ac88522f5c2e1fac5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tokio::runtime::Builder::new_current_thread().max_blocking_threads(4).enable_all().build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \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":"src/services.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab3424ac2fba2ba1174c1e0f294ac50753a1fca2cdce064a6cecee35dbd9486"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060thread::Builder::new().name(\u0022markview-network\u0022.into()).spawn(move||{let runtime=tokio::runtime::Builder::new_current_thread().max_blocking_threads(4).enable_all().build().expect(\u0022start I/O runtime\u0022);runtime.block_on(async move{let mut running=tokio::task::JoinSet::new();loop{tokio::select!{biased;_=stop.cancelled()=\u003Ebreak,Some(operation)=recv.recv()=\u003E{running.spawn(operation);},Some(result)=running.join_next(),if!running.is_empty()=\u003E{if let Err(error)=result{log::warn!(\u0022I/O operation failed: {error}\u0022);}}}}recv.close();while let Ok(operation)=recv.try_recv(){running.spawn(operation);}let drain=async{while let Some(result)=running.join_next().await{if let Err(error)=result{log::warn!(\u0022I/O operation failed: {error}\u0022);}}};if tokio::time::timeout(SHUTDOWN_GRACE,drain).await.is_err(){log::warn!(\u0022I/O shutdown abandoned work inside a blocking call\u0022);}drop(running);});runtime.shutdown_timeout(Duration::ZERO);})\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":"src/services.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"69adfebcd88489d9dbe097311855ce8185ad2740635c0657c8d567a1d61cc045"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::browser_headers(\u0026crate::settings::ReaderSettings::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 \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":"src/services.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17267fe7192b2257564d8745853cba21b44342fca82ce7f4318196895549088"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::net::browser_headers(settings)\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 \u0060configure_http\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":"src/services.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2483bb2f96b1e0d0277014c78293f1203c196635fea0a7370ddae0c13279b00"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060source.page.paper_mm()\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 \u0060load_over\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":"src/stylesheet.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cd2d905730a903231ecfbfa841215d7ed571670a1e107234c72afb5fbbb508"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060content_type.unwrap_or(\u0022\u0022).split(\u0027;\u0027).next()\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 \u0060is_markdown\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":"src/web_page.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f1b9c94a001815f3052d0ad3f8c9f513b940cd273a93072375ef1e4a8ffc0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060thread::Builder::new().name(\u0022markview-layout\u0022.into()).stack_size(8*1024*1024).spawn(move||{crate::layout::TextShaper::warm_fonts(\u0026fonts);let wake:markview_layout::background::Wake=Arc::new({let inbox=thread_inbox.clone();move||{let(lock,signal)=\u0026*inbox;Inbox::lock(lock).background_ready=true;signal.notify_one();}});let mut engine=LayoutEngine::with_executor(io.cpu.clone(),wake.clone());engine.set_auto_parallelism();let mut images=crate::images::Images::with_services(offline,crate::images::cache_directory(),fonts.clone(),io,None,wake,);let mut last:Option\u003CRequest\u003E=None;let mut completed_version=0;let mut counted:Option\u003C(u64,markview_layout::text::TextCounts,)\u003E=None;let mut cached:Option\u003C(PathBuf,u64,markview_commonmark::Dialect,Arc\u003Cmarkview_commonmark::MarkdownParse\u003E,)\u003E=None;loop{let Some((request,release))=wait_for_request(\u0026thread_inbox,images.poll_deadline())else{break;};if release{cached=None;last=None;counted=None;engine.release_document();images.release();continue;}let Some(request)=request else{let changed=images.poll();let highlights=last.is_some()\u0026\u0026engine.poll_highlights();if changed||highlights{let(lock,_)=\u0026*thread_inbox;let mut inbox=Inbox::lock(lock);if inbox.pending.is_none()\u0026\u0026!inbox.stopped\u0026\u0026!inbox.release{inbox.pending=last.clone();}}continue;};let mut request=request;if last.as_ref().is_some_and(|last|last.options!=request.options){counted=None;}last=Some(request.clone());images.set_workspace(request.workspace.clone());images.set_standalone_image(crate::file::is_picture(\u0026request.path).then(||request.path.clone()),);engine.set_parallel_start(request.coverage);let rendered=rendered.clone();let version=request.version;engine.set_parallel_ready(Arc::new(move||rendered.load(Ordering::Relaxed)==version));let mut update=Update{version:request.version,path:request.path.clone(),requested:request.requested,result:None,read_ms:0.0,parse_ms:0.0,layout_ms:0.0,counts:None,};update.result=Some((||-\u003EResult\u003CReaderSnapshot,String\u003E{let dialect=markview_commonmark::Dialect{hard_breaks:request.options.hard_breaks,highlight_marks:request.options.highlight_marks,ofm:request.options.ofm,grid_tables:request.options.grid_tables,};let document=if let Some(loaded)=\u0026request.loaded{loaded.with_dialect(dialect)}else if let Some((path,revision,cached_dialect,doc,))=\u0026cached\u0026\u0026(path,revision,cached_dialect)==(\u0026request.path,\u0026request.content_version,\u0026dialect){request.security=request.security.for_content(\u0026doc.source);crate::loaded::LoadedDocument::markdown(doc.clone(),)}else{let start=Instant::now();let text=read_markdown(\u0026request.path).map_err(|e|format!(\u0022{e:#}\u0022))?;request.security=request.security.for_content(\u0026text);update.read_ms=start.elapsed().as_secs_f64()*1000.0;let start=Instant::now();let source:Arc\u003Cstr\u003E=text.into();let previous=cached.as_ref().filter(|(path,_,cached_dialect,_)|{path==\u0026request.path\u0026\u0026*cached_dialect==dialect}).map(|(_,_,_,doc)|doc.clone());let doc=match previous{Some(previous)=\u003E{Arc::new(markview_commonmark::reparse_with(\u0026previous,source.clone(),dialect,),)}None=\u003E{let prefix_start=Instant::now();if current.sequence.load(Ordering::Relaxed)==request.version\u0026\u0026let Some(prefix)=markview_commonmark::parse_prefix_with(\u0026source,PREFIX_BYTES,dialect,){let prefix_parse=prefix_start.elapsed().as_secs_f64()*1000.0;engine.validate_stylesheet(\u0026request.options.stylesheet,).map_err(|e|{format!(\u0022Fonts: {e:#}\u0022)})?;images.set_security(request.security.clone(),);images.set_requested_image(request.requested_image.clone());images.set_initial_width(request.options.width,);images.prepare(\u0026prefix,\u0026request.path,request.content_version,request.load_all_images,\u0026request.options.stylesheet,\u0026request.options.fonts,);let layout_start=Instant::now();let wanted=f32::from_bits(target.coverage.load(Ordering::Relaxed),);let mut shown=None;engine.layout_progressive_cancellable(\u0026prefix,\u0026request.options,\u0026images.snapshot,|snapshot|{if!snapshot.blocks.is_empty()\u0026\u0026snapshot.height\u003E=wanted{shown=Some(snapshot.clone(),);return false;}true},||{current.sequence.load(Ordering::Relaxed)!=request.version},);if let Some(layout)=shown{let mut partial=update.clone();partial.parse_ms=prefix_parse;partial.layout_ms=layout_start.elapsed().as_secs_f64()*1000.0;partial.result=Some(Ok(ReaderSnapshot{blocked_images:images.blocked.clone(),document:crate::loaded::LoadedDocument::markdown(Arc::new(prefix),),layout,content_version:request.content_version,complete:false,parse_complete:false,remote_deferred:images.deferred_remote(),}));done(partial);}}Arc::new(markview_commonmark::parse_with(source.clone(),dialect,),)}};update.parse_ms=start.elapsed().as_secs_f64()*1000.0;if cached.as_ref().is_some_and(|(path,_,_,_)|path!=\u0026request.path,){engine.release_document();}cached=Some((request.path.clone(),request.content_version,dialect,doc.clone(),));crate::loaded::LoadedDocument::markdown(doc)};if current.sequence.load(Ordering::Relaxed)!=request.version{return Err(\u0022Superseded\u0022.into());}parsed(request.path.clone(),request.content_version,document.clone(),);let start=Instant::now();engine.validate_stylesheet(\u0026request.options.stylesheet,).map_err(|e|format!(\u0022Fonts: {e:#}\u0022))?;images.set_security(request.security.clone());images.set_requested_image(request.requested_image.clone());images.set_initial_width(request.options.width);images.prepare(\u0026document,\u0026request.path,request.content_version,request.load_all_images,\u0026request.options.stylesheet,\u0026request.options.fonts,);let size=document.size();engine.set_parallel_start(if size\u003C32*1024{f32::INFINITY}else{request.coverage});let mut publication=PrefixPublication::new(size);let layout=engine.layout_progressive_cancellable(\u0026document,\u0026request.options,\u0026images.snapshot,|prefix|{if current.sequence.load(Ordering::Relaxed)!=request.version{return false;}let wanted=f32::from_bits(target.coverage.load(Ordering::Relaxed),);if request.version!=completed_version\u0026\u0026publication.publish(prefix.blocks.len(),prefix.height,wanted,start.elapsed(),){let mut partial=update.clone();partial.layout_ms=start.elapsed().as_secs_f64()*1000.;partial.result=Some(Ok(ReaderSnapshot{blocked_images:images.blocked.clone(),document:document.clone(),layout:prefix.clone(),content_version:request.content_version,complete:false,parse_complete:true,remote_deferred:images.deferred_remote(),}));done(partial);}true},||{current.sequence.load(Ordering::Relaxed)!=request.version},).ok_or_else(||\u0022Superseded\u0022.to_string())?;update.layout_ms=start.elapsed().as_secs_f64()*1000.0;Ok(ReaderSnapshot{blocked_images:images.blocked.clone(),document:document.clone(),layout,content_version:request.content_version,complete:true,parse_complete:true,remote_deferred:images.deferred_remote(),})})());if current.sequence.load(Ordering::Relaxed)==request.version{if update.result.as_ref().is_some_and(|r|r.is_ok()){completed_version=request.version;}let next=match\u0026update.result{Some(Ok(reader))if reader.complete=\u003E{let restored=*restored_counts.lock().unwrap();let id=reader.document.document().content_key().get();match counted.filter(|(key,_)|*key==id).or(restored){Some((id,counts))if id==reader.document.document().content_key().get()=\u003E{Some(counts)}_=\u003E{let pending={let(lock,_)=\u0026*thread_inbox;Inbox::lock(lock).pending.is_some()};(!pending).then(||{let counts=markview_layout::text::TextCounts::of(\u0026reader.layout.full_reading_text());counted=Some((reader.document.document().content_key().get(),counts,));counts})}}}_=\u003ENone,};update.counts=next;done(update);}}engine.release_document();images.release();})\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 \u0060with_services_and_parsed\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":"src/worker.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a6065e38452adc482509d75674c5cfd499d18c6f7cad0946adf3fe1530c328"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(path,text)\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 \u0060write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/settings/store/proptests.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"58798bb419469cba0a391bd98eec0c09ea70d54b4808ff03e02ffb823d4ed50e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.session.folder\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 \u0060buttons_for\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bd6855d6adf319659550053e5f93d0e5e1edc2bb4d96af916478a845f5e874"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060form\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 \u0060buttons_for\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"0779067d2fd80854bcc5dc951fcc2ca6df4e8394f5c6a159a40b222b92532d6c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060form\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 \u0060buttons_for\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11b275abbb6d3a33b4662fb630384d167969483407bde2c8ac98b795645297d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.session.folder\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 \u0060draw_layer\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":"src/app/chrome.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9432cffd55fed03bfeab9ddda024fad88cdf6fe366cca9fbb344312f694f5b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060form\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060draw_panel_overlay\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":"src/app/chrome.rs"},"region":{"startLine":1235}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a3085e7e453f3f50536d1950cd39b8d3539ad61ba1e84810c00992a65d90ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060form\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060draw_panel_overlay\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":"src/app/chrome.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80f24d0b7dd55db9c45229833c73fd75f5d04b02e99aa155388e53a2fd31070"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output\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 \u0060spawn_export\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":"src/app/export.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c61539c76ae86a4f7e772d90598af98b28b69a096567e0385830a1916ff70c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\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 \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":"src/app/file_search.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7edfe588f3f95160ecc929dd6de391ad6112c233e9838c67ac5be3baef94bbf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.strip_prefix(root)\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 \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":"src/app/file_search.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6939bd53987c44d2affaae7fe3259e40228a12f4e06872e9179f0dac79142a7f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\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 \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":"src/app/file_search.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dee8260d269f6662d3c18da8a86437677277937c47a6141902135ef9fcbe5e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060relative.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 \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":"src/app/file_search.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd3405dfdf79609126f26aace4ba44bed27202ffd59d09e9154d5ef0b4abf5e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060indices.last()\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 \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":"src/app/file_search.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e03a01d7afe3771e06e41d4a0600412f6ee0c5ca77911f2a363353a710fdeb4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pattern.indices(file.text.slice(..),matcher,\u0026mut indices)\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 \u0060find\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":"src/app/file_search.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c5d8afe56e910e0ff7176cb48280193dc201e42304ae9b927d997f1d5ac8a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\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 \u0060excluded\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":"src/app/folder.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff74814c78c79f79d3a0c81958c79972b551b2179f0457ebb52598efd14e4894"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.path.file_name()\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 \u0060list\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":"src/app/folder.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d083df88d8a8936ce35f379cdfa97042a7d0ae66903c380c1618c78fc524b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\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 \u0060scan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/folder.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"357e7ee1e535196d415ea123ece9740f86ecb313d491720fe53542d9c13c3b6e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.path.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 \u0060scan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/folder.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c351e02d5c87f65deab8c196ca7547d7cb3fa7a1597fa0909740fac97912c631"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.entries.0.remove(\u0026id)\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 \u0060remove\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":"src/app/folder.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"9790019935c62339f89f0c914666a9c6d7a8e5e1590bfee259b55b28e6ede9da"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.path.file_name()\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 \u0060initial\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":"src/app/folder.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"0056e84ca7b8162fa494679d75ed25bbeff81442e7661dff169f35996cfa7b09"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.folder.tree.as_ref()\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 \u0060restore_folder_focus\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":"src/app/folder.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d14b331919588fe417239e897122e31c84c7731239d1239556a54408f2e12a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.strip_prefix(\u0026tree.root)\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 \u0060folder_view_changed\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":"src/app/folder.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c340c0f9b4d2ef12bfd56da07de9e41b14eb909752d75fa7adc8e82a765a710"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tree.entries[index].path.strip_prefix(\u0026tree.root)\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 \u0060activate_folder_entry\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":"src/app/folder.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e97d9655f3df23f3ea4dc105a16d91555949541d5c9b9157665b58bdfbe3580b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.gestures.trackpad.as_mut().map(|(surface,last)|{*last=now;*surface})\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 \u0060trackpad_scroll\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":"src/app/gestures.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"667e68e00071b554dc9c208d8691b9fc316951b82171de1508723475f25fa01f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.path.as_ref()\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 \u0060run_diagnostic\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":"src/app/launch.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee251d29d9fc805a19c5ec34bc26ddacd50b4e3b21f6ed07dd6086bebfecf0f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.path.as_ref()\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 \u0060render_preview\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":"src/app/launch.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d21ebe0b57a2384173d2688fc5ee48d66af2cc05bf8939432b9cf3dbca6739c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.output.as_ref()\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 \u0060render_preview\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":"src/app/launch.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d35e552be630423fbbeb7adfabbbada5dbdaf231e4b4c54c580caeab6d8542c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060error.downcast_ref::\u003Ccrate::security::PermissionRequired\u003E()\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 \u0060open_link\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":"src/app/pointer.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7795d5b8c4ca62233d7e58bfeb68f980856ddc68c58ab4df2fe619cfe72f69a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending.ready.take()\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 \u0060present_link_preview\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":"src/app/preview.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9db049954016da72f764caac8b116d2f192acf0932d517912dd3f5b0e77d30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.open.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060present_link_preview\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":"src/app/preview.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9f18e6b821c094d563881ef7f6691afd1cebf10c7c751536bfa89f8d484e4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.open.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060present_link_preview\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":"src/app/preview.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"0716d0817a5ec4e65abeff0cbb54266909f4bebb075190cea977561362aa46dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.floating_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060present_link_preview\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":"src/app/preview.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce92b2ce94cb618e78df2e8bb01b40982645e994abbf794e0c5945d5eee09112"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.observed.as_ref()\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 \u0060start_link_preview\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":"src/app/preview.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d103f4f3b88179f1a09e23c36ad7966bba8547f621847d2765e3158574fe67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inbox.pending.take()\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 \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":"src/app/search.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f153d81255b887174a5fce199ada3b40ebaa9725063b3ca7a5ebafb53e0c70ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cache.as_ref()\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 \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":"src/app/search.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e93671d34af350a1919d3047ccd43623df58739e6e639c738f359aefe31567e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022markview-search\u0022.into()).spawn(move||{let mut cache:Option\u003C(PathBuf,u64,SearchIndex)\u003E=None;loop{let(request,index_version)={let(lock,wake)=\u0026*shared;let mut inbox=Inbox::lock(lock);while inbox.pending.is_none()\u0026\u0026!inbox.stopped\u0026\u0026!inbox.release{inbox=Inbox::recover(lock,wake.wait(inbox));}if inbox.stopped{break;}if std::mem::take(\u0026mut inbox.release){cache=None;if inbox.pending.is_none(){continue;}}(inbox.pending.take().unwrap(),index_serial.generation.load(Ordering::Relaxed),)};let cancelled=||{serial.sequence.load(Ordering::Relaxed)!=request.sequence};if cancelled(){continue;}if cache.as_ref().is_none_or(|(p,v,_)|{p!=\u0026request.path||*v!=request.content}){cache=Some((request.path.clone(),request.content,match SearchIndex::new_cancellable(\u0026request.document,||{index_serial.generation.load(Ordering::Relaxed)!=index_version},){Some(index)=\u003Eindex,None=\u003Econtinue,},));}if let Some(matches)=cache.as_ref().unwrap().2.find_cancellable(\u0026request.query,request.options,cancelled,)\u0026\u0026!cancelled(){done(Result{path:request.path,content:request.content,sequence:request.sequence,matches:matches.into(),});}}})\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 \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":"src/app/search.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0eb6ee88c63906ddb643063bf5899a25512f0b6df582e05aa566c80a3bb2ca4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060search.document.as_ref().or(session.document.as_ref())\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 \u0060navigate_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/search.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"747962f12ad3fac3e4777ad3c0b5eddab05c6ef5b0b7032a8abcfa0644f2f36a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060search.document.as_ref().or(session.document.as_ref()).unwrap().details_declared(id)\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 \u0060navigate_search\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/search.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d2c1ecbd7ca1b81a20b3e30c19a5c224ba4c5c73459b6d73efd5161a67ec34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block.overflow_rect(oi)\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 \u0060apply_search_navigation\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":"src/app/search.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06e0847730c36895dc088f8099f2fb754d650886b0f04859b62226389a13b57"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block.command_offset(cluster.command)\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 \u0060apply_search_navigation\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":"src/app/search.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"72967e82e80b83588db538ccf96dedf0413dc78ed6e76f574269c8a196b858a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block.rect(cluster.command,cluster.rect)\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 \u0060apply_search_navigation\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":"src/app/search.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f61d59d0eaac8c993dd177c3b8eda8c3bb9f619f4d588a30419b7d62b5afe6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.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 \u0060write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/session.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b17c4279424155e76b36b4ac137eabc95ba1a1a0c257bd4376d4e8dfe6754f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.fonts.as_ref()\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 \u0060refresh_settings_resources\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":"src/app/settings_load.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"991d70f079bec691ca8acd3b0941de63f0da4930763f41e1bfc2bb200580d63a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.fonts.as_ref()\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 \u0060refresh_settings_resources\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":"src/app/settings_load.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb9dbb297345385b9fd391a7c221ff294e1a01bfc9e383322c9a9bf8d3b71f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lock_path.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 \u0060registry_guard\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":"src/app/single_instance.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0128a84689bd071cbc0c57cad9f29a6f6bd2e572f4419be41d8d6b4951729af4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.strip_prefix(ancestor)\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 \u0060normalized\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":"src/app/single_instance.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc233ae76596eef44c575b88aa6fc7c8368e1794d6fef5fc144a95b53fae244c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.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 \u0060publish\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":"src/app/single_instance.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"485181bcad2c800935c6bfd52ba3f7872a835b96e3f4e26519a97bd30625442d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.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 \u0060save_history\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":"src/app/start.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7d2fee95e477f7ca4f82e69c2f7c7bc649884702678ae656de00b5b44f3559"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inbox.pending.take()\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 \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":"src/app/start.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4db6b55df65d19539a84a2d4eaea51309a8756c958fe20f5129e2104851ab1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022markview-files\u0022.into()).spawn(move||{let mut matcher=Matcher::new(Config::DEFAULT.match_paths());loop{let request={let(lock,wake)=\u0026*shared;let mut inbox=Inbox::lock(lock);while inbox.pending.is_none()\u0026\u0026!inbox.stopped{inbox=Inbox::recover(lock,wake.wait(inbox));}if inbox.stopped{break;}inbox.pending.take().unwrap()};let cancelled=||latest.load(Ordering::Relaxed)!=request.sequence;if let Some((matches,snippets))=find(\u0026mut matcher,\u0026request.catalog,\u0026request.query,cancelled,)\u0026\u0026!cancelled(){done(Result{sequence:request.sequence,matches,snippets,});}}})\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 \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":"src/app/start.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bd03e1a8f6fc0cabb4abfb9ce370acc13159bab33bc71f3f089478e1514d4f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.handle.take()\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 \u0060drop\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":"src/app/start.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39b312228c7b4624b98a40894ac7ee2590f244fad3ce071097d053df18c8b52"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.handle.take().unwrap().join()\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 \u0060drop\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":"src/app/start.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1169cea2ff9391b3c7365edca220abad9e6f9ef1d2cc78609959a51dd81f3883"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.entries.iter_mut().filter(|tab|tab.preview.is_some()).min_by_key(|tab|tab.last_active)\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 \u0060trim_cache\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":"src/app/tabs.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b900f1d98a24d401322b4ec0a64fe368a53d0a581a7e2045ec2e448fbffd6056"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ImeEnableRequest::new(ImeCapabilities::new().with_cursor_area(),ImeRequestData::default().with_cursor_area(winit::dpi::LogicalPosition::new(0,0).into(),winit::dpi::LogicalSize::new(0,0).into(),),)\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 \u0060set_input_ime\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":"src/app/text_input.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"313294fb2886d140c6d480f9feae9f0f055bdc04d732a64b5a5c017a439dbf96"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.input_geometry(id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060input_event\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/text_input.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c5060ce22ee6a147fc7f5cd40b715e1db05786c4a81256014f8079a00be143"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.text_input.focused\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 \u0060input_key\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":"src/app/text_input.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"982075656b57a16c3b2243237e5714b3482162ed47dc6b6d613d109ede197c4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preferences.path()\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 \u0060settings_command\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":"src/app/ui.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f38f71a8536af0ac17d05dccf844df4390c356b3dd0fa3fef5dc365db0039a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pressed_at\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 \u0060move_pointer\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":"src/app/viewer.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"21699b9f42150bc0e9aff46463921e573dde27984b7f149d97bcbac8412cedd5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.floating_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060preview_input\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":"src/app/preview/input.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"78af848f667a02a50e0d4a2af7007c7762d89c0c3c38d3124f42d7571ae9a7de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.floating_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060preview_input\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":"src/app/preview/input.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e3e32da9f1a1b6fd4491c7a12d5d53212ac39aac710ac3ca24752f3b06436a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.path_of(*id)\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 \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":"src/app/preview/navigation.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44a12e6c9d0338da0260a8508163f393d9e074de0e9e0ea54256d0e480286bf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.block_at_path(path)\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 \u0060resolve\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":"src/app/preview/navigation.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90c3bfdfb3559489d3b00b5ef00c12a79b310b1a521d7540a52cd52695b9968"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060resolved\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 \u0060resolve\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":"src/app/preview/navigation.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9193c39f4f46cabf08c2cd02eb9fa503bdeca6bc241432bd70e938d5827053"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.open()\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 \u0060activate_file_preview\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":"src/app/preview/navigation.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1201c8067144484865280d5c7032f899b14dfd66db3498f02e9ee975be94b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060open.floating.as_ref()\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 \u0060activate_file_preview\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":"src/app/preview/navigation.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58556d2e60a199a99e6cb391be586fa1ebad7775298522704b2730947698852"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060floating.state.hover.link.as_ref()\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 \u0060activate_file_preview\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":"src/app/preview/navigation.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"20feea4cfac252e9172beed8cd56ee65da1888300235bce397dbfabee10c89b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.floating()\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 \u0060activate_file_preview_image\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":"src/app/preview/navigation.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"712f521892615d5bced52daca9786519571ce69ec1173677111ffa14df9f64f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060images.keys.iter().find(|(_,key)|key.as_str()==alias).map(|(source,_)|source.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 \u0060activate_file_preview_image\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":"src/app/preview/navigation.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"66010c254725f45bba4cf1f5f7db240131e870ee551e4af940ad5106db46a559"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.open()\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 \u0060activate_file_preview_action\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":"src/app/preview/navigation.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ca8e887c8098f3eb990d73ac5a016bd4abee0a45284ad562867e68bd458e5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060open.path.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060activate_file_preview_action\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":"src/app/preview/navigation.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b48a1bc405de47d9c48f7852668f28336450362cf5a3158c0509169c813c5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060open.floating.as_ref()\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 \u0060activate_file_preview_action\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":"src/app/preview/navigation.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6afc6c3fc3f6569c7f4119adc5f8d4cbcd6f89e283ec9a384689a9d87ec34b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.readers.session.pending_preview_action.take()\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 \u0060apply_preview_action\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":"src/app/preview/navigation.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"65020e5aea994dacd5a7e566bcb1850652771f4fe7f4c5550bb3b81998945d8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.readers.session.display.snapshot.images.key(\u0026source)\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_preview_action\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":"src/app/preview/navigation.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5821dd3e58d8096ad3137e755b59c53f1fec232396fa662ddef3249fc8f28841"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.readers.session.document.as_ref()\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 \u0060apply_preview_link\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":"src/app/preview/navigation.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f4d0e9c2fda02c104e787784651ee934bab428c9b41b38c713407777a41532"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060expanded\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 \u0060apply_preview_link\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":"src/app/preview/navigation.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"234647b9dcfd70b972a6a190950b965ee524892cd18963e18f602196e36666ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.path_of(*id)\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 \u0060enclosing\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":"src/app/preview/navigation.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcdb4746af1bf783a033574f67f17e88e32dcabee5b3313639ce1cc68f83542"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.observed.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060refresh_preview_file\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/preview/observe.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"620701fb4dda1f58caec9d09720be2b4bc496ca1ca99ffb2aba88b7c7b62dc75"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.preview.hover.as_ref()\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 \u0060refresh_preview_file\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/preview/observe.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03fca14a0919f7fa60665d0b2373ec9b10cb3ecff3c535c1b5350c3dc14b5ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.document.document().block(*id)\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 \u0060refresh\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":"src/app/preview/work.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4606675e23faf199c4ecf6afe2017e79adda5107ec530dd1374693f1ac6d2173"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060permit\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 \u0060submit\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":"src/app/preview/work.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06cfeacfd4718c9c7b8fbe6155757a07c1c17713e94224f2f35e7d51f5c2e2f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060current.images.as_ref()\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 \u0060submit\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":"src/app/preview/work.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"99539b8a37ea5da15eedffbcee9b4f0bccf4a4675142976699e68754d79271bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060current.images.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060submit\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":"src/app/preview/work.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff3c979a6f2ce8e5db0127bb17f1def5d50110d9d76f359951ee321502eb5fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ids.next()\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 \u0060begin_pinch\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":"src/app/gestures/recognizer.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"233eeb2259d9e75f29ba4cbf8600a4b34004ffb8ea5990c0ba6f8de9416a387d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ids.next()\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 \u0060begin_pinch\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":"src/app/gestures/recognizer.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeda78b14e06fb6132b13c073b69b430ced602b0bad7528825767575eab71b4b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pinch.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_pinch\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":"src/app/gestures/recognizer.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"005802703dbaf902dfacb1e204d30f77b36e5ed5fe9df3b564e8d3c4bcc37ce4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.strip_prefix(\u0026self.root)\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 \u0060eligible\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":"src/app/folder/observe.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae305845b5706fff5181f20c12ac94bf7d5322c43db0a1219dbc855bd2ea77f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.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 \u0060contains_directory\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":"src/app/folder/observe.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7aa0cebe73309deb31cd1a8ce5ec1ad43a091af6cc50b4fd072c4ec71ca8a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.browser\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 \u0060draw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/empty.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"3029482df28e8458394d505655fbf9d8e1d33af635ef4733eb7162c0fea0e293"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.browser\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 \u0060draw_row\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":"src/app/chrome/empty.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abb0a56214d731f7501ddbc64a9d5c49bed3e89781eef57c49990040576cfbb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060search.matches.iter().find(|file|file.id==id)\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 \u0060draw_row\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":"src/app/chrome/empty.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"940956cf0e1035f8fbecf95e00df985bea9cf0de0a763844fdabf37f39abfc0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.rows.keys().next()\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 \u0060draw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/folder.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29deb97476ced9fe8cf12b823d2b40f14a5e9097e64fda891cb0f3ac412177d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.path.file_name()\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 \u0060buttons\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":"src/app/chrome/folder.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dc900f186a9f906274442fcbea0c184b3b8824216f31d14c0ed6359840353a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.path.file_name()\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 \u0060draw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/app/chrome/folder.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8bde8c39e0451d80df5cd6f6098a57918579df7dc20fd116e6724065fa7bf8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060candidates.into_iter().map(|(x,y,height)|{let rect=Rect{x:x.clamp(area.x,area.x\u002B(area.w-w)),y:y.clamp(area.y,area.y\u002B(area.h-height)),w,h:height,};let overlap=rect.intersect(anchor).map_or(0.0,|r|r.w*r.h);let score=overlap*1000.0\u002B(rect.x\u002Bpadding[3]-origin.0).hypot(rect.y\u002Bpadding[0]-origin.1)\u002B(h-height)*2.0;(rect,score)}).min_by(|a,b|a.1.total_cmp(\u0026b.1))\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 \u0060place\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":"src/app/chrome/preview.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"74115cd0f0057e7edbfa440592f1460675e300360a357d31c2e371386bc3c871"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(counter.saturating_add(1)).ok().and_then(LinkOccurrenceId::new)\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 \u0060allocated_link\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/markview-webpage/src/lower.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acbea683fa87d10e037bfdf0b3c90f22669960498da740f4452b507ccfd1f94"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060name[1..].parse::\u003Cu8\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 \u0060heading\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/markview-webpage/src/lower.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"37555b87c1067efaf67dd531d42ddb7a53d3520350eddb821abd9a9f0f9a7eb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060items.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060definition_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/markview-webpage/src/lower.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2227e7fe0c0f907ec2bef6520871d937cd9e9bea9207543d4bfaae1c2428f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060url::Url::parse(BASE)\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 \u0060lower\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/markview-webpage/src/lower/proptests.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3084cdee382c5e5df3591cb9beb2111d9dd1ec737f2744875361e565ffb58df7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_string(\u0026self.images.priorities(snapshot,pass,self.published.revision,viewport,\u0026self.horizontal,))\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 \u0060image_priorities\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/markview-web/src/api.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc35441e07a2fd7ba1e29e484426adc628358460455176a3243b493d3a07f408"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending_anchor.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060goto_anchor\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/markview-web/src/api.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d364b95588d556b5c4e78af0ad5f09a5c1fbac79c2f11be5231da9f6ada6a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending.as_ref()\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 \u0060apply_anchor\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/markview-web/src/api.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2eaab47c850e1c6141de91aad55344de06b76b1888ee7803b14bce41245e0a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.distance\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 \u0060priorities\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/markview-web/src/images.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ae611e1b97ca2b45b3544f82f0357ffa45f4875271ae171284af882cfc6f25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.distance\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 \u0060priorities\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/markview-web/src/images.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cc22f00c5659d1a5d8951d14ca6941049091bd7e3106b3f3554310eab44b88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060BlockId::new(u32::from(index)\u002B1)\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 \u0060prefix\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/markview-web/src/state/proptests.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8655e846b9366cc32cdeb566ab1dff5b5a118044950afec7425539089e47e856"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.demand.get_mut(src)\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 \u0060prepare\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/markview-render/src/images.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4010b6f9db337f4e36c06ef43e9e183cd93841e0576821d18315db4a5e198fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.fallback.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060draw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-render/src/paint.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7f7abd4a6faf80a99728d232b8676adf48455a03f77433d60adcbbad6a5932"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.color_atlas.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060color_bind_group\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/markview-render/src/raster.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cecf43bbee0d02a014c8a134ccdeab026de36c9180ff481a1d9ad523d592f9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LAYOUT.lock().unwrap()\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 \u0060smallest_width_dp\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/markview-platform/src/android.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8adb84412329fe5d5d69b6311330c461385315e6328f01cca0b5a305132270"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LAYOUT.lock().unwrap()\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 \u0060phone_layout\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/markview-platform/src/android.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"822d0c0d034818d9cce324bd1bc7f844a8083b9c5a992403214ba5cc30ccb249"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060app.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060insets\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/markview-platform/src/android.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"632dd11fcba8f0d91dad28f97848887c6b40d9699889ba1ed3986ad5d6bbbf51"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::android::data_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 \u0060tempdir\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/markview-platform/src/files.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0570ea557fd4f6ce7d2f32ed60b03336577df25a72ac716e00f0f5ae2c62e05f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window.window_handle()\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 \u0060align_traffic_lights\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/markview-platform/src/lib.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be7a1ce87686c07d44e48612bc81ded2bc4b717dc94b0afa7d97ec5d9907e82"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inner.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read\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/markview-platform/src/lib.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"74070eaea224d2e8e86698c4628c6c1a7b3291b79c5e0f87e6867bc05cdce3a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inner.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-platform/src/lib.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cf94ac92a269b64b756a8518c38da385a15d3287c74e0bc890ef1e1ba1d664"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060OUTPUT.lock().unwrap().take()\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 \u0060failure\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/markview-platform/src/android/testing.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e81a673d4173ceb8aaa8b5baa784488282fb2a2cf384cf3680320a07aa2928"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060nodes.next()\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 \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/markview-pdf/src/outline.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ce9680dacdb0f3e1de8329627a9604bfe4345cd42a44bba1ac24eba93c97db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rect::from_xywh(0.0,y,self.geometry.width_pt,height)\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 \u0060page\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/markview-pdf/src/paint.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b87eabfe2b9b382cd0231941578b5a471a4845b0990da56ff8ae8d268ab0df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rect_path(Rect::from_xywh(left,top,width,height).unwrap_or_else(fallback_rect),)\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 \u0060page\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/markview-pdf/src/paint.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb5bb43d6d32b84a16821b00af688d430b727136376163ce62448b26638b5d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rect::from_ltrb(0.0,0.0,1.0,1.0)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fallback_rect\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/markview-pdf/src/paint.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b6f700fb3f4979a9abe2d95cea4b04a3b9578845c57585ac1b1614e36eda91"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pdf.get_dictionary(id)\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 \u0060dictionary\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/markview-pdf/src/outline/proptests.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62ba62db562e19330e993f28feca24c61dffa9a3c1245d25272f74892bf5c60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value.as_reference()\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 \u0060reference\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/markview-pdf/src/outline/proptests.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad68b4d165015d586794db9ab3a2cbf93e454d93d33f97eeeffca15446e4c05b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PageSettings::from_wh(geometry.width_pt,geometry.height_pt)\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 \u0060serialize\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/markview-pdf/src/link/proptests.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"98254e4de8e04fe1ab46334306eacbf4e9f208c9cb9b7c10a8bf16e8b6cd7619"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.finish()\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 \u0060serialize\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/markview-pdf/src/link/proptests.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40242159139ebf482604a5ce19e8128e08d135d9743149614f152fc3644e461"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lopdf::Document::load_mem(\u0026document.finish().unwrap())\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 \u0060serialize\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/markview-pdf/src/link/proptests.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"876081fdf4ef3d5bfbf2258f77bb0342c3a34e4d199bd00e0966f625819964ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pdf.get_object(*id)\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 \u0060resolve\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/markview-pdf/src/link/proptests.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6307fb948c7583928743632e10bec20ba0ab5a0ce298e7a6df324fc4a6daf9e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060annotation.get(b\u0022Dest\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060destination\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/markview-pdf/src/link/proptests.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4cdeaf6875085b0b70ace538b2b5185378390e3ee61e0c10be36dd087af9ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060resolve(pdf,annotation.get(b\u0022Dest\u0022).unwrap()).as_array()\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 \u0060destination\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/markview-pdf/src/link/proptests.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6880a2328e18c2333bf932bd1e6c08ce78f9fb63099d89bdf3cf8f92ad2c32cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target[1].as_name()\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 \u0060destination\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/markview-pdf/src/link/proptests.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"040f28ea93b844c7d2b3fd34aa0d54f93cf29a3e152ac693a195951db3d8d50b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target[0].as_reference()\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 \u0060destination\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/markview-pdf/src/link/proptests.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e009af402e87cd8c6f83bbda6a1131685c09df2de70921a9e0fa2f8656cf266"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target[2].as_float()\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 \u0060destination\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/markview-pdf/src/link/proptests.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"190508f0dedf19577bd4c70ebe428f298331df8b49afd363a8e9c2812e45c53c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target[3].as_float()\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 \u0060destination\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/markview-pdf/src/link/proptests.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c294ded6b3c273359acaf9f54877d0b3e593bf7bb08ba47126d6e28b43e7a5e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060shared.1.wait(queue)\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 \u0060try_submit\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/markview-layout/src/background.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f948c0e93d0866cf8626b1a748ea43b3f575af9674f9a052b8a6e75b255068f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060queue.tasks.pop_front()\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 \u0060try_submit\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/markview-layout/src/background.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"302101cae72f95541cebad247015905ee2c052981cab90702bb1acb1f7963c22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.spawn(move||{loop{let(task,wakes)={let mut queue=shared.0.lock().unwrap();while queue.tasks.is_empty()\u0026\u0026!queue.closed{queue=shared.1.wait(queue).unwrap();}if queue.closed{break;}let task=queue.tasks.pop_front().unwrap();queue.bytes-=task.input_bytes;(task,queue.wakes.iter().filter_map(std::sync::Weak::upgrade,).collect::\u003CVec\u003C_\u003E\u003E(),)};for wake in wakes{wake();}if std::panic::catch_unwind(std::panic::AssertUnwindSafe(||{task.run()}),).is_err(){log::warn!(\u0022CPU computation panicked\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 \u0060try_submit\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/markview-layout/src/background.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c116600710c3e36d14f26f2d8f0b832d0007251128840f41adf301c157458531"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060theme_set().themes.get(\u0022InspiredGitHub\u0022).or_else(||theme_set().themes.values().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 \u0060prewarm_highlight\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/markview-layout/src/highlight.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"db00fda60d9e6bd8fc234ff7f0bd59ad47509d879beabb3de634db5fd5730d84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.layout_progressive(document,options,images,|_|true)\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 \u0060layout_with_images\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/markview-layout/src/layout.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba7d5dc3208e42c61043089255beac198184f858da31d1403dfda9e0fdc431c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.width.last()\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 \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/markview-layout/src/linebreak.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eee09dc190a332a1220e9661b23a9159155c4b5df3977b359cc161bfb276ab7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.stretch.last()\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 \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/markview-layout/src/linebreak.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8bf1d51ba8a76de30dda7383dc14681c9fa0a4a1f3db51f64ec5745870606eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.shrink.last()\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 \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/markview-layout/src/linebreak.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ffc4f87b61b3064264b397f4be9b2c425b1b3b87d80a0db27a887ce0e3fa62"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.justifiables.last()\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 \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/markview-layout/src/linebreak.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a90cf3fef9a45ca17120f4c18c1d16b7cb8bd78d570cde16d3d52007cdcfb1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clusters.last()\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 \u0060overhang\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/markview-layout/src/microtype.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"6507a2cf851cdbb629128586bd4bea5c6eee0973c7642e02203d876fbe854971"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block_prepared.bands.last()\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 \u0060paginate\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/markview-layout/src/paginate.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef84699239bb1924cb0b7b5a1eea05f1ae981e8db0438f0ad743187a412b94d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060b.rect(i,*rect)\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 \u0060image_at\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/markview-layout/src/scene.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab796b7aa1dcbd3c9dae73d3567f21059b07fcb15ce6a20d968a328d7f84c92b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new_cancellable(document,||false)\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 \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/markview-layout/src/search.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"404fce5669512711d2f35f0901a1555647cf2ff199fc24100a5e7718093c1995"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.find_cancellable(query,options,||false)\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 \u0060find\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/markview-layout/src/search.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b13fd7797c908ed3210d673bbf76deba46f76d397beac8655d96d21124ae58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060regex_automata::meta::Regex::builder().configure(regex_automata::meta::Regex::config().nfa_size_limit(None),).syntax(regex_automata::util::syntax::Config::new().case_insensitive(!options.case_sensitive),).build(\u0026regex::escape(query))\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 \u0060find_cancellable\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/markview-layout/src/search.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b91e0c3f30eae96086bc4f157bb51cd5f2480cddfd9e7124c0cebf4bc37dec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.boundaries.get()\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 \u0060find_cancellable\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/markview-layout/src/search.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"72c1aa60958e1616008bf780ef8da9c4c167bbfdbccebbcffb1ee2cefc6c525c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060advances.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060text_width\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/markview-layout/src/shaping.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9c9f8dcd7185ec89780c4f4d1f583c2f32cc52625947c22bde338003ba2a50"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060numbering::DEFAULT_NUMBERING.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060enum_numbering\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/markview-layout/src/style.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f05be9e78b131c38c8d484cf13df23064bfe7e9a5157eb59b00432a087406e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060StylesheetSource::named_rules(id)\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 \u0060named_rules\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/markview-layout/src/style.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"17694a6c3bb595c066a18bde68cdd8090cb1aa535c7bd225bd89a92172028265"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::named_rules(if dark{\u0022dark\u0022}else{\u0022light\u0022})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bundled_rules\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/markview-layout/src/style.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"065f6ab018edf2bde0c4ac23fb3cf49d46c5b5cc06dbdb56b147dc8e4c3c50af"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::named_rules(\u0022print\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060bundled_print\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/markview-layout/src/style.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"37df59535e76f324f5f871b2069ddf353c469f2db6720ea34eaaa1450d9bd843"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sheet.page.paper_mm()\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 \u0060bundled_print\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/markview-layout/src/style.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"62134cc26f008b72d38e63c99ee10245014a09e56ac2d5623f10907037d652ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(i)\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/markview-layout/src/text.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48845aebc2caf126a1e95005e0a5d836711ed072b7f929317e717991f4166a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.editor.try_layout()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060draw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/text_input.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16bcf55a1274410159e5d7db2363528b65c0728c177106281c28a1ab9e2b81b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(i)\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 \u0060at\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/markview-layout/src/text/clusters.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1eca8ad69e68e7a9628df908665f8aeb5ad94c9d539df4a7a0229a15ce7f707"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060block.rect(cluster.command,cluster.rect)\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 \u0060geometry_hit_test_text\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/markview-layout/src/text/geometry.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0367e3c9cbf1a58e3adde19382e1d871f5e7287178fd36b304cbf26f29d11ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060BlockId::new(1)\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 \u0060fixture\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/markview-layout/src/text/geometry/proptests.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d27d2f38cc8722b88c6308f273c985d48cdd2ac2551b3178625f1e570328dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pieces.get(depth).or_else(||self.pieces.last())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060number\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/markview-layout/src/style/numbering.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f45bb8c3975df15cac5177aa472dbf3f52f0ede7681887eb3f02e8a7ff8a1d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::parse(include_str!(\u0022../../styles/builtin.mvss.toml\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 \u0060builtin\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/markview-layout/src/style/source.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4facba52ef0f54a87aaf3853e25640c1d16d5d3201eb54edc58e8dbd0b654d7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::parse(source)\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 \u0060named_rules\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/markview-layout/src/style/source.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8221a8d92186e7a2f06e09750c94aacb0ffee0e1ce5e294f9715f6a5fd5fd3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::ALL.iter().find(|(r,_)|*r==self)\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 \u0060name\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/markview-layout/src/style/types.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49a3f365ddb64c6fffa386764af58efee2c8c05330d8392dec584c83bc4ffaa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(index)\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 \u0060at\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/markview-layout/src/scene/draws.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b6d8d9c7dd49074ced8e0dcb8366ebafd3431516231545324d623799eb8deb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tail_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/scene/draws.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"054e130c98c536ae50fb73a6d4a8488ae2ca542ab33b4c2da04fec2cc45aff8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.iter_range(range)\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 \u0060independent_range\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/markview-layout/src/scene/draws.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8881c4ec1e0ff80cc1100aa897b0e92086dc8c4b7250fcce926e803a5e7f8ab3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pieces.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060seal_spans\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/markview-layout/src/scene/draws.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb83b53f97797a3e5044fefb2bbb82e8f940afd8932217fb20cc574020e749b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(start)\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 \u0060from_paint_iter\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/markview-layout/src/scene/draws.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"628c4f8a878dc7f420b5020f58c598239f690bd7a8b36dcc69e0a8a84b4424df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(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 \u0060from_paint_iter\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/markview-layout/src/scene/draws.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5fc11ff484dc57269b43eac271a10e81d2e1e10883160638f8b0ef278458bd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(glyphs.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_paint_iter\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/markview-layout/src/scene/draws.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f582874d650aab52f50cf7c6db27a29cc2118016560aa1afa2aa366eef9e95"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(start)\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 \u0060from_paint_iter\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/markview-layout/src/scene/draws.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45fb6f1ae5ff505f4137687a36733a7f78cfc8087a7cf13d88ea4bcc15e0ad1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(others.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060from_paint_iter\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/markview-layout/src/scene/draws.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5cf556f996683e8e76170ecedca82452138a0ca7af47359bea603cfe076c76"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(start)\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 \u0060from_paint_iter\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/markview-layout/src/scene/draws.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a760825c21096b006098992efd8a8ca8681eae47ffb84d1a9cb7313f8f7cd362"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.scene.active\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 \u0060begin_parallel_scene\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d9b512629d3d85438665244416fd491893bacaf976eb54fd8c1bfe24cc0808"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.scene.active\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 \u0060end_scene\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b616043a1594a727eaa0054dcee645b976fc3cc9e3a1b1c336169230bcb9ec5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.scene.spans.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060end_local_scene\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca6d761101f168420522cf736463364ce214edd3134fe6649165fde5728524c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.scene.active\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 \u0060retain_disclosure\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"562068417248f5f1733e0a54287b36c5b23de251a08826cfee8994362fc384ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.scene.active\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 \u0060retain_footnote\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"420beb5b1339bf91f752248dc13a6c7acf6b14cea425d8280e63696f99c0bc1c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.draws.get_mut(command)\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 \u0060seal_scene\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7e5143dac07f4ab1e17a93e33afa91e98550ab0e9b438809b1220161c23333"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060scene.spans.last()\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 \u0060retain_leaf\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c78fd4cab0ea76a5f7ea4bab0cbcacf7795e3348ed23c06cdb4105460b9679"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.scene.spans.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060reuse_leaf\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"33837a7f590015dd6222c91513ce0ba3773425c499cb36ab00b4a7c4b0589e12"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060current.disclosure.as_ref()\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 \u0060place\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ea922f8d659a3c4217f9857be3e57bce94a14b5970330514096af45319dbac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.rect(cluster.command,cluster.rect)\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 \u0060flat_layout\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30828856c2cdcf3fe3f327110b15d2defb0365bf760b2558815ff4dab95ee30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.layout.draws.iter_range(commands.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draws\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/markview-layout/src/scene/flow.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5c305aee9f535acd33631b1352c6c24caff3c9d13deb396fe9d427be381927"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(i)\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 \u0060at\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/markview-layout/src/scene/links.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f62947533eeb3e0875b7b963f0f5996824232f9423126a9f85a3baaf810e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060BlockId::new(*next)\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 \u0060build\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/markview-layout/src/scene/flow/proptests.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdfec1fc793e495082e822dce6317babbc2622bad130e90cbe67fa430f73fca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.draws.get_mut(placeholder)\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 \u0060measured_block\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/markview-layout/src/layout/blocks.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6b02f7305bf650e911ca8785d3b5146739e8d94d20bdfd9effeb75a9bba12e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060callout.title.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060callout\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/markview-layout/src/layout/blocks.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde2040da6e9153d8709e540f5acfb374ad3bea91f9229313a19938427811d5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i.error.as_deref()\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 \u0060image_placeholder\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/markview-layout/src/layout/images.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bf399d4db4cbad86d19525c363daca9ea136a728935465fb1be5d8ec1ad040"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060units[end-1].after\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 \u0060reshape_to_fit\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/markview-layout/src/layout/paragraph.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfcdaa388864c7c5796e6de50e70e13c708c436bae2beac1707dac78e667b47"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.text.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060paragraph_bounded\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/markview-layout/src/layout/paragraph.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"11a6e691a1f0edfcae93310f40ea39adebbe8fda019f07e9b9ee6501767037bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060p.images.values().next()\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 \u0060paragraph_bounded\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/markview-layout/src/layout/paragraph.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60bfedd917e62dbe56ffe48fa028537b177351b3a3d29b9bf873a11f3f63b60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.block(id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060selected_blocks\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/markview-layout/src/layout/progressive.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07b8d8f4936f8159b9b37a00b767af9584e4f833f0fcdb39d9621f74ca4d047"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060siblings.iter().position(|block|block.id()==id)\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 \u0060selected_blocks\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/markview-layout/src/layout/progressive.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa7a4aa44c859446d9c3f965003a0f02ab50f7880d1c6fd1609b883e126c737"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.layout_subtree_cancellable(document,node,options,images,||{false})\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 \u0060layout_subtree_with_images\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"781a0e0b076d59f878c7e704e8278a7a07446b1630b4bc195222ae6b9c4c3552"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060siblings.iter().position(|block|std::ptr::eq(block,node))\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 \u0060layout_excerpt_cancellable\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"62247dce45d3c479b5cc5f44d204c513b9601957a5707c552d36d2969ed8a41b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.path_of(node.id())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060siblings\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cf42b713a6db609535821fef1de1349b169db4721de42d0f18b38d88f7a153"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.block_at_path(\u0026path[..path.len()-1])\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 \u0060siblings\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6737d0d5342c6f4ce49f5ea07a65bdc5124f3dd38097f6d1cfd0af019d0239"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.path_of(node.id())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060context\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae5b93fe6a83976c7b9d5a8d951ba1707f90598422779a8b5e77b27fe11c30b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.block_at_path(\u0026path[..=depth])\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 \u0060context\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1636984ff38cfb9bfb6a1b4c22b5e311b1a47104fdfe320ae798dfcd3e7d9a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060siblings.iter().position(|b|b.id()==current.id())\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 \u0060context\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bc711af059b0cd9cd371a80874f0ed1096fe37163844e0ac8e2814f222ecb9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.block_at_path(\u0026path[..=depth\u002B1])\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 \u0060context\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6548effb1cda03bc09a1b3ab84f3645a45df004d14bf9b0a82a93b57ff239e8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060items.iter().find(|item|contains(\u0026item.blocks))\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 \u0060child_context\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d83e91cb13cbcc96a328906c6d9d54e5f7ea0764ce1356d0c5394c9afcf8bbc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table.groups.iter().flat_map(|g|\u0026g.rows).flat_map(|r|\u0026r.cells).find(|cell|contains(\u0026cell.blocks))\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 \u0060child_context\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"718c84b60cd7a8180369ba4be29bc5fc9a1567ff7fb2d4eb9b96d175b331ceec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060items.iter().flat_map(|item|\u0026item.definitions).find(|blocks|contains(blocks))\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 \u0060child_context\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/markview-layout/src/layout/subtree.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"445835aaf736664425c2f59d146a2256ce200bfd50183f5e2eb9eca8b6f00e34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060decoration.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/table.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e3e828655dc476a4bb205c9e846cec165f97f72d364262a1a1f8b546f6d073"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.draws.get_mut(cell.draw)\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 \u0060table\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/markview-layout/src/layout/table.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d524f45a036324b9b7125105daab2d51b66ecc47156c735c43ab2def4a1931"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parallel.pool.as_ref()\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 \u0060prefetch\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/markview-layout/src/layout/progressive/parallel.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3001c8b42eb9ca512ff17b12df811e5283d659a8246a578c065931258992b17d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pool.current_thread_index()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060prefetch\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/markview-layout/src/layout/progressive/parallel.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"435c40b5d46ba37f688664852a5c1da2d4503dd544bb610814e4f060ce6271c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slot.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060prefetch\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/markview-layout/src/layout/progressive/parallel.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b44e622e1f6a68cf91e862da670dfec93677ea91bf3d5f98bf52f744a72f8cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.draws.get_mut(previous.command)\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 \u0060push\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/markview-layout/src/layout/paragraph/paint.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"428a8fbc510c2fa082595ffcf5ef997b2525da50789f5860957d02c17afeb80e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LinkOccurrenceId::new(start as u32\u002B1)\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 \u0060occurrence\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/markview-layout/src/layout/mapping/proptests.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f61fbffebba60a108ab8e841034df841d7b90393870135b51a51d8b73318f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LinkOccurrenceId::new(value)\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 \u0060id\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/markview-layout/src/layout/cache/proptests.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"69755626c291e6a5978aa03fa188c111c899c86e2b5162d033101acdbfece010"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.finish(vec![block]).into_blocks().pop()\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 \u0060paragraph\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/markview-layout/src/layout/cache/proptests.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2998929b45d5dca22e570e468e7918d09adfae5a36e387b53a51a12ca66a986"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.draws.get_mut(box_index)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060list_item\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/markview-layout/src/layout/blocks/list.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"228a54eb3e2e59d01d4ba932cfc88e22caf8c4482068580068e42d28064d60aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060BlockId::new(1)\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 \u0060position\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/markview-interaction/src/proptests.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a738ea2ca8380ef34c50a6744b017a702a5de90565c6ec6f34107b3fe1fcd7e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.wheel_velocity\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 \u0060spring_at\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/markview-interaction/src/scroll.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b3079a4275b80864b1741fbe47fa72b28294cb9cbc82025f8b3751a23acf49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060BlockId::new(1)\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 \u0060fixture\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/markview-interaction/src/document/proptests.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3426e2861651f864eaecef23b7458dac28635322cabd378dd3e3d080893e11d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LinkOccurrenceId::new(7)\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 \u0060fixture\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/markview-interaction/src/document/proptests.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3752e0daa656aa4b8b81a41b63620f99f6ce3e2158a8134f152b2f5f17814b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022CARGO_MANIFEST_DIR\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 \u0060icon\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/markview-icon/src/lib.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a351f016640168763264c82518158691236aa5f776d51ad764a15914aaa4be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022CARGO_MANIFEST_DIR\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 \u0060expand\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/markview-i18n/src/lib.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecf843645cfd8efff3196b3e6862150cccab84734e60c644b59c29352159e56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060BlockId::new(self.next_block)\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 \u0060block\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/markview-document/src/build.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f138adac1352eee6c6bb68e7f8b568f80b4e52ce913176b35c3fb909c0ac99d9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LinkOccurrenceId::new(value)\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 \u0060occurrence\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/markview-document/src/proptests.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8a9e606ecfcaffa48d8d1f6a37831c68543e453ea3e79c8a92cd9734fff0eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060BlockId::new(value)\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 \u0060block_id\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/markview-document/src/source/proptests.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b00f4e0eb218a046ed0d8ef4aaf8400bc58db52a3f05f8092bd0668e93e3fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.frames.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060close\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/markview-commonmark/src/container.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ac7fff69266b1dd9433b8324b6ea58df1eadfc22b5ff399a7035577b6e8015"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060html::tag_len(fragment)\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 \u0060attach_summary\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/markview-commonmark/src/container.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11e4da5602e070ae4d0e66baac27fe0be7404a8f07bd9c7aa186631eca09454"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060line[at..].chars().next()\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 \u0060mask_inline_code\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/markview-commonmark/src/incremental.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd886626966ad662f47943a3d95a503418d7cf2cc933184e86c7aae4758ee9e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060html::svg(\u0026raw.text)\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 \u0060inline_svg\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/markview-commonmark/src/parse.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e55ad3713963a6ca7245d11a9a9dcd0a2ddbdd67256d34a6ec5af81fd3749b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.source[at..].chars().next()\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 \u0060text_after\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/markview-commonmark/src/parse.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdf3ea02f908faa8fa89314c4fd7fd85dedbff58c6a76f8510d4f0dd0785322"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rc::try_unwrap(reader.producer).ok()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parse_with_seed\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/markview-commonmark/src/parse.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d0a468d91d61acc50ce618561152f285d2d939f391141e49c98b906f895c76"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.sources.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060merged\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/markview-commonmark/src/rich.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"973298d5780e9bf631082536a762dcc968cdbfa775babaab7e19cc0f301bdd19"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060offset.checked_add(1)\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 \u0060source_occurrence\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/markview-commonmark/src/rich.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b877ca177deed5585a747f55c0ea8545fa0c4f6d9cc569439c16c89cf40a2891"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u32::try_from(offset.checked_add(1).unwrap())\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 \u0060source_occurrence\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/markview-commonmark/src/rich.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18d647875f1dd9345eacfcb959ce31432cd5a646675628ba026c5dec43d2126"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060markview_document::LinkOccurrenceId::new(u32::try_from(offset.checked_add(1).unwrap()).unwrap(),)\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 \u0060source_occurrence\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/markview-commonmark/src/rich.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"867dcf43943c7befa0d0e7674adcc10a48726bcd6fa0f93ea2ff27802e00b3fa"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060variation_settings\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/markview-pdf/src/text.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d65faf565580aa161161702da341b335bdf6abe06be887732b1cf5b1e4eff31"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060describe\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/fonts/catalog.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a2a4016af82de9778fd6b290e2cabe67ba66f2bfa9f7454088f798e72e642a"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.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-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.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-926","guid":"0d9b5579-5549-555a-8a97-f9cc14f3ad4a","name":"Improper Export of Android Application Components","shortDescription":{"text":"Improper Export of Android Application Components"},"helpUri":"https://cwe.mitre.org/data/definitions/926.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":163,"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."]}]}