{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"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":"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":"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":"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":"Automation::call (cyclomatic 256): Automation::call has cyclomatic complexity 256 (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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0971c05e140e1e0f1b2e7b85d2c149f4031ab0e6b950366fc656d1c3a327007f"}},{"ruleId":"D1","level":"warning","message":{"text":"Interp::builtin_inner (cyclomatic 157): Interp::builtin_inner has cyclomatic complexity 157 (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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"f540d9af9f417225db0e88ec6d5a43003c9f5a1dbfa3f2a0be2dcd0ef8d130fb"}},{"ruleId":"D1","level":"warning","message":{"text":"PhotoEditorKt.PhotoEditScreen (cyclomatic 146): PhotoEditorKt.PhotoEditScreen has cyclomatic complexity 146 (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/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"cacb7b1168c5db9e0cb0971dab29fe45def6a1c9b785fbbe3f5a37897333f28d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_engine::run_edit (cyclomatic 144): pdfcraft_engine::run_edit has cyclomatic complexity 144 (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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"956aa29c8b3799b56172a42faaaa81a31169f27eb7f8969ac85ebfab3fbe6184"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::text_regions::rewrite_styled_block (cyclomatic 142): pdfcraft_edit::text_regions::rewrite_styled_block has cyclomatic complexity 142 (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":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8cba2c4261279807ae49dbf9f4018266dd38c8f4b6133e84b8c0f440ea7b36"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_annot::appearance::build (cyclomatic 123): pdfcraft_annot::appearance::build has cyclomatic complexity 123 (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":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c83f4815301af445d88c15181a536f3e226448deae56777f25ffc43b2a61cf4"}},{"ruleId":"D1","level":"warning","message":{"text":"Edit::label (cyclomatic 118): Edit::label has cyclomatic complexity 118 (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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0763f96cb710723ea17611e69b80583156b085a042a84858212eb2be5ef49f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::draw_sheet (cyclomatic 116): pdfcraft_create::office::xlsx::draw_sheet has cyclomatic complexity 116 (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":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"492dc430772e869d49677f691301176f485b6a72839fe447580f96cd5b277c9d"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerScreenKt.ViewerScreen (cyclomatic 116): ViewerScreenKt.ViewerScreen has cyclomatic complexity 116 (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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerScreen.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc6220344c473195c575aca17e9f064966fb1f343a2aa9e21115e1cf906e867"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::rtf::control (cyclomatic 106): pdfcraft_create::office::rtf::control has cyclomatic complexity 106 (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":"engine/crates/create/src/office/rtf.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fdb4d657891370aef1f57ce9a101ecfee037027dfdbc1799ff6cc449815dde"}},{"ruleId":"D1","level":"warning","message":{"text":"SheetViewerKt.drawSheet (cyclomatic 105): SheetViewerKt.drawSheet has cyclomatic complexity 105 (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/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f14f0a27471c0008d6126bedd389c29f24a831528bf248d7cb093a171e4a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::author::set_props (cyclomatic 103): pdfcraft_forms::author::set_props has cyclomatic complexity 103 (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":"engine/crates/forms/src/author.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"266cb3b57d78f5a25db74e9c96de9de279ae6aa6df92e64cab8cc3076a2652d7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::text::rewrite_block_from (cyclomatic 100): pdfcraft_edit::text::rewrite_block_from has cyclomatic complexity 100 (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":"engine/crates/edit/src/text.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2bdae74abfc96db2ca3e7a01446e74d465dae4bd3d05c251a0045c62e89803"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::text::interpret (cyclomatic 80): pdfcraft_edit::text::interpret has cyclomatic complexity 80 (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":"engine/crates/edit/src/text.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"af124f5d856167f55e6cf4caf46909429074ac239ea5e545b93b5327ffddbd23"}},{"ruleId":"D1","level":"warning","message":{"text":"MindMapKt.MindMapEditor (cyclomatic 75): MindMapKt.MindMapEditor has cyclomatic complexity 75 (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/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"c362b5a60d442750f4b8e97cdf6435f2613a071a26103d646c3fe1d3c6391e76"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::interp::process_from (cyclomatic 70): pdfcraft_redact::interp::process_from has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4cc8c622d8cfd35cd809d7befacd4b2a56a21b033aca1f1dfacb26241101f9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_preflight::verify (cyclomatic 64): pdfcraft_preflight::verify has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/preflight/src/lib.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfba2c23c90818cd40aa7e91409cd78110b57f334c99e69d54323fddd4a4426e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_print::layout (cyclomatic 64): pdfcraft_print::layout has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/print/src/lib.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49492b98b2a8de5f949f95f7f49cad63c5f364337d88563046baadd4fad869e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::apply_to (cyclomatic 59): pdfcraft_redact::apply_to has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6da392864a32a1a5a6bab4af34f7e220fa0b5ef4180ce293673424d9feb689"}},{"ruleId":"D1","level":"warning","message":{"text":"Emitter::widget (cyclomatic 58): Emitter::widget has cyclomatic complexity 58 (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":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"715deada76d1dbd50b1356ee85718aad6f159b1310390970c6240b55ddef0cea"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_render::text::arrange (cyclomatic 56): pdfcraft_render::text::arrange has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36aa59272dde1187bd85efcb381caf225c388533dced2bc35288d7d83aaa9b5"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_annot::add_annotation (cyclomatic 54): pdfcraft_annot::add_annotation has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"904073584c7cdb4cce9a4aa329a75dcfe03f160fabe4a8fbfb5689da1ab6028d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::sanitize::remove_hidden (cyclomatic 53): pdfcraft_redact::sanitize::remove_hidden has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/sanitize.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac0cc69f8fc30aaead09db40a4bdd68a6b8af7a215e3316d66c90a5f15a37fd"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_render::raster::worker (cyclomatic 53): pdfcraft_render::raster::worker has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/raster.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41d06125f7b69c97084fdcb38cf9a9cf250f7a3ac3c5d1426a6a144c79b30ee"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::pdf::classify_changes (cyclomatic 53): pdfcraft_sign::pdf::classify_changes has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfcf22e990e609d7b446346e1ada8205d7cf27cf9974a0238857625eadf3051"}},{"ruleId":"D1","level":"warning","message":{"text":"SheetViewerKt.SheetGrid (cyclomatic 53): SheetViewerKt.SheetGrid 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea86af990e742fff5d59f68dc8061a94887810f263912a8909b5d248e6f506b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter::table (cyclomatic 51): Converter::table has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b9a7fee02d2e4174a7f790655e41b424989533f81a9487be9383dd32af4c10"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::rtf::convert (cyclomatic 51): pdfcraft_create::office::rtf::convert has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/rtf.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"5464b0964d621e21e8eb90ef3acdcb23a043fe206d994891d9a13976b2cbbbcc"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::read_compact_section (cyclomatic 49): Document::read_compact_section has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/document.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"563235a8793582c20fd345840ea8c1800257ab914131f2d03712fd9bae48b50b"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::af::parse_date (cyclomatic 49): pdfcraft_forms::af::parse_date has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/af.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"026f1f5d555494aecd8d5adcbcacaa834a20326b225cc623d20b986450244c45"}},{"ruleId":"D1","level":"warning","message":{"text":"SheetViewerKt.SheetViewer (cyclomatic 49): SheetViewerKt.SheetViewer has cyclomatic complexity 49 (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"06aba3c0a3715527e22d92444f0644b2434bfbff0075a8cad3123c89cc49cceb"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::write_value (cyclomatic 47): pdfcraft_forms::write_value has cyclomatic complexity 47 (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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c56bc5a34efa4b7d1503912ad1073d552331b000fb44652311d1a49626ae94"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::page (cyclomatic 46): Writer::page has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/draw.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f465458ea33e5d6165018e5695eb438ddb5aa4bda954c22279d2521deab5be2"}},{"ruleId":"D1","level":"warning","message":{"text":"Layouter::draw_field (cyclomatic 46): Layouter::draw_field has cyclomatic complexity 46 (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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a61c33dd3af1a73207073b709b0f8dda6a278e9080dd5fa426bc05e2650404a"}},{"ruleId":"D1","level":"warning","message":{"text":"SheetBook::cells (cyclomatic 46): SheetBook::cells has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/sheets.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"905d8904b5a6a3d7fce17c5aae9dc65b7f5a329a4e35235a1fd616ce8417be09"}},{"ruleId":"D1","level":"warning","message":{"text":"PageCanvasKt.PageCanvas (cyclomatic 46): PageCanvasKt.PageCanvas has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PageCanvas.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8314110791112a40573305283a2f2e279670e9ab43a29239b902881b587b7d0b"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::comment_add (cyclomatic 45): Automation::comment_add has cyclomatic complexity 45 (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":"engine/crates/automation/src/comments.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"472f914fc62c859736b5675b319470e456be3a327b338b6c9c42c8019f244b32"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::apply (cyclomatic 45): Session::apply has cyclomatic complexity 45 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b78f0fa61432392e000bc783420db1ffac59cadac21849f99d86395445c272"}},{"ruleId":"D1","level":"warning","message":{"text":"artefact_mobile::xls_art::chart_bits (cyclomatic 45): artefact_mobile::xls_art::chart_bits has cyclomatic complexity 45 (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":"engine/mobile/src/xls_art.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0063f651176c260fbf8f0f78388e64f51ab4aa852dc0c1b2ad92deba83bb8184"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::ops (cyclomatic 44): Walker::ops has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/measure/src/snap.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88962d7794f0c8c04d0c138cd6299f56c76982084494af7e7b1373074d7c39c"}},{"ruleId":"D1","level":"warning","message":{"text":"ClearAppKt.Shell (cyclomatic 44): ClearAppKt.Shell has cyclomatic complexity 44 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/ClearApp.kt"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee778c85abde86f49882be6a838619f6541bd548fca36b071ff76f8eadacb53"}},{"ruleId":"D1","level":"warning","message":{"text":"MascotKt.Mascot (cyclomatic 44): MascotKt.Mascot has cyclomatic complexity 44 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/mascot/Mascot.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5971b7c4f8984c42a3e45bdfe010c3888cb504f2c52740411950a00d5430baab"}},{"ruleId":"D1","level":"warning","message":{"text":"PagesScreenKt.PagesScreen (cyclomatic 44): PagesScreenKt.PagesScreen has cyclomatic complexity 44 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PagesScreen.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"945a39ab07cb2786406d8eaeeda2388eaf9f739c0ad01af09425168c11dca143"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::formcalc::lex (cyclomatic 43): pdfcraft_js::formcalc::lex has cyclomatic complexity 43 (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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b23ec348efe18fb5fe0977acb345fa8038e7a9fb8f266d29fa2cc7a4d4df04"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::pdf::appearance (cyclomatic 43): pdfcraft_sign::pdf::appearance has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7296969b74708b50da15f9d3ac180757221ebaaad1b8d28ca57934c543b7e5"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_a11y::headings::mcid_texts (cyclomatic 42): pdfcraft_a11y::headings::mcid_texts has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/headings.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8c56d75e7851efb129ac9339c2c79af2435dcb56f9a1e08f64aef934bb5627"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::flatten::flatten_in (cyclomatic 42): pdfcraft_edit::flatten::flatten_in has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/flatten.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad76fd482bd301bd90a566f9dfffd5b197ff7d58e6107f488b3d7f66dbaa0fd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Interp::member (cyclomatic 42): Interp::member has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2458e5261b4da63dd3cdbf3258afc4c31011f09f8e54591f51195a44718d8bf"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::extract::image (cyclomatic 41): pdfcraft_create::extract::image has cyclomatic complexity 41 (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":"engine/crates/create/src/extract.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82e80d71f089e869d4de2d5fd67c3b4a6293d96162fa18dd2c4f307117930f4"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::text_regions::group_layout (cyclomatic 41): pdfcraft_edit::text_regions::group_layout has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4493432a857721de70841bb7010877addf29e0687ac96c62290bad546d7e9287"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_export::tables (cyclomatic 41): pdfcraft_export::tables has cyclomatic complexity 41 (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":"engine/crates/export/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"1675880cb3ca751763a3cad299591a4119b7ff2538bd98bd7e6f803155ca0866"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_preflight::convert (cyclomatic 41): pdfcraft_preflight::convert has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/preflight/src/lib.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"22eabc8cbec374a96eb589671f10ca7361ef44ffa01b59e000c7bd79b30e0c96"}},{"ruleId":"D1","level":"warning","message":{"text":"Walker::walk_ops (cyclomatic 40): Walker::walk_ops has cyclomatic complexity 40 (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":"engine/crates/audit/src/cover.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"866ce4d5c69d8bd05e0d058c9356932c27e1bf769b5958e1fcb1849f32b3dd6a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::flow::render_line (cyclomatic 40): pdfcraft_create::office::flow::render_line has cyclomatic complexity 40 (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":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"420f9995de8bb37acdba1e53f4c6ffce578cd841d6021d0e3019db97cf8a4971"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::data::merge (cyclomatic 40): pdfcraft_xfa::data::merge has cyclomatic complexity 40 (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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"330f29b71c4182d823a3a7ddbd3d1a02455dbbd4488b37347fa37a36d86774be"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_render::text::reverse_rtl (cyclomatic 39): pdfcraft_render::text::reverse_rtl 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":"engine/crates/render/src/text.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a16bf5f2d8f3fbba57b6f3dea8fcb34a14a51d9dd99b60d41c2774d37560d63"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::format_date (cyclomatic 38): pdfcraft_create::office::xlsx::format_date has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58fca03eb85d2d71f723bbd09a7669038fae350b761aa1978ebf2efb56f0857"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::appearance::field_appearance_fit (cyclomatic 38): pdfcraft_forms::appearance::field_appearance_fit has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/appearance.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"880a367cc3cbc29d5dc8243a3791bc2f07de112ea4a8530979e965cf15375b31"}},{"ruleId":"D1","level":"warning","message":{"text":"Inspector::page_labels (cyclomatic 38): Inspector::page_labels has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea6e76be14d755fc728c550dc33a8b755ef39356bcff112d7b2f100cbb451a7"}},{"ruleId":"D1","level":"warning","message":{"text":"FilesScreenKt.FilesScreen (cyclomatic 38): FilesScreenKt.FilesScreen has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/desk/FilesScreen.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc142eb603eae1afa7a7dc03ccaf94ce0713ba1a9d4196a15719ca855a786e4"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::flow::layout_para (cyclomatic 37): pdfcraft_create::office::flow::layout_para 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":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed24862e64152941f8ce759f6b6adb38c5b398d39cf35db625e971baf853e849"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_optimize::optimize_with_progress (cyclomatic 37): pdfcraft_optimize::optimize_with_progress 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":"engine/crates/optimize/src/lib.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ab5044666f4046a8f5e70b07313096c26dcfb17e4c03852f939b32f0f56dcb"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolScreensKt.CropScreen (cyclomatic 37): ToolScreensKt.CropScreen has cyclomatic complexity 37 (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3c90e8ebf561693124e7b6f97ffbce8164b0af4bdb15701870c2d1228feb12"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_a11y::content::page_rule (cyclomatic 36): pdfcraft_a11y::content::page_rule has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/content.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e65541132779b1f234b207668f10d3f2509a509f79ff9240f380f9d4ccef527"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::docx::parse_ppr (cyclomatic 36): pdfcraft_create::office::docx::parse_ppr has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da1ca90b37a1d47ea15f5ea1a77a6bb4edfaddfb3f7619f03b503620202dc42"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::detect::page_shapes (cyclomatic 36): pdfcraft_forms::detect::page_shapes has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/detect.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0152106a3ace3ea2c8bcf0008555b1c839f97ee7fcb3c4a01107e22a2cba6f33"}},{"ruleId":"D1","level":"warning","message":{"text":"Interp::exec (cyclomatic 36): Interp::exec has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"502e6ba025305427c0c641faef4168910d94450188153df092693981b7419375"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::tags::clean_within (cyclomatic 36): pdfcraft_redact::tags::clean_within has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/tags.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f05795d539258701aaa2fb531e4fb2c8e13016fc6e371f13e0cc885f45c685"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::text_body (cyclomatic 35): Renderer::text_body has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3b3bbe9ab95149011c379dc8b84f91ee89869166b823093e7a9570f984567c"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::graphic_frame (cyclomatic 35): Renderer::graphic_frame has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f55c355de96c898a5b46062d8efb63b0d6c6456516db89f2a8248909acfe12b"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::isolation (cyclomatic 35): pdfcraft_edit::isolation has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/lib.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc78d9cef26118247f28777b0f2dbbc329c728b7c532b9a2b9957c554d7f2b8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::interp::xobject (cyclomatic 35): pdfcraft_redact::interp::xobject has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbbe0c90925ed7965e1b535ed77b8352a4a1094366ef5267f3f0f406525e5c63"}},{"ruleId":"D1","level":"warning","message":{"text":"MindMapKt.layoutMind (cyclomatic 35): MindMapKt.layoutMind has cyclomatic complexity 35 (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5859469180e095e9bc8e393e4aeaa44041af9ae7b8834ddb627c215ecf2af6"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::doc_print (cyclomatic 34): Automation::doc_print 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":"engine/crates/automation/src/printing.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bcf0f1f54ea54914d48cf5d0c041527bf114da03a098d44080cc952dc2c513"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::redact_mark (cyclomatic 34): Automation::redact_mark 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":"engine/crates/automation/src/redact.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"849ff8dc9df666c4f20a2906719b3de56843764ea5b5672afc9eb8548804ce3b"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::background::page_background (cyclomatic 34): pdfcraft_edit::background::page_background 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":"engine/crates/edit/src/background.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c4af32165f25fef9f8c63feb74813899eb0eb47b32fffed62f339cfba115e3"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::af::js_tokens (cyclomatic 34): pdfcraft_forms::af::js_tokens 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":"engine/crates/forms/src/af.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e22bd9ffc99ab5e311a45a12968ac4e6566119d01925be6e5fd162c314897cf"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::pdf::strip (cyclomatic 34): pdfcraft_xfa::pdf::strip 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":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"153d9eafa632e0a2ea3786f1f29d4eb06fb8ca30526ecfb3698ee611b68410de"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfdf::xfdf_annots (cyclomatic 34): pdfcraft_xfdf::xfdf_annots 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":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed861601c77cdcbfbed3fba6998e679d52ef73661ea6067b4bd75ee8f8cd1a61"}},{"ruleId":"D1","level":"warning","message":{"text":"SheetChartsKt.paintChart (cyclomatic 34): SheetChartsKt.paintChart 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetCharts.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3956a124084eb2b346cb178217dbf96a3a115e13089f86f8dd5ab7e19cd1fa2a"}},{"ruleId":"D1","level":"warning","message":{"text":"StyleSheet::parse (cyclomatic 33): StyleSheet::parse has cyclomatic complexity 33 (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":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1f871c4997bfbee11393144f52f1460d90e20f903f1bc641fa0628c99c4251"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageState::apply (cyclomatic 33): ImageState::apply has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/images.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b673923d4bb323cf02943f1eb261191eb13b74be64f7fab61954d7623227b784"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::statement (cyclomatic 33): Parser::statement has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88ca1ab76a1fb440704c4afde29581a6a3d06c3cd13190f5abb4f9487de6efe"}},{"ruleId":"D1","level":"warning","message":{"text":"Interp::method (cyclomatic 33): Interp::method has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"623f06b4a77ffb8cab2eb9db7e03cde0f68584edb39382f3730f299b5f07d8fa"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_organize::view::set_initial_view (cyclomatic 33): pdfcraft_organize::view::set_initial_view has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/view.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"faad776e94db198280c4e761b1fe4bf3ee9b586456f782d8cf9f48f4df56fb0d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_annot::rect_for (cyclomatic 32): pdfcraft_annot::rect_for has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e85ad61b7c73401ad7e0cec357751194eb8131805ec2abd4ea1f70160afea5"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::doc_initial_view (cyclomatic 32): Automation::doc_initial_view has cyclomatic complexity 32 (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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b00479bc96ed3a282daa853b13da96aee90c9ecf6877aba63b9866d7b933b00"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::flow::paginate (cyclomatic 32): pdfcraft_create::office::flow::paginate has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c444b9909e89e2d31aacd59503bd69495bca5a7511857ee1aa3146c2f33b738"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::parse_sheet (cyclomatic 32): pdfcraft_create::office::xlsx::parse_sheet has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_create::office::xlsx::builtin_format (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"feffe148768205b222b5b9d8e8f10493bebe3107bbcdf4bfd07ea4553124ced3"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::xfa::node_get (cyclomatic 32): pdfcraft_js::xfa::node_get has cyclomatic complexity 32 (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":"engine/crates/js/src/xfa.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98b6947265939fa012ef605fbf70801233f3940de050b81a988f26692829e28"}},{"ruleId":"D1","level":"warning","message":{"text":"Inspector::annotations (cyclomatic 32): Inspector::annotations has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6519d07544c6ed69b4a25bbe695d29cd45e772e5172f81b63bb3b89634480d"}},{"ruleId":"D1","level":"warning","message":{"text":"Extensions::read (cyclomatic 32): Extensions::read has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/x509.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d25c14165c8789e7f5583c1cc2c0d2823f4b547a9da3eb0f9f00f40a7632e1"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::read_section (cyclomatic 31): Document::read_section 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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ed7ab8a8fa74f14f9d53c6cdbb09f101dea46531113a6cc06fb4d6994e1790"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_cos::writer::write_full (cyclomatic 31): pdfcraft_cos::writer::write_full 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":"engine/crates/cos/src/writer.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d2f66e7c1209918f0856831c670c4601f95b370a3fed08b9b88ec0c8aaead7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::pdf::validate_into (cyclomatic 31): pdfcraft_sign::pdf::validate_into 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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"b080fdfbe87521f0359ec6077a50ab63deb667cac3732e40cc2ab4869e4f0750"}},{"ruleId":"D1","level":"warning","message":{"text":"Metrics::read_metrics (cyclomatic 30): Metrics::read_metrics 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":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"66103413ee718c650c02d1b8dc58550b131d5e56171a5f444cd5e18a7e0a1037"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_organize::view::initial_view (cyclomatic 30): pdfcraft_organize::view::initial_view has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/view.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f6827052b7766df2d381d71f7ba3e33ba91f98d0ed57ebe1a5c1bf1bc8661e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::text::layout (cyclomatic 30): pdfcraft_xfa::text::layout 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":"engine/crates/xfa/src/text.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ecf07aec2f7d9d3ca4d6f6fd3e236f6a7e9f0fabb52479e6e66d38ecf978fa"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentPanelKt.CommentPanel (cyclomatic 30): CommentPanelKt.CommentPanel 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentPanel.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04920385706609a29e70a77163b2842aa7f665873c840fb447179269c17a06a"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter::run (cyclomatic 29): Converter::run has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ffcc552c5e20ef60d256f6bd5f188f4d9421fe5f1084c5bb8710c819fa1733"}},{"ruleId":"D1","level":"warning","message":{"text":"Inspector::fill (cyclomatic 29): Inspector::fill 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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a6384f0910822f4d23904f3e43a0083b2c908b99576489a6789527dbeb4d87"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::pdf::change_kind (cyclomatic 29): pdfcraft_sign::pdf::change_kind has cyclomatic complexity 29 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd41184c7e2e8f3130e4803fa8c2115a4bc563d56d280dde3ca199b70e793bee"}},{"ruleId":"D1","level":"warning","message":{"text":"CreateDockKt.CreateDock (cyclomatic 29): CreateDockKt.CreateDock has cyclomatic complexity 29 (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/home/CreateDock.kt"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"55395f0cb0abb36d3c18a45b751ce4239fdd09c55b511884bb8eecd113b522a2"}},{"ruleId":"D1","level":"warning","message":{"text":"MindMapKt.drawMind (cyclomatic 29): MindMapKt.drawMind 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad392431d8be9967f9547fdc5041907c0c44524238eafa8f85aa03b6f84a8c2"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::jpeg (cyclomatic 28): pdfcraft_create::jpeg 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":"engine/crates/create/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b74613d3c73cb2babe16ebf5d4a5a38fc94ac0e71a1b6b8b957fdde8d1f7f19"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::prepare_open_unguarded (cyclomatic 28): Session::prepare_open_unguarded has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3681}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98baf38481253b526f5016bc557d33254b97acc814032841ab7a99dfe60ca99"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::af::format_date (cyclomatic 28): pdfcraft_forms::af::format_date has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/af.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"100f87bbf58f221d9bcd0c2d9ab3a0ac18e8fb93d0792a772a6833021142f29e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_organize::import::import_pages_mapped (cyclomatic 28): pdfcraft_organize::import::import_pages_mapped 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":"engine/crates/organize/src/import.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a310d1868d1fcfe77ba9cd67c237a9edd3b2718c9e130b3102e5be8c9d3db6"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_render::transition::frame (cyclomatic 28): pdfcraft_render::transition::frame has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/transition.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"93727fecb883e4175bdd8d4e19a6a3d5bbec064ad504976b41c50b246f86132d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::pdf::finish_validation (cyclomatic 28): pdfcraft_sign::pdf::finish_validation 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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d4caca8f17c284da3b1cdb35cd6a8eae4d9d3bfdc2509ab3b3be9307c803c4"}},{"ruleId":"D1","level":"warning","message":{"text":"artefact_mobile::office::sniff (cyclomatic 28): artefact_mobile::office::sniff 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":"engine/mobile/src/office.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2687de0bbc3a1e7f389177ce054e87be871a54858d136c6d0f013f253b1bcea3"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::docx::convert (cyclomatic 27): pdfcraft_create::office::docx::convert 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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bba2a68dde5c3c584725174a9096635e0bafcb5d79e47371273ed886942848a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::format_value (cyclomatic 27): pdfcraft_create::office::xlsx::format_value has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_create::office::xlsx::builtin_format (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3588ff0b45f9292532174fcdded8b8bdbb34f2ea4b1790bcffb6f720a3aa54a"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next (cyclomatic 27): Lexer::next has cyclomatic complexity 27 (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":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff598e12a3b3d2dde08e9d31d690f8e26602b957f42e5e05d5394f1f9265900"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::printf (cyclomatic 27): pdfcraft_js::printf 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":"engine/crates/js/src/lib.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd742c907a03dc471f9fa91b5fe2ae57c282f1473add91c88c9d244b2700631"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfdf::annot_from_xml (cyclomatic 27): pdfcraft_xfdf::annot_from_xml 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":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a6c570dbaac1327c9ea541dca9ac08f1da26dc07964f05a207cf632e4430d5"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::read_compact_xref_chain (cyclomatic 26): Document::read_compact_xref_chain 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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d934eae688f8d6be742863c3e8a7944fe1f56e1f111ccab94489ee4cf1a487e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::format_number (cyclomatic 26): pdfcraft_create::office::xlsx::format_number has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_create::office::xlsx::builtin_format (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62c9da233b6a3235d86caabbf20626741e1a6e427f87f0d27e70851c2997eaa"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::walk (cyclomatic 26): pdfcraft_forms::walk has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/lib.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0af91160ef06a6a9730a9829bfcdbbf82ab7fdef27780a3cc85e78d787a139e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::printd (cyclomatic 26): pdfcraft_js::printd 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":"engine/crates/js/src/lib.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca07a8324e115474e18b735e61942773da380ff003d9fd30f467adf6a938cc9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::scan_date (cyclomatic 26): pdfcraft_js::scan_date has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/lib.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"34699193d7773e36f71e955caaf0af04e8464e4c93ac960202a12c9d367f7a21"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::overlay::content (cyclomatic 26): pdfcraft_redact::overlay::content 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":"engine/crates/redact/src/overlay.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5466b35712b3781f6f1f0c7493d4ec3727bcfcc609a575ac726e917a6133be6c"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::data::password_dataset_wants (cyclomatic 26): pdfcraft_xfa::data::password_dataset_wants 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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc37b2ca84eed650249dce6919a1be17e04301b85dad2f987b30d764ab218b1"}},{"ruleId":"D1","level":"warning","message":{"text":"AudioExportKt.wavToM4a (cyclomatic 26): AudioExportKt.wavToM4a 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":"android/app/src/main/java/com/chethan616/clearpdf/notes/AudioExport.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb097ed7edd85be24bebec1788555576af9c15cb7dbe0e846c4e6efaea0d3a01"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::field_props_arg (cyclomatic 25): Automation::field_props_arg 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":"engine/crates/automation/src/forms.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b85c219a2bba47aeffd006372eb0bae447076df8346efdd782df89074c95a0"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_content::unfiltered_image_end (cyclomatic 25): pdfcraft_content::unfiltered_image_end has cyclomatic complexity 25 (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":"engine/crates/content/src/lib.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"138ace79cb21020816a150e3eaf595c76d1d45f1aebee357e7b81eb131c87963"}},{"ruleId":"D1","level":"warning","message":{"text":"Colours::of (cyclomatic 25): Colours::of 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":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5ecb702f318f9fc591decfb7a7b6414d50c1c8ff46f00435fdbb330790f493"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::added::draw_laid_shaped (cyclomatic 25): pdfcraft_edit::added::draw_laid_shaped 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":"engine/crates/edit/src/added.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67341798065248335a07ec1794ad96a9922c135532ea433c89e5f86e749d340"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::images::translate_images_inlined (cyclomatic 25): pdfcraft_edit::images::translate_images_inlined 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":"engine/crates/edit/src/images.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66475eb72ea8e7a5f587176354acd576054ace98e527d75d5c423b7e7cc32e6"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner::apply_effects (cyclomatic 25): Runner::apply_effects 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":"engine/crates/engine/src/xfa.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cbefbf1b47fac5c19f79778a95d2e5d8d421d968449db2bcd517dee914d128"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_engine::commands::is_enabled (cyclomatic 25): pdfcraft_engine::commands::is_enabled 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":"engine/crates/engine/src/commands.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd0c439fbadb33c4485d32c81953f6dce6e6c82266d6a204dcd729890b86da0"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::author::add_field (cyclomatic 25): pdfcraft_forms::author::add_field 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":"engine/crates/forms/src/author.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"6787cd7548d1cf8e54b8560b344591f7fb5c3815f22f746a8160355219823bad"}},{"ruleId":"D1","level":"warning","message":{"text":"Interp::node_member (cyclomatic 25): Interp::node_member 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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d8331fbd43cfed7c647cead4f1b56cd11b2b24ba832cf575f38f9cf44143a8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::interp::unlink_doomed (cyclomatic 25): pdfcraft_redact::interp::unlink_doomed 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":"engine/crates/redact/src/interp.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af63d5c749fe9f8e3c840c156a5856a98db43bd6569838161a8800baaf19cce"}},{"ruleId":"D1","level":"warning","message":{"text":"Inspector::field (cyclomatic 25): Inspector::field 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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5561a5ef0435e6f3416f7975ac817c431fcef20c97d13ed3469c40b66a4781"}},{"ruleId":"D1","level":"warning","message":{"text":"TextDevice::finish (cyclomatic 25): TextDevice::finish 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":"engine/crates/render/src/text.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f183318008787f35fc9ab1f39fa772b872a8016351a284450e054e004c96ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"TextDevice::draw_glyph (cyclomatic 25): TextDevice::draw_glyph has cyclomatic complexity 25 (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":"engine/crates/render/src/text.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7f0d144164e0fd3ee8093b286a50e0ef96a3c477ac88c85933af42993af0f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Layouter::draw_node (cyclomatic 25): Layouter::draw_node 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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7fd4931f7589a7a90be4e6163cb309989f5728864d6ece19c0d5e85d534c76"}},{"ruleId":"D1","level":"warning","message":{"text":"LiquidMorphKt.LiquidMorphSurface (cyclomatic 25): LiquidMorphKt.LiquidMorphSurface has cyclomatic complexity 25 (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8237b99a0184a8c5e1773f01594cb0727f0aea0e469dc7fab24a36f71dd30a9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_a11y::alt::content_bboxes (cyclomatic 24): pdfcraft_a11y::alt::content_bboxes has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8def789dd021893d786c65bb44ec84129f446e38f421463fedb054f4ab47761"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::fill_sign_add (cyclomatic 24): Automation::fill_sign_add has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/comments.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"7813d1f617c47c24693b55d890e158184ac0588f12c3d1e15babddac019a056e"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::doc_combine (cyclomatic 24): Automation::doc_combine 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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b838e9d01461cb0c85c1cad9e822743b6d810f23fa7ee9c4e50c455d4756998"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner::covers (cyclomatic 24): Planner::covers has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"49894c0efb4ffa7d62e64675c5fb074ecce7aca2e50bd92018140e12850bb3c3"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner::walk (cyclomatic 24): Planner::walk has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a2c1dfa6bff249b424b831d1a4959c7cc3e102426b3ab3af2092592d90f32f"}},{"ruleId":"D1","level":"warning","message":{"text":"Interp::eval_inner (cyclomatic 24): Interp::eval_inner has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad600df606f53a2f2bf003c833ecb35a93eda1d068235d0685f5daa8eccee7d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_render::text::extract_page_filtered (cyclomatic 24): pdfcraft_render::text::extract_page_filtered has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7370d45b9be6d9563d27cc69298fa135f303f6a564a41b76d3f72720e73cadd"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfdf::export_fdf (cyclomatic 24): pdfcraft_xfdf::export_fdf has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2b9de6e9ff47a0be39f140885f98772859aa379c724b40dc6e0029231e4bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"QuickPreviewKt.Preview (cyclomatic 24): QuickPreviewKt.Preview has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreview.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5349579500db022be0aa2f98c8d15a0d6f28b3271e94c0b942f22b30e5952406"}},{"ruleId":"D1","level":"warning","message":{"text":"Walk::content (cyclomatic 23): Walk::content has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/content.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c612de1f2981ae7e18d07b461027b4eeb47d1cc4060b56ded59e249820c8dce"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::read_xref_chain_materialized (cyclomatic 23): Document::read_xref_chain_materialized has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/document.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ddea2c1573923bb1a31abf087a2b33a60d662ae280713b7ede096325d0c9f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Document::reconstruct (cyclomatic 23): Document::reconstruct has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/document.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"055aa234ec82fb3963118ddc67437c896d5ceec6a0fb3524565f952ca5833a36"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::add_header_footer (cyclomatic 23): pdfcraft_edit::add_header_footer has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/lib.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7f5c2f74a712ac9890d5170b8a1ebcbe1281e80d34b1c8b78638786d64639f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::added::shaped_layout (cyclomatic 23): pdfcraft_edit::added::shaped_layout has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/added.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"5420de90fec4010add275e65921b2b5502484346aed94acde114d6d9778c3a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::text::space_rgb (cyclomatic 23): pdfcraft_edit::text::space_rgb has cyclomatic complexity 23 (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":"engine/crates/edit/src/text.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afed106e9d7cda7e950d51ec72db50d3277d5dd85016be5ea1fc7b8349dfdee"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::text::text_lines_in (cyclomatic 23): pdfcraft_edit::text::text_lines_in has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"628f2dc2bd625543d26614f767dfec5540e2a1701cfc7347626690be60615cf1"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::refresh_scoped (cyclomatic 23): Session::refresh_scoped has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_engine::add_annotation (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":4242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bebc6e5255f989eed8a089032b6ca6eb0aa4a9de45beba8176bee84b97991d1"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::detect::detect (cyclomatic 23): pdfcraft_forms::detect::detect has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/detect.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"872d2bb8b23d6041e97a6b5887a078d4fee61ab0d2681dcac16d6cd985ddde2f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::xfa::resolve_som (cyclomatic 23): pdfcraft_js::xfa::resolve_som has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/xfa.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"799784b27d5ac4d5a366fdadca6dfbd0b2afb40a8c06ef855397a3f55ef80a74"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_optimize::fragments::merge_page (cyclomatic 23): pdfcraft_optimize::fragments::merge_page has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/fragments.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cda03fab4fce82d304aa4608132d456958950236a480af5ba82fe87116fbede"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_optimize::unused::data (cyclomatic 23): pdfcraft_optimize::unused::data has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/unused.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c4eb6275064e98c533b8779ba195a83fab98023313e5d6a8b206d1d45bdea3"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::patterns::phone (cyclomatic 23): pdfcraft_redact::patterns::phone has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/patterns.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"421bc9c116c6ff693c8347197c6638f57d3297a471a7bcaac642fd0ee06b1300"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_render::text::search::find (cyclomatic 23): pdfcraft_render::text::search::find has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text/search.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbee4655014e432cdc5ebd8899d70c7feba6ac406245fc24b18d41b9a9bec9d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::pdf::validate_doc_timestamp (cyclomatic 23): pdfcraft_sign::pdf::validate_doc_timestamp has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"332c302ac9aef8253591c5bc8b494234c04ac99b4d369834b1a80aa9cd210e61"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::pdf::sign_inner (cyclomatic 23): pdfcraft_sign::pdf::sign_inner has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc32578a98e35fafe194c15c6451bed689b217b56865a878430ad05a8839fcc4"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::image::decode (cyclomatic 23): pdfcraft_xfa::image::decode has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/image.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"33183ce4ebbef8d03e31aa47c7f299e33f189cd93e91e15e9fff0e3713ab0828"}},{"ruleId":"D1","level":"warning","message":{"text":"artefact_mobile::ppt::import (cyclomatic 23): artefact_mobile::ppt::import has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/ppt.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c29481cf7cdc943d5ca63a2c90f914a3ce407e6edee4450dc3f82590a76211c"}},{"ruleId":"D1","level":"warning","message":{"text":"MainActivity.collectRequests (cyclomatic 23): MainActivity.collectRequests 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":"android/app/src/main/java/com/chethan616/clearpdf/MainActivity.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b69192c39b4e3b8cc943e262bc324b3b2b95b5decc392121b3b5638df79955"}},{"ruleId":"D1","level":"warning","message":{"text":"PhotoMarksKt.paintMarks (cyclomatic 23): PhotoMarksKt.paintMarks has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoMarks.kt"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de901a6f73662406525ad9ab927ddaf520b7edd03c7100b6061b66ad65911e5"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadingModeKt.ReadingModeContent (cyclomatic 23): ReadingModeKt.ReadingModeContent has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadingMode.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"612e2936fff8136d59d1d07ace9aded385996daddbd6c04b7c2204b93ced30a2"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_annot::links::email_at (cyclomatic 22): pdfcraft_annot::links::email_at 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":"engine/crates/annot/src/links.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6401221d133745b5a0f2152a4683f21a607f807f50a73159b900deb421b7413"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::extract::space (cyclomatic 22): pdfcraft_create::extract::space has cyclomatic complexity 22 (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":"engine/crates/create/src/extract.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c009d87137b3052238c62894ee1247453bf74cf20e1c81fd1693f1da9e04156"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::flow::layout_table (cyclomatic 22): pdfcraft_create::office::flow::layout_table has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68ff21234bbb83bea003eb51d621309c788b9738a9f4450d88c83af4fc961cc"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::text_reading::remove_all_text (cyclomatic 22): pdfcraft_edit::text_reading::remove_all_text 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":"engine/crates/edit/src/text_reading.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2cef9e39a47ab413be6afcacd11156fc654212302b90de1c1552e6f6eee697"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_engine::camera_edges::hough (cyclomatic 22): pdfcraft_engine::camera_edges::hough 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":"engine/crates/engine/src/camera_edges.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cbbf328463fa1f6e3dd04c7d388e0f9bef3ca6c553cd68a04b639057b8f9b4"}},{"ruleId":"D1","level":"warning","message":{"text":"Interp::binary (cyclomatic 22): Interp::binary has cyclomatic complexity 22 (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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f447b78f8f6a872931e5099bbd80f74eca2008fca6b21b6333f44b3405de872"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::tags::drop_object_refs_within (cyclomatic 22): pdfcraft_redact::tags::drop_object_refs_within 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":"engine/crates/redact/src/tags.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d07e5461a4718f020d3b31d1d1d15163af752bb1c880e6113a63483cf3d1571"}},{"ruleId":"D1","level":"warning","message":{"text":"Layouter::split_block (cyclomatic 22): Layouter::split_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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"015447df75fbc9ca72186e7cb417630eb91b5addea6ffd6895460a4b3900d110"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::data::rewrite (cyclomatic 22): pdfcraft_xfa::data::rewrite 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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aebdc82122f52d97f631ce7efb29a8dd701f0cead24087a0336dc39c47edd66"}},{"ruleId":"D1","level":"warning","message":{"text":"NoteEditorKt.NoteEditor (cyclomatic 22): NoteEditorKt.NoteEditor has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/NoteEditor.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c63b0388f6f0f12a7a4251b35df86f28a0cb28686ada97b206cea33f3b5621f"}},{"ruleId":"D1","level":"warning","message":{"text":"Checks::enter (cyclomatic 21): Checks::enter 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":"engine/crates/a11y/src/structure.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"334d8ff0da25948ac7fa3a74c5ef24283703d350817f6c59eb15a322b0331a3d"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::sign_document (cyclomatic 21): Automation::sign_document has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/signing.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77263d6503d70e0d20cbdaeb71cb9aeb82ae03c8d8f7456d2758045daf0c98c"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_compare::myers (cyclomatic 21): pdfcraft_compare::myers 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":"engine/crates/compare/src/lib.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d2f990bae9632926d6c28d1091c99bbc856dceff14995ac9d21981ec350c85"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::literal_string (cyclomatic 21): Lexer::literal_string has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/parser.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc9104bb2b9264786f7acccec73d9b87979494d3207cbedfad4eaae767e1c74"}},{"ruleId":"D1","level":"warning","message":{"text":"Styles::para (cyclomatic 21): Styles::para 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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e077ca2e62f3f9410348286891186a7e570136ea6cefa1f6c011f54ac07938"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::pptx::preset (cyclomatic 21): pdfcraft_create::office::pptx::preset has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a69ae13414e96d2e20979affcf97fd7e2008fd59a68ae31260efc1e7e2539a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::images::image_transform_scope (cyclomatic 21): pdfcraft_edit::images::image_transform_scope 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":"engine/crates/edit/src/images.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7052dd6daa1f985162bffc7c4b13238e1fd3f3db08a6a531b9b0734fa0079aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_engine::word_count::exclusions (cyclomatic 21): pdfcraft_engine::word_count::exclusions 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":"engine/crates/engine/src/word_count.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83ea63ff106e2ac258bfc62ac7166613077733913eaa7f0f99baff1e454903e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_fonts::pdf::unicode_map (cyclomatic 21): pdfcraft_fonts::pdf::unicode_map has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"984dd5973acffbe53360a0765b9674b74e0a39b6776e0eed10881daf3332cbd5"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::button_action (cyclomatic 21): pdfcraft_forms::button_action has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"385a52ec0566b57d9545c9d6b32045678084242e63bfb37d178616806eb0e522"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::af::order (cyclomatic 21): pdfcraft_forms::af::order 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":"engine/crates/forms/src/af.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b5c36c5d0889587cf58742007f046aa7102ebca7983fc497f38c03eb552641"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::refuse (cyclomatic 21): pdfcraft_js::refuse has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/lib.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eb69c9ead49b623f90dc9555453a5486816cf7781100cceb93a004d34a821a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_optimize::images::process (cyclomatic 21): pdfcraft_optimize::images::process has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/images.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a859cb9c80ed0cfb988af7ec7578825c12aea6b78c9fd53b399aa90b8c32ed68"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_optimize::unused::remove_unused (cyclomatic 21): pdfcraft_optimize::unused::remove_unused 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":"engine/crates/optimize/src/unused.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c6b9e43d0effbf7c9d5c7badcd070b737367c85693010a443421270a8b2ff1"}},{"ruleId":"D1","level":"warning","message":{"text":"Scope::layer_hidden (cyclomatic 21): Scope::layer_hidden 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":"engine/crates/redact/src/interp.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c546c6d4fc1e0fb2000abcff5e553e3237c4db6034137424c2e67a0a8e2edc9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::data::merge_values (cyclomatic 21): pdfcraft_xfa::data::merge_values 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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff40446785859f9678865ec0388e02b9ab1b852fcc0b0e1fa3e39cd50fa47f06"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::parse::parse_field (cyclomatic 21): pdfcraft_xfa::parse::parse_field has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/parse.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b4f3b166cf20ef5aa80a0b748a76509351a682dd46586811907714835ee9d1"}},{"ruleId":"D1","level":"warning","message":{"text":"Thumbnails.ofContent (cyclomatic 21): Thumbnails.ofContent has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/engine/LocalFiles.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"785c283a006dd10ea1e1b34579077eed090c0c9d00d13fb60d8e5611356c3c26"}},{"ruleId":"D1","level":"warning","message":{"text":"AppViewModel.viewerKey (cyclomatic 21): AppViewModel.viewerKey has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca59a3c9234f16ae2cd26ddf67184c30caa5ba3bcd5081cd3f044733fe59598"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolScreensKt.ProtectScreen (cyclomatic 21): ToolScreensKt.ProtectScreen has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0b2d5f999b266d99bcd99e1df73aad843c475d704d66d0e761ccb17304b3de"}},{"ruleId":"D1","level":"warning","message":{"text":"ButtonsKt.glassControl (cyclomatic 21): ButtonsKt.glassControl has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Buttons.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd3afb8b0f6cd9ace69eeba57c92b89ac2c58aa71dd14af207c921c1c9e536d"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentListKt.CommentRow (cyclomatic 21): CommentListKt.CommentRow has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentList.kt"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ce8b1aa79ef055e28aeca920e36e5bd0461349b1e25dec0e8dc914191a006a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_annot::set_style (cyclomatic 20): pdfcraft_annot::set_style has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_annot::subject (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da7ad7124782fe89328ed637eb333dbfa4020f9ffe178015f4c9fa558c9398e"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::object_depth (cyclomatic 20): Lexer::object_depth has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/parser.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9249f7e6e3bd5c9fa415f66a85916eb853e0c23bb76072cb447744d414d201"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::shape_inner (cyclomatic 20): Renderer::shape_inner has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"8366c3968cd4cdb39a69ceb217e09b24e433d5ac0f9a1ab23b839804656774e6"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::docx::parse_rpr (cyclomatic 20): pdfcraft_create::office::docx::parse_rpr has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"acea002820ce3d2805dcf0ad064e4a7b1d9f85608fbc768c9115412c03d2d4bb"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::objects::added_geometry (cyclomatic 20): pdfcraft_edit::objects::added_geometry has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/objects.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f8d6ee8905414b89837ebb0f2a97b56ddfe5fa6bb95f7968f4caa76a262834"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_export::docx (cyclomatic 20): pdfcraft_export::docx has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/lib.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d9d5813b582dd23019972480b1897a6af2e16529adc174bc5e497ec7992119"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_export::rtf (cyclomatic 20): pdfcraft_export::rtf has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/lib.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe68b557bb2c7f3a5b15cc2b49c88ddf4f997b76f624825059a453e6f2649705"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_fonts::embedding::embed_mapping (cyclomatic 20): pdfcraft_fonts::embedding::embed_mapping has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/embedding.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c826ca0faa51b9fab01ba431ae63e6741bcbcd3bd006bba68855e93711414b"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_fonts::pdf::parse_to_unicode_within (cyclomatic 20): pdfcraft_fonts::pdf::parse_to_unicode_within has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a3a2f2e624d34836a1bbb1d0dbbd923f2dfa6fcefdf1846f7a42b0810899d5"}},{"ruleId":"D1","level":"warning","message":{"text":"DetectionPath::rectangle (cyclomatic 20): DetectionPath::rectangle has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/detect.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0a8168bf1e558dfc8342c21035af1914f965c5ebc7ebc9d1e4b1e85b5702d3"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::scripting::apply_changes (cyclomatic 20): pdfcraft_forms::scripting::apply_changes has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/scripting.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c937f8b0f4a14a766fe0b0b69561dd0772277d3ebeacc7c5583c74e923958b13"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::scan_parts (cyclomatic 20): pdfcraft_js::scan_parts has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/lib.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd1737757de3177f8b825364282fbd4e17c643a8e5ed4d78197ef90fdf4e8a6"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::printx (cyclomatic 20): pdfcraft_js::printx has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/lib.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5c55312f9a6654c1ab1daa31993c0ad3867f4772f51c5bf31b859b0f1c5524"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::formcalc::parse_date (cyclomatic 20): pdfcraft_js::formcalc::parse_date has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e7674a0e34de94a8c3e4d37a46ba0f5a7dbc80c85c5987dcdf7c5230a232b3"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_organize::labels::read_label_node (cyclomatic 20): pdfcraft_organize::labels::read_label_node has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/labels.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4db8543c1f64590f7f1dc9379609373d60250bde0756d4f66a788285c4e9d96"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_preflight::xmp::xml_limits_ok (cyclomatic 20): pdfcraft_preflight::xmp::xml_limits_ok has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/preflight/src/xmp.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bc66b4b10bd56b07116408b3921777424cd51e7bb4e43e063021fd890430d1"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::image::decode_and_clear (cyclomatic 20): pdfcraft_redact::image::decode_and_clear has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/image.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f53faba571405bdb1cccfa1429ffd970def7435a371085d473ee0940324061"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::sanitize::content_pass (cyclomatic 20): pdfcraft_redact::sanitize::content_pass has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/sanitize.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e2b6ca0f86be6f51ebe4595fbffb89f1575e17dcae8aef0d704a16cc605739"}},{"ruleId":"D1","level":"warning","message":{"text":"OcspResponse::parse (cyclomatic 20): OcspResponse::parse has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/revocation.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa47f69a1a312e414f420b7c55e1c495ef2e3e3f03d1e3b96c848902cbba20fc"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::script::apply_overrides::walk (cyclomatic 20): pdfcraft_xfa::script::apply_overrides::walk has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/script.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37daaba5193173c348769d917388871a7a930e611684acfa0c4cd4539dac026"}},{"ruleId":"D1","level":"warning","message":{"text":"AppViewModel.enterTool (cyclomatic 20): AppViewModel.enterTool has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"7256d206c78adcdb2cbf7c7bcd71d8338de0470865b51d51cc41d4ee5319ee1e"}},{"ruleId":"D1","level":"warning","message":{"text":"HomeScreenKt.HomeScreen (cyclomatic 20): HomeScreenKt.HomeScreen has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/home/HomeScreen.kt"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"45719326c9b0c1efcea1f7dbb4032c60020095c40dd187e02c834068e5fdc7e0"}},{"ruleId":"D1","level":"warning","message":{"text":"MascotFaceKt.drawFace (cyclomatic 20): MascotFaceKt.drawFace has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/mascot/MascotFace.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b638fb5cb478cddb4871f38774e00592c7aa5f846ef82f1be923b67450adfcf"}},{"ruleId":"D1","level":"warning","message":{"text":"SheetViewerKt.panZoomFling (cyclomatic 20): SheetViewerKt.panZoomFling has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"837a07296f0b1dc5a452a7f44381b30d7b18b48af94ff0446ebbda21e1182460"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_a11y::check (cyclomatic 19): pdfcraft_a11y::check has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Rule::info (cyclomatic 32) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/lib.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"7145974951bb5f8882a1c059f7e88a41d454d6e0f4a7adfbb9563848c62e8886"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_a11y::autotag_fields::tag_form_fields (cyclomatic 19): pdfcraft_a11y::autotag_fields::tag_form_fields 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":"engine/crates/a11y/src/autotag_fields.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8dcf5ac21f79b0ea04f5bbed247b92f04ad1432fd2b9e0b225ea7ef6c3920f6"}},{"ruleId":"D1","level":"warning","message":{"text":"McpServer::dispatch (cyclomatic 19): McpServer::dispatch has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/mcp.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f3fd5a8595313a13ef82f6917be0c1592a0d4987466d2e9527384a14c1b6e8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::pptx::render_slide (cyclomatic 19): pdfcraft_create::office::pptx::render_slide has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"f208d7440e12b80226d37fc08d3741537a4fef0eb934e2a501699014273f87f6"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::office::xml::nests_deeper_than (cyclomatic 19): pdfcraft_create::office::xml::nests_deeper_than 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":"engine/crates/create/src/office/xml.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a04c6dd3a45a7aa343e237110ad93c648c2a7664d3b328a9559947fbce8c7cb"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::text::fonts_shown (cyclomatic 19): pdfcraft_edit::text::fonts_shown 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":"engine/crates/edit/src/text.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e9de320085e1c42f9bbd8c3fd0b368bbbcab1037f92b8fce57e708e23ee635"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::text::translate_blocks_inlined (cyclomatic 19): pdfcraft_edit::text::translate_blocks_inlined 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":"engine/crates/edit/src/text.rs"},"region":{"startLine":3598}}}],"partialFingerprints":{"codehealthFindingId/v1":"c652174043b6e8ff49f9cb927fb993b073c76db5033ba417bfb7b23f09578e5b"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::af::calculation_sites (cyclomatic 19): pdfcraft_forms::af::calculation_sites 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":"engine/crates/forms/src/af.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47cf757438e0653d0637e623a5b26e43d758851153fa63d238256acb0a20128"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::detect::raster::writing_area (cyclomatic 19): pdfcraft_forms::detect::raster::writing_area 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":"engine/crates/forms/src/detect/raster.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f14889038c2aa4dfad35789a7025f3c7c4cc8fd3d336e383841b80b1b959efd"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_render::text::collide (cyclomatic 19): pdfcraft_render::text::collide 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":"engine/crates/render/src/text.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5d2b7005405b2e40600af4b6ac9f4c279229d12f201bc05fffcae7aaa6a256"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::pdf::signed_page_resources (cyclomatic 19): pdfcraft_sign::pdf::signed_page_resources has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (reach, resources). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"4912a8874147abf198a7b7cb773fa6e4d6efcb4811c7d8ea8d2af24f012bcfdc"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::pkcs12::pbe_decrypt (cyclomatic 19): pdfcraft_sign::pkcs12::pbe_decrypt has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pkcs12.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a189b1ed4521b15ca2eed27c938e25f25fed33c4ceaf98926e594185bfe9f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Emitter::page (cyclomatic 19): Emitter::page 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":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bacea5868000bebb7c51fd1ad261be0c5d40ef97f0da3711c865220a8c6384d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::packets::read_packets (cyclomatic 19): pdfcraft_xfa::packets::read_packets 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":"engine/crates/xfa/src/packets.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54561bfaebb5fb15a7bf4922faa3587dcadca5ea0b8cdcf66204dcd33563741"}},{"ruleId":"D1","level":"warning","message":{"text":"artefact_mobile::ppt::read_group (cyclomatic 19): artefact_mobile::ppt::read_group 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":"engine/mobile/src/ppt.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"224b43ce9debad2cafc1ca44df9b06b82624b37bc2c5eab32219fdf4c3f0aaa9"}},{"ruleId":"D1","level":"warning","message":{"text":"Haptics.fallback (cyclomatic 19): Haptics.fallback 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Haptics.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1b8693373627d364f08f3d83a539e8e6e1b0b6a713eaa1c45766b8ce2c1025"}},{"ruleId":"D1","level":"warning","message":{"text":"MorphButtonKt.RectMorphSurface (cyclomatic 19): MorphButtonKt.RectMorphSurface has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/MorphButton.kt"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2599a9c156362fa0cc29c2ed8fd47822081a0c1cb5f8976d1aed1965a95ba41"}},{"ruleId":"D1","level":"warning","message":{"text":"MascotFaceKt.drawEye (cyclomatic 19): MascotFaceKt.drawEye has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/mascot/MascotFace.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9707b21d636513e2121ec2aab6328157e6668b168f036ceffd037aa97fb81fc6"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentListKt.commentActionLabel (cyclomatic 19): CommentListKt.commentActionLabel has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentList.kt"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0818f2ace250c6b478603ad6372e874569377474455b52a4651c4ccf057f1d17"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_annot::summaries (cyclomatic 18): pdfcraft_annot::summaries has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_annot::subject (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0a36ddeecc48c4f48b87026694f6fc8c2382fc76e55361ba62cd6b8afe7804"}},{"ruleId":"D1","level":"warning","message":{"text":"Ops::next (cyclomatic 18): Ops::next 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":"engine/crates/content/src/lib.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c4b9ca97d8bc5500c8640f65965adec814e6823d28eb9019d223d059654bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_create::tiff_pages_within (cyclomatic 18): pdfcraft_create::tiff_pages_within has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/lib.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d5753473f0b689023480c4945a072822746f769411c45ffaa3f8ac5d7d9b09"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner::inline (cyclomatic 18): Planner::inline has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"412cd872bfdc3932941e0bf06943e1cfcb5c357603c94c3b9569fcbaa77a546c"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::added::validate (cyclomatic 18): pdfcraft_edit::added::validate 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":"engine/crates/edit/src/added.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc0baecba6245db863b3a47c9d0b3720baa14bb26133ac7b96960e3e0926e39"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::images::page_images_in (cyclomatic 18): pdfcraft_edit::images::page_images_in 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":"engine/crates/edit/src/images.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bd55df094d60cf573dc9852fe7840ac8abd0a2552ca3d0a0c5ab3b8f04ce2f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_engine::signature_scan::box_blur (cyclomatic 18): pdfcraft_engine::signature_scan::box_blur 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":"engine/crates/engine/src/signature_scan.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78b10168c662f22944237a3c6d608644719c65ac0ae96337344677f40bf1bd9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_export::xlsx::plain_number (cyclomatic 18): pdfcraft_export::xlsx::plain_number has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/xlsx.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98a0b6e08212c50c5e1002a7f409d0ba2f8f475e886f4ab4ab00fd0d74f0e12"}},{"ruleId":"D1","level":"warning","message":{"text":"FieldTable::cells (cyclomatic 18): FieldTable::cells 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":"engine/crates/forms/src/table.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e5f6e602b8634990099a5671caaae8d352a712f7176525810b46b17ddf7445"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::with_field_appearances_cached (cyclomatic 18): pdfcraft_forms::with_field_appearances_cached has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/lib.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0a754c964bd7a0490723fed30045f32da8e1de40c5a101291c5003bc288901"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::detect::raster::enclosed (cyclomatic 18): pdfcraft_forms::detect::raster::enclosed 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":"engine/crates/forms/src/detect/raster.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f2958d8e9fa5a1fe2b14188d5f7afb4b0fd35a819aa8682635ee2800bfb62b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::postfix (cyclomatic 18): Parser::postfix 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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f8160c7be51a9e5d4e83b91488902f62e3eb85cf857a8bccecec9b6e6d6175"}},{"ruleId":"D1","level":"warning","message":{"text":"Interp::assign_to (cyclomatic 18): Interp::assign_to 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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"3864e3fd13eb38a799270731199973340ceed3569cfd100df1f7a9bfbe2fcf29"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::formcalc::format_date (cyclomatic 18): pdfcraft_js::formcalc::format_date 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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc840e9696afe28be8f0d9ecd5c8547eee8db63f2c1b397407d7336193b33b6b"}},{"ruleId":"D1","level":"warning","message":{"text":"PageTree::next (cyclomatic 18): PageTree::next 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":"engine/crates/model/src/lib.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f85cd9ca873865275b531c87ec8ba10e72c4582b20ebe663ab79100b9aecc3"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_print::spool::localize (cyclomatic 18): pdfcraft_print::spool::localize 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":"engine/crates/print/src/spool.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2dc56d3c296d08a65993f39db68c94c0377dfeee6ef2afc08803142d656303"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_render::inspect::inspect (cyclomatic 18): pdfcraft_render::inspect::inspect 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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"67d8ef93c49e2c325ba23ee7c626b221dda67d5c9a6063765b759b80f35e4e3b"}},{"ruleId":"D1","level":"warning","message":{"text":"artefact_mobile::ppt::text_look (cyclomatic 18): artefact_mobile::ppt::text_look 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":"engine/mobile/src/ppt.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"39292ffec9a608ea1a53ad3839a6fa2073086ebf31db6771588ef83a1c29b34c"}},{"ruleId":"D1","level":"warning","message":{"text":"DigitalSignKt.SignatureDetails (cyclomatic 18): DigitalSignKt.SignatureDetails 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DigitalSign.kt"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"359f5b2824420397291431f327f41da3e5933e0d819739010d13621a95ed1376"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerBarsKt.ViewerTopBar (cyclomatic 18): ViewerBarsKt.ViewerTopBar 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerBars.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd06837e347742afb6c80a0a94acac3087792308f0370c968971cda7a2142fd9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_a11y::content::document_rule (cyclomatic 17): pdfcraft_a11y::content::document_rule 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":"engine/crates/a11y/src/content.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"36845fe18e78c9fa365b1acb05aace2925b378657bce3cc8c9e0a6fe2e5f068c"}},{"ruleId":"D1","level":"warning","message":{"text":"Discovery::walk (cyclomatic 17): Discovery::walk 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":"engine/crates/automation/src/batch.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea17ba12df33c04a8b732df9f7d60dca347f15b48bbe5b874a9086f65641defc"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::form_set_props (cyclomatic 17): Automation::form_set_props 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":"engine/crates/automation/src/forms.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa8061575fbb644b074feb49b3a3d028508cbd81c54943a76942e9b8663215f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_compare::visual_regions (cyclomatic 17): pdfcraft_compare::visual_regions 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":"engine/crates/compare/src/lib.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b63a76e0a6345c723a546ce4b00b5c41ac688dd960b1648c515586ed7331799"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_cos::parser::parse_indirect_in (cyclomatic 17): pdfcraft_cos::parser::parse_indirect_in has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/parser.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a435aa76bcd53a6ce426a5601991573da82d099666261e6fb676f9c6ace4a3d3"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::added::draw (cyclomatic 17): pdfcraft_edit::added::draw 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":"engine/crates/edit/src/added.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f443c76c551f924bfc0a85d9529229a128b6f028eedae52af1f02857276ebff"}},{"ruleId":"D1","level":"warning","message":{"text":"Runner::set_value (cyclomatic 17): Runner::set_value 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":"engine/crates/engine/src/xfa.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f652ae97c2b676b4d2ae56e32ed6af0e2622f855b0209909930bec905e7274"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_engine::comment_summary (cyclomatic 17): pdfcraft_engine::comment_summary has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_engine::add_annotation (cyclomatic 26) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":5563}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e0e01c9f7464a9cd30a8dcb4fdd689d5bdec43a53de4e82fdecf355c5e3f2e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_fonts::pdf::embedded_sfnt_within (cyclomatic 17): pdfcraft_fonts::pdf::embedded_sfnt_within 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":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a643c0444f04476edfddad26f269469b6a2dbaa8e82133ba749fa778faedc46"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::rank_tabs (cyclomatic 17): pdfcraft_forms::rank_tabs 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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad26def7016475b0e115c5d28e6e17ba58c108181f73385364be562c8a83ea76"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_optimize::audit::audit_space (cyclomatic 17): pdfcraft_optimize::audit::audit_space has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/audit.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f51159267bb46bef1137489e1589297ea9422e8df2ad78de5846df08587394"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_organize::dedupe::dedupe_resources (cyclomatic 17): pdfcraft_organize::dedupe::dedupe_resources 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":"engine/crates/organize/src/dedupe.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb399ea2972d902522fb8bd5741c0b352de1985d1466fe62b8ed4b51cf2fa9d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::interp::show (cyclomatic 17): pdfcraft_redact::interp::show 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":"engine/crates/redact/src/interp.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ea9b87a001978d05788cd9fa43a777ea8bf3b37b5a64ca4a43cd1960e77f1c"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_render::raster::render_page (cyclomatic 17): pdfcraft_render::raster::render_page has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/raster.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01eafdb0b0b0fc877b6b85f958dccf53f740790681e39b65f8e3db0ec12e3d8"}},{"ruleId":"D1","level":"warning","message":{"text":"PublicKey::verify_scheme (cyclomatic 17): PublicKey::verify_scheme 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":"engine/crates/sign/src/keys.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ce13ff4bec13f49a0dde856e42ebc9bbac57f5f84d46cc950e381bf0bf67e6"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::cms::parse_signer (cyclomatic 17): pdfcraft_sign::cms::parse_signer 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":"engine/crates/sign/src/cms.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b61be774456da31641300246717dd8894acdad2b2b33ee73cba3509af6bc0de"}},{"ruleId":"D1","level":"warning","message":{"text":"Layouter::flow_subform (cyclomatic 17): Layouter::flow_subform 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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"3585c4f8e01272e74e5744b5e003d83f129926dc333d8840cb0856440ccf6163"}},{"ruleId":"D1","level":"warning","message":{"text":"Layouter::measure (cyclomatic 17): Layouter::measure has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f09ac249689c4a14408042c7703d7941011a05726acce8908b93ee0d48d6ef2"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::data::pattern_to_iso (cyclomatic 17): pdfcraft_xfa::data::pattern_to_iso 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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce2d0fca5315631656fc8b8001fc53e5fdd100a7c2a2e5139c217d8dc7c234c"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::parse::apply_saved_state (cyclomatic 17): pdfcraft_xfa::parse::apply_saved_state 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":"engine/crates/xfa/src/parse.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b1e0f4787bd897100b10dcf49ca7ab9e810a989aaf82e51dc6559f59a485af"}},{"ruleId":"D1","level":"warning","message":{"text":"OverlaysKt.GlassDialog (cyclomatic 17): OverlaysKt.GlassDialog 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Overlays.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"569fed1278155b6255efe4b5ea950d0aa628bd3cadca8b8eb2777b793dbe2f8b"}},{"ruleId":"D1","level":"warning","message":{"text":"EditKt.InlineEditor (cyclomatic 17): EditKt.InlineEditor 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edf348d39bd2c7d404ef4a749874dafc53c06557d6b5ae9e6d426a9a8e1d146"}},{"ruleId":"D1","level":"warning","message":{"text":"FormsKt.FieldEditor (cyclomatic 17): FormsKt.FieldEditor 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Forms.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"056d43f7d81ab9a73d354407144415585464c899fae27846f1d6e1758a4e0870"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_annot::erase_ink (cyclomatic 16): pdfcraft_annot::erase_ink has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_annot::subject (cyclomatic 27) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1498fe76b6410d789b05131284e11a1292cacb31339c7b408e36f9a517f2a0"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_annot::appearance::rich_plain (cyclomatic 16): pdfcraft_annot::appearance::rich_plain has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd8f808eb37558d38c6ededef33ede8fa1d4dd294f38ac80ac7f846d410eb28"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_annot::appearance::line_layout (cyclomatic 16): pdfcraft_annot::appearance::line_layout has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa94b6762d8d15a8b32337a1ba9ef25c85facdb8d06752a2b8f98b98b9bba60d"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::doc_batch (cyclomatic 16): Automation::doc_batch 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":"engine/crates/automation/src/batch.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa255b02aab90b62756b44a209842bd422e5f00380a0e8d95a4f7232c7539e0"}},{"ruleId":"D1","level":"warning","message":{"text":"Automation::marks (cyclomatic 16): Automation::marks has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f388a3f89b549a23bd64f5637f6cceb5aadb43415cd8afe16ed7b68b9b9b579e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_automation::content::style (cyclomatic 16): pdfcraft_automation::content::style has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/content.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"890b3439ff7733c8c8f75f2b838f26c2520e73ab318c48fa54a94f0bc3af91e9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_cos::security::walk (cyclomatic 16): pdfcraft_cos::security::walk has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/security.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d063406c217a3b7d8a67543caff9047ee98a50b06f887728edd9439b05cade40"}},{"ruleId":"D1","level":"warning","message":{"text":"ParaProps::merge (cyclomatic 16): ParaProps::merge has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_create::office::docx::highlight_colour (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"198f69a08b109ac52a192f31fb297307e8b5cd7329780d10196fc55d546e894b"}},{"ruleId":"D1","level":"warning","message":{"text":"Converter::paragraph (cyclomatic 16): Converter::paragraph has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_create::office::docx::highlight_colour (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbca00c24c7a08c098163ab5513468952ecf465ca238f801ae7605536272579c"}},{"ruleId":"D1","level":"warning","message":{"text":"Planner::merge (cyclomatic 16): Planner::merge 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":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e546bb012b1657b38511dbc9eaee02e959c006b764ed5438643452889fff19a8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_edit::images::crop_image (cyclomatic 16): pdfcraft_edit::images::crop_image has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/images.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b8a448162ef25dc3bf49dc039b39fd495dd59f24c4d8bb9942b7312b222e1a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_engine::camera_clean::background (cyclomatic 16): pdfcraft_engine::camera_clean::background has cyclomatic complexity 16 (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":"engine/crates/engine/src/camera_clean.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a5e0fc56de244758222fa70b240cacf21ae2d6eaf35be1f2dc5f7a150a7075"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_engine::dates::format_day (cyclomatic 16): pdfcraft_engine::dates::format_day has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/dates.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd06f6b6505788d466d3b1247bdcaddfa720b9867396c479102122bbaafb984c"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_engine::scan_colours::sample (cyclomatic 16): pdfcraft_engine::scan_colours::sample has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/scan_colours.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc546fb828bb1b7028fad988c65c9cbd36a045362b2e0b1dfbdfa1dc4bd7bb10"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_engine::text_fonts::discover (cyclomatic 16): pdfcraft_engine::text_fonts::discover 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":"engine/crates/engine/src/text_fonts.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5fecfd41f4e95ce399f0b11f3a295df74ddc9cf010422f64e6349caa32a080"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::string (cyclomatic 16): Parser::string has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/af.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c0894c71dfa1866e16b3b3cff5ec9dff3be1f819f0602ddcc386b54e52b074"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::actions_of (cyclomatic 16): pdfcraft_forms::actions_of has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/lib.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc90df53cefef1a584f73618df42e1fe493a5bd58d3c5dda3e8f00d3eeb0077"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_forms::author::patch_widget_look (cyclomatic 16): pdfcraft_forms::author::patch_widget_look 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":"engine/crates/forms/src/author.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b398e7e6610902bc2b60422e02b4109eef9513a20e7fef0f08af36eb3c37dda7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_js::formcalc::parse_num (cyclomatic 16): pdfcraft_js::formcalc::parse_num 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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"5452c33ba29d8bee116bdef3438de74f2cf63261e8f39c1145168a441d3cdd9a"}},{"ruleId":"D1","level":"warning","message":{"text":"Geometry::snap (cyclomatic 16): Geometry::snap has cyclomatic complexity 16 (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":"engine/crates/measure/src/snap.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ee371c6c8846934a434a274dde41882b0f5d55aa5d2db1fd2a7f5d6331a4f9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_optimize::lzw_to_flate (cyclomatic 16): pdfcraft_optimize::lzw_to_flate has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/lib.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3446a518cb00ecedbd051bc431a21e85199717e3c131bad6494ef6090e8d1ec8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_organize::boxes::set_page_box (cyclomatic 16): pdfcraft_organize::boxes::set_page_box 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":"engine/crates/organize/src/boxes.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"10296f169bae02d70f17b10dc9230e5222e2dfc2859d5420dbbd51bd4b42a231"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_organize::prune::filter_at (cyclomatic 16): pdfcraft_organize::prune::filter_at has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/prune.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c23a381bb54a0e282946c014a62cdfa22f3312b82e69d0502d306ab144ca6d7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_print::page_form (cyclomatic 16): pdfcraft_print::page_form has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: pdfcraft_print::cups_media (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/print/src/lib.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57927a2035ee0012a3a2f3fa900ce493267388c37d08bb7fcea8da379e8df53"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_redact::localize_resources (cyclomatic 16): pdfcraft_redact::localize_resources 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":"engine/crates/redact/src/lib.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b4c022234e68b08a8e18698f2153dbd492295571a7a51c6f847fde6cdebfb1"}},{"ruleId":"D1","level":"warning","message":{"text":"PageText::column_text (cyclomatic 16): PageText::column_text 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":"engine/crates/render/src/text.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54132ae689616f2d9cbd60ea97f13bd632d3c6fab1855db3b816588c7d8d578"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_sign::pdf::check_dss_revocation (cyclomatic 16): pdfcraft_sign::pdf::check_dss_revocation has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0064233fc1f64003c5265e07477040ecc66e75c2b43b5d556860c5cc7fc945"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::xml_nesting_depth (cyclomatic 16): pdfcraft_xfa::xml_nesting_depth 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":"engine/crates/xfa/src/lib.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8735e761d1acd6d4479a1494c8b8c1b2abc3b474f3cec2e75f72279746bff1"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::data::iso_to_pattern (cyclomatic 16): pdfcraft_xfa::data::iso_to_pattern has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/data.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ff853c78611b40f661d6edbf1a3af5cefd15e3b64272808f0f2f52cbdb0cdb"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::parse::parse_rich::walk (cyclomatic 16): pdfcraft_xfa::parse::parse_rich::walk 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":"engine/crates/xfa/src/parse.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"095008fd81850d7bd0ec963b9f654d3874f1209ae73ebd26042757712ba2a349"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::script::rerender (cyclomatic 16): pdfcraft_xfa::script::rerender 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":"engine/crates/xfa/src/script.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a330b8c742e3554e02c9324b122d76ff7aed70cc879d8ae0cd263a605173991"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfa::script::refresh_value (cyclomatic 16): pdfcraft_xfa::script::refresh_value has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (walk). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/script.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9332f792e68e4ee77144b9c1667b04b6110293dd8fc1d77c433f2ae0b860b38"}},{"ruleId":"D1","level":"warning","message":{"text":"pdfcraft_xfdf::xml_nesting_depth (cyclomatic 16): pdfcraft_xfdf::xml_nesting_depth 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":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e197eac93b970cac4282e43c431c4ff9a552653290d900e2caeb35e12964f2"}},{"ruleId":"D1","level":"warning","message":{"text":"artefact_mobile::reading_blocks (cyclomatic 16): artefact_mobile::reading_blocks 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":"engine/mobile/src/lib.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc187f996cb0ff636726f21eca62ca080b8d331045ceda788e3b05f8586de958"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsScreenKt.WallpaperPicker (cyclomatic 16): SettingsScreenKt.WallpaperPicker has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"5365c276efdeb8198fc3970d85af72cb748a4dff1ba0a25382a6bc412f1f9a40"}},{"ruleId":"D1","level":"warning","message":{"text":"GlassLuminance.run (cyclomatic 16): GlassLuminance.run 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/AdaptiveGlass.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"2135a8242f41b82dfba2fae4666b7662f0d8b78abb06760903743cb606f8e2bc"}},{"ruleId":"D1","level":"warning","message":{"text":"TabsKt.GlassTabs (cyclomatic 16): TabsKt.GlassTabs has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Tabs.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc25322156ebfe90cc7991fda93dd2b644f504e968629575e9d4c2cef0983052"}},{"ruleId":"D1","level":"warning","message":{"text":"CommentListKt.CommentListScreen (cyclomatic 16): CommentListKt.CommentListScreen has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentList.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9511eb9ec8714ccd676055115c18e561425c026072d0f443f3ff9f0bbe863ffb"}},{"ruleId":"D1","level":"warning","message":{"text":"ReadAloud.skip (cyclomatic 16): ReadAloud.skip 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadAloud.kt"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cacbac388dc3976e2236c26f762aaed9248c1e94ed522e9a5d977e10e3a2d6"}},{"ruleId":"D1","level":"warning","message":{"text":"ShapeSnap.recognise (cyclomatic 16): ShapeSnap.recognise 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ShapeSnap.kt"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02b076fb320bf500594727618f271361c59cd4ba2948b5ac78e86121e6806eb"}},{"ruleId":"D1","level":"warning","message":{"text":"VoiceSheetKt.VoiceSheet (cyclomatic 16): VoiceSheetKt.VoiceSheet has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/VoiceSheet.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"694069ce088415ad8c24b75d5a8febeb07e5c6868fe05561c00b3b2fccd75a63"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::draw_sheet (cognitive 342): pdfcraft_create::office::xlsx::draw_sheet has cognitive complexity 342 (threshold 15). Drivers by points: if/else 62 (219 pts), loops 25 (79 pts), match/switch 8 (24 pts), boolean chains 20 (nesting depth added 227). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6175bcd2df782c96b9a4fb0a5005445fed92e513b948ebf5f8657fac20feb3"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text_regions::rewrite_styled_block (cognitive 305): pdfcraft_edit::text_regions::rewrite_styled_block has cognitive complexity 305 (threshold 15). Drivers by points: if/else 95 (219 pts), loops 30 (52 pts), boolean chains 30, match/switch 3 (4 pts) (nesting depth added 147). 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":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1d9d9baf5a53810a11cfb591421bedc01ac8b178872ad90ef4b7f63ca26dd4"}},{"ruleId":"D2","level":"warning","message":{"text":"PhotoEditorKt.PhotoEditScreen (cognitive 275): PhotoEditorKt.PhotoEditScreen has cognitive complexity 275 (threshold 15). Drivers by points: if/else 114 (207 pts), boolean chains 36, loops 7 (17 pts), match/switch 8 (15 pts) (nesting depth added 110). To reduce it, split the body into named stages: move each independent step or branch into 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/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dc66264fe4f28d3ad075a1865ff537e77ae65a738dc4ac6b9f8619fb5ea252"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::appearance::build (cognitive 235): pdfcraft_annot::appearance::build has cognitive complexity 235 (threshold 15). Drivers by points: if/else 74 (162 pts), loops 11 (29 pts), boolean chains 22, match/switch 10 (22 pts) (nesting depth added 118). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d0eff48ade927ad6154cebdd449ffd20c14b2ba44d979a7da547b7d1cf8f70"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::interpret (cognitive 213): pdfcraft_edit::text::interpret has cognitive complexity 213 (threshold 15). Drivers by points: if/else 40 (149 pts), match/switch 10 (43 pts), loops 4 (14 pts), boolean chains 7 (nesting depth added 152). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0255b11e18260111e38fd9f04f65e70be015b901216956fb9b42931fd0cd7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Interp::builtin_inner (cognitive 202): Interp::builtin_inner has cognitive complexity 202 (threshold 15). Drivers by points: if/else 82 (149 pts), boolean chains 21, match/switch 9 (18 pts), loops 6 (14 pts) (nesting depth added 84). 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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":2099}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f907f6f06d65df74450b958a0cff803e1b044637c0c1a069c35d69ed8c7e762"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetViewerKt.drawSheet (cognitive 182): SheetViewerKt.drawSheet has cognitive complexity 182 (threshold 15). Drivers by points: if/else 75 (118 pts), loops 15 (29 pts), boolean chains 24, match/switch 6 (11 pts) (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into 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/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff75737b1ec2b933ed1f40c1e98fbb6328b60cf34b1d8f011b9754b335f513ba"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::author::set_props (cognitive 176): pdfcraft_forms::author::set_props has cognitive complexity 176 (threshold 15). Drivers by points: if/else 75 (130 pts), boolean chains 19, match/switch 8 (16 pts), loops 6 (11 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/author.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeaa46d969147eb3a822a45cfbbd279bc9c71ae6729947facea832089689a73"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::interp::process_from (cognitive 161): pdfcraft_redact::interp::process_from has cognitive complexity 161 (threshold 15). Drivers by points: if/else 37 (121 pts), match/switch 6 (25 pts), loops 6 (12 pts), boolean chains 3 (nesting depth added 109). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfefee21f013333869247e1ce32d631b634f7bc7adb63d62caacb9cb9d85c0da"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerScreenKt.ViewerScreen (cognitive 160): ViewerScreenKt.ViewerScreen has cognitive complexity 160 (threshold 15). Drivers by points: if/else 95 (129 pts), boolean chains 27, match/switch 3 (4 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerScreen.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fee5b0af64d5e5ef48d196ab74f82de549ba90bee1511d1bc30aacf3fa9e440"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_print::layout (cognitive 156): pdfcraft_print::layout has cognitive complexity 156 (threshold 15). Drivers by points: if/else 33 (93 pts), loops 13 (41 pts), boolean chains 11, match/switch 4 (11 pts) (nesting depth added 95). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/print/src/lib.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"febde30691fa2f651468a6a3b1af8bf94d2688751eba22cb9267a648d2870ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_render::raster::worker (cognitive 145): pdfcraft_render::raster::worker has cognitive complexity 145 (threshold 15). Drivers by points: if/else 39 (120 pts), boolean chains 11, loops 3 (7 pts), match/switch 2 (7 pts) (nesting depth added 90). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/raster.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f09ee3dc9a159518de6a5d8532b963dc7ed6b67de3deb37007f4a0dbb7742bb"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::apply_to (cognitive 144): pdfcraft_redact::apply_to has cognitive complexity 144 (threshold 15). Drivers by points: if/else 40 (104 pts), loops 14 (27 pts), match/switch 2 (7 pts), boolean chains 6 (nesting depth added 82). 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":"engine/crates/redact/src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d5122be8a1573aa3f19af3a8b179ac0aab8c57d02fc37b11686acc94443450"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::rewrite_block_from (cognitive 137): pdfcraft_edit::text::rewrite_block_from has cognitive complexity 137 (threshold 15). Drivers by points: if/else 69 (92 pts), boolean chains 26, loops 5 (11 pts), match/switch 7 (8 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c675c43c915f8c6c861977a0bdad3edf7f9874fb0f5cf8f86818922553ac7656"}},{"ruleId":"D2","level":"warning","message":{"text":"MindMapKt.MindMapEditor (cognitive 129): MindMapKt.MindMapEditor has cognitive complexity 129 (threshold 15). Drivers by points: if/else 68 (111 pts), boolean chains 11, match/switch 5 (6 pts), loops 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into 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/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade7513ec9fd5aca09d34f33b0fd589867bba9231106f898948365a19a652190"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_render::text::arrange (cognitive 118): pdfcraft_render::text::arrange has cognitive complexity 118 (threshold 15). Drivers by points: if/else 29 (77 pts), loops 13 (22 pts), boolean chains 17, match/switch 1 (2 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dbbe43ed9c1d7ae1069599bd910447bfef905157ef8ef9077e5677b92850d9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_preflight::verify (cognitive 114): pdfcraft_preflight::verify has cognitive complexity 114 (threshold 15). Drivers by points: if/else 30 (73 pts), boolean chains 20, match/switch 6 (13 pts), loops 5 (8 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/preflight/src/lib.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"70af5b444b10b2c23784fdf550865923a41b449ae9d6006056eeb3d3c5ac57d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::call (cognitive 110): Automation::call has cognitive complexity 110 (threshold 15). Drivers by points: if/else 31 (58 pts), match/switch 20 (42 pts), boolean chains 10 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/lib.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aedd2c27f5eaccee6744364be3288d00601c1449eb3c32c0f8f821e03bda02b"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::read_compact_section (cognitive 110): Document::read_compact_section has cognitive complexity 110 (threshold 15). Drivers by points: if/else 35 (92 pts), loops 6 (10 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/document.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f78bed8a4b51ec176e00c977630c0f727d88f64a2a2a35ab4202da65c01816a"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::table (cognitive 109): Converter::table has cognitive complexity 109 (threshold 15). Drivers by points: if/else 32 (76 pts), loops 6 (15 pts), boolean chains 12, match/switch 3 (6 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f3634be67d7699ab178136d638da7ed58d4163e58591e6f0ff6f174c6c2eab"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::rtf::convert (cognitive 108): pdfcraft_create::office::rtf::convert has cognitive complexity 108 (threshold 15). Drivers by points: if/else 29 (82 pts), loops 5 (11 pts), match/switch 3 (9 pts), boolean chains 6 (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/rtf.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"221214a6288a6a4cfa865fad9b4eb31abcbb21c8d90ae953f2585188a706e24e"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::ops (cognitive 103): Walker::ops has cognitive complexity 103 (threshold 15). Drivers by points: if/else 23 (83 pts), loops 3 (9 pts), match/switch 2 (6 pts), boolean chains 5 (nesting depth added 70). 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":"engine/crates/measure/src/snap.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b3c34bc9fe6afeca1ff59a6f67fc6f53e7ec0900942722d30a676bf3688a4a"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetBook::cells (cognitive 97): SheetBook::cells has cognitive complexity 97 (threshold 15). Drivers by points: if/else 23 (64 pts), match/switch 7 (18 pts), loops 3 (8 pts), boolean chains 7 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/sheets.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d73b1dc9a3629b3e1bbe6b806a40ba66227cd99009e2a5003feb262eb53a24"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::sanitize::remove_hidden (cognitive 93): pdfcraft_redact::sanitize::remove_hidden has cognitive complexity 93 (threshold 15). Drivers by points: if/else 24 (59 pts), boolean chains 19, loops 6 (13 pts), match/switch 1 (2 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/sanitize.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82d70644d71b73bc14ce26f785ad58a777fb5c5e2e2cf65497fc2afb8775331"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::flatten::flatten_in (cognitive 91): pdfcraft_edit::flatten::flatten_in has cognitive complexity 91 (threshold 15). Drivers by points: if/else 23 (64 pts), boolean chains 12, loops 5 (10 pts), match/switch 2 (5 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/flatten.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"013748dfec6078c8094e988fb573aaac9b24f7ab8a37564e5bc333b1cb8c8039"}},{"ruleId":"D2","level":"warning","message":{"text":"PageCanvasKt.PageCanvas (cognitive 88): PageCanvasKt.PageCanvas has cognitive complexity 88 (threshold 15). Drivers by points: if/else 38 (73 pts), boolean chains 9, loops 3 (4 pts), match/switch 1 (2 pts) (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PageCanvas.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cc17b1b133cacb7fa7271c516184bd3836303de25640977bbb02355b2a93df"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::content::page_rule (cognitive 87): pdfcraft_a11y::content::page_rule has cognitive complexity 87 (threshold 15). Drivers by points: if/else 17 (53 pts), loops 8 (19 pts), match/switch 3 (10 pts), boolean chains 5 (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":"engine/crates/a11y/src/content.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"46410257b24b1ae93c827d7acdbc6082f56b305a114eb0f58f9ef1ced7d2bfa2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::flow::paginate (cognitive 86): pdfcraft_create::office::flow::paginate has cognitive complexity 86 (threshold 15). Drivers by points: if/else 13 (43 pts), loops 9 (34 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5357606647ce8bdd3453f9738e8692b3077632659e9c95f8fdbcfa2e5b4d1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::flow::layout_para (cognitive 85): pdfcraft_create::office::flow::layout_para has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (47 pts), loops 6 (19 pts), match/switch 4 (14 pts), boolean chains 5 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"db707842a700b07d29c471e1396473dd032562cb079616ed9fec4b7b937e8b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::run_edit (cognitive 85): pdfcraft_engine::run_edit has cognitive complexity 85 (threshold 15). Drivers by points: if/else 23 (47 pts), match/switch 16 (32 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 41). 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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eea00d92194aaf634429f1b68959eaada30cf1280ae6ddf871711bd4423f531"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::widget (cognitive 85): Emitter::widget has cognitive complexity 85 (threshold 15). Drivers by points: if/else 47 (72 pts), match/switch 6 (11 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f51f2382c01c1ac93482d980e50e6b01d634d410fb909cbd24ff9728dc7f21"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetViewerKt.SheetViewer (cognitive 85): SheetViewerKt.SheetViewer has cognitive complexity 85 (threshold 15). Drivers by points: if/else 61 (78 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 18). 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cc284be7475dd4de404c846dea3d44a52eb11283615e3a97a889571df95f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfdf::xfdf_annots (cognitive 81): pdfcraft_xfdf::xfdf_annots has cognitive complexity 81 (threshold 15). Drivers by points: if/else 24 (65 pts), loops 6 (13 pts), boolean chains 3 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfb27b1f167ffa4d223be76e581087ccd3dea4852256c377e2575fb0eb76c32"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::graphic_frame (cognitive 80): Renderer::graphic_frame has cognitive complexity 80 (threshold 15). Drivers by points: if/else 22 (54 pts), loops 7 (14 pts), boolean chains 6, match/switch 2 (6 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e99b8b4df3f0f67afd67ab4f9865089d073c61b21ca7d3ff10b101af07786fe"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::appearance::field_appearance_fit (cognitive 79): pdfcraft_forms::appearance::field_appearance_fit has cognitive complexity 79 (threshold 15). Drivers by points: if/else 34 (62 pts), loops 3 (9 pts), boolean chains 5, match/switch 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":"engine/crates/forms/src/appearance.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cc5b2dd5e884fe8545d5ca885a98b9d5476a250eee16bea9bff024d93cc2a2"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetViewerKt.SheetGrid (cognitive 79): SheetViewerKt.SheetGrid has cognitive complexity 79 (threshold 15). Drivers by points: if/else 42 (55 pts), boolean chains 11, match/switch 4 (7 pts), loops 4 (6 pts) (nesting depth added 18). 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32c1dfb0633013d25058071b7d266d670676e32eb2200c676424a79788a7b0a"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::page (cognitive 78): Writer::page has cognitive complexity 78 (threshold 15). Drivers by points: if/else 24 (54 pts), match/switch 5 (12 pts), loops 5 (7 pts), boolean chains 5 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/draw.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"358af1eb7b4c6df6f893b316f1fd08503a28a0952268b1d917850a6df13778e9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::format_date (cognitive 77): pdfcraft_create::office::xlsx::format_date has cognitive complexity 77 (threshold 15). Drivers by points: if/else 26 (57 pts), match/switch 4 (13 pts), boolean chains 6, loops 1 (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":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d0660ef4fa068476b56fc64adb1a09cb042ed3b8de7ff9f4b210d6907f489e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::appearance (cognitive 75): pdfcraft_sign::pdf::appearance has cognitive complexity 75 (threshold 15). Drivers by points: if/else 33 (50 pts), loops 5 (13 pts), boolean chains 10, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4840ed5563cc7fa08244848cf906cc0bd9e520fb03b1220ba8bf1391de11f5"}},{"ruleId":"D2","level":"warning","message":{"text":"Metrics::read_metrics (cognitive 74): Metrics::read_metrics has cognitive complexity 74 (threshold 15). Drivers by points: if/else 21 (55 pts), loops 2 (8 pts), boolean chains 7, match/switch 1 (4 pts) (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68ae377ba0a9a645402ac8ff54f108f1742555b2db8e4c37dffc0a8729911fd"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::detect::page_shapes (cognitive 74): pdfcraft_forms::detect::page_shapes has cognitive complexity 74 (threshold 15). Drivers by points: if/else 20 (59 pts), loops 4 (8 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/detect.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db0841b1e53172fff9ec22aadc24f913c3d0e4b99bd5fd53f7ed6cc85023c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"MindMapKt.drawMind (cognitive 73): MindMapKt.drawMind has cognitive complexity 73 (threshold 15). Drivers by points: if/else 39 (66 pts), match/switch 2 (4 pts), loops 2, boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"025ade240c57398dc1e4aeb1f23a3f1c39feabb8fd86d2e71115ac15bed06645"}},{"ruleId":"D2","level":"warning","message":{"text":"PagesScreenKt.PagesScreen (cognitive 71): PagesScreenKt.PagesScreen has cognitive complexity 71 (threshold 15). Drivers by points: if/else 42 (51 pts), boolean chains 13, match/switch 2 (5 pts), loops 1 (2 pts) (nesting depth added 13). 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PagesScreen.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf79fca9ee8b30b51d624a0f7ee1f114dd5cda2c3298993dde19134f4abf0824"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_export::tables (cognitive 70): pdfcraft_export::tables has cognitive complexity 70 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 12 (21 pts), boolean chains 11, match/switch 3 (8 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fac1f0aa28e3cf184016719362df969cdb2a134d8433d0644f0534725bf741"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::tags::clean_within (cognitive 70): pdfcraft_redact::tags::clean_within has cognitive complexity 70 (threshold 15). Drivers by points: if/else 19 (50 pts), match/switch 4 (8 pts), loops 4 (7 pts), boolean chains 5 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/tags.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"919b9a4e756e1b10a8b89772e94d22f04bb59c13c55fe9c60f2646ee06d7b846"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector::page_labels (cognitive 70): Inspector::page_labels has cognitive complexity 70 (threshold 15). Drivers by points: if/else 23 (52 pts), loops 6 (10 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"576a19f45b9df7ed7f18ad5c76a4d24034a6897cbc89c9503b0f4b9c13c2f309"}},{"ruleId":"D2","level":"warning","message":{"text":"FilesScreenKt.FilesScreen (cognitive 70): FilesScreenKt.FilesScreen has cognitive complexity 70 (threshold 15). Drivers by points: if/else 35 (51 pts), loops 4 (11 pts), boolean chains 4, match/switch 3 (4 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/desk/FilesScreen.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b3d935ad9f13c340e2774044fb3309f76723ba138a8436e77c0154c4fd0ae2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_fonts::pdf::parse_to_unicode_within (cognitive 69): pdfcraft_fonts::pdf::parse_to_unicode_within has cognitive complexity 69 (threshold 15). Drivers by points: if/else 9 (44 pts), loops 4 (12 pts), match/switch 3 (12 pts), boolean chains 1 (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":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4351c8d2cf1b3829801685dd79c8d93c57ff98e19069ba8581f27cfb05a2c7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::formcalc::lex (cognitive 69): pdfcraft_js::formcalc::lex has cognitive complexity 69 (threshold 15). Drivers by points: if/else 6 (23 pts), loops 7 (21 pts), boolean chains 16, match/switch 3 (9 pts) (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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e9b3661acfe234cb66adbb3c4843617dbf9303c5797ed07d7d8306de93f689"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::flow::render_line (cognitive 68): pdfcraft_create::office::flow::render_line has cognitive complexity 68 (threshold 15). Drivers by points: if/else 27 (56 pts), match/switch 4 (6 pts), boolean chains 4, loops 2 (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":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5180748bb091b918a35353c4565a360523bd7431b7a2d24427876245a38edc"}},{"ruleId":"D2","level":"warning","message":{"text":"Extensions::read (cognitive 68): Extensions::read has cognitive complexity 68 (threshold 15). Drivers by points: if/else 16 (49 pts), loops 6 (16 pts), boolean chains 2, match/switch 1 (nesting depth added 43). 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":"engine/crates/sign/src/x509.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfd5ff8e457a8804de38409102c63610ba3987e5350ce4546a2a0ff01299b2c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::classify_changes (cognitive 68): pdfcraft_sign::pdf::classify_changes has cognitive complexity 68 (threshold 15). Drivers by points: if/else 29 (46 pts), match/switch 6 (10 pts), boolean chains 9, loops 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb23a8276a76663d8dd26543dc4718d65aa5067b50863c03491d3a1815e7f48"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetChartsKt.paintChart (cognitive 68): SheetChartsKt.paintChart has cognitive complexity 68 (threshold 15). Drivers by points: if/else 26 (55 pts), match/switch 3 (8 pts), boolean chains 3, loops 2 (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetCharts.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"449bd2198f0cf252548f7999c42fe5aa3d0e3774dcd66b5ff7c635e89efaabbd"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::add_annotation (cognitive 67): pdfcraft_annot::add_annotation has cognitive complexity 67 (threshold 15). Drivers by points: if/else 30 (57 pts), boolean chains 8, match/switch 2 (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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f1407fdf38059db552a2026a9792499c75aec3e4ff65120e439a5cac81fb01"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::import::import_pages_mapped (cognitive 67): pdfcraft_organize::import::import_pages_mapped has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (44 pts), loops 4 (9 pts), boolean chains 7, match/switch 3 (7 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/import.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b97cdd175f4f1a6aa1824886aadce22483013214c8aa2e7f7615790fac97bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"PhotoMarksKt.paintMarks (cognitive 67): PhotoMarksKt.paintMarks has cognitive complexity 67 (threshold 15). Drivers by points: if/else 18 (49 pts), loops 6 (15 pts), boolean chains 3 (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoMarks.kt"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a17822b2e971eff5dfd2f68e0d3bfc4297622a9a9a5b120b37b3cc91ccefb7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::optimize_with_progress (cognitive 66): pdfcraft_optimize::optimize_with_progress has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (49 pts), loops 5 (10 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/lib.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82ab4e971dbcd4e0548baa614681b388ba5d0c491057a4fdd5043d9d13f9852"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::read_section (cognitive 65): Document::read_section has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (48 pts), loops 4 (8 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/document.rs"},"region":{"startLine":1940}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e60eb093c729deb7f4053c89cdeb081e782cd8735cbb07648dde20ce4ad00c"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::text_body (cognitive 65): Renderer::text_body has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (42 pts), match/switch 7 (13 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8098da45fa5fd0e88b099bad6dbaf292f90b693e48429df0fb1f9a0535e393"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::af::parse_date (cognitive 65): pdfcraft_forms::af::parse_date has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 18, match/switch 3 (6 pts), loops 2 (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":"engine/crates/forms/src/af.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0b49645b8eda3542393726bc1f665ece45da4c25761b0e2d0f9eb1ba494745"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_preflight::convert (cognitive 65): pdfcraft_preflight::convert has cognitive complexity 65 (threshold 15). Drivers by points: if/else 23 (46 pts), boolean chains 12, loops 5 (7 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/preflight/src/lib.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f309e44c50d4f8b10bcdbbc784a9115d33e704a363990105a19d1950958fe3c"}},{"ruleId":"D2","level":"warning","message":{"text":"MascotKt.Mascot (cognitive 65): MascotKt.Mascot has cognitive complexity 65 (threshold 15). Drivers by points: if/else 32 (36 pts), loops 7 (20 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 21). 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/mascot/Mascot.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ead4fcd3b28dbd61b7eafb829f0d85e3ed8b136463f85485b131fe37973093"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::headings::mcid_texts (cognitive 64): pdfcraft_a11y::headings::mcid_texts has cognitive complexity 64 (threshold 15). Drivers by points: if/else 14 (44 pts), match/switch 4 (10 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/headings.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9e4efc01a77d82e380f90e5359e0b61eb74d423b0dbcb2762d1480829a102e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text_regions::group_layout (cognitive 64): pdfcraft_edit::text_regions::group_layout has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 20, loops 3 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"58daf47d33e9a12283cccd37ce9d894f37a65f49b861534371461a0f37fc2693"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector::annotations (cognitive 64): Inspector::annotations has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (46 pts), match/switch 4 (8 pts), boolean chains 6, loops 3 (4 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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"51346664fe8d360bb097ca9edf71e49088a67980b633175458ac490443c65530"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::rtf::control (cognitive 63): pdfcraft_create::office::rtf::control has cognitive complexity 63 (threshold 15). Drivers by points: if/else 25 (50 pts), match/switch 7 (12 pts), boolean chains 1 (nesting depth added 30). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/rtf.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27e787a0d15f6528aa3e6c7e49e4a7c3d7709e9687955c7262a96034d802e0b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::interp::xobject (cognitive 62): pdfcraft_redact::interp::xobject has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (45 pts), match/switch 5 (10 pts), boolean chains 4, loops 1 (3 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":"engine/crates/redact/src/interp.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff4edcb4dce649e859027c3dbf24367ddf354d672ed56136d0ea62d2f0e15bb"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::pdf::strip (cognitive 62): pdfcraft_xfa::pdf::strip has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (45 pts), loops 7 (12 pts), boolean chains 3, match/switch 2 (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":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"750c7b34bda63768b8000afe2aa75fa1cf8f3649d82ed2a437ee885d4ac0752a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::data::merge (cognitive 61): pdfcraft_xfa::data::merge has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 13 (27 pts), if/else 10 (20 pts), loops 4 (8 pts), boolean chains 6 (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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb44ca01eeec783dfc5cdd600f873c0aa0cf11026c59c692e5f4c9c8c220b6c4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfdf::export_fdf (cognitive 61): pdfcraft_xfdf::export_fdf has cognitive complexity 61 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 9 (19 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 37). 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":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"e207d5c8c9ff34d9a57fe6704bb46faf6d34de74e38b04f7b9a154b1cb9b9da2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::write_value (cognitive 60): pdfcraft_forms::write_value has cognitive complexity 60 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 7 (14 pts), boolean chains 10, loops 2 (5 pts) (nesting depth added 25). 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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"61897ae7f5db06d28362eb47d3b1c275b17ec847369ff26cbd5470eb47e6b902"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_render::text::reverse_rtl (cognitive 59): pdfcraft_render::text::reverse_rtl has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 12 (17 pts), boolean chains 8, match/switch 3 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbbf29057a597b9ed212f75435d7829ad5d8cd64fffa23da7c472c02260735c"}},{"ruleId":"D2","level":"warning","message":{"text":"MindMapKt.layoutMind (cognitive 59): MindMapKt.layoutMind has cognitive complexity 59 (threshold 15). Drivers by points: if/else 34 (45 pts), loops 4 (7 pts), boolean chains 4, match/switch 3 (nesting depth added 14). 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd7064b154280ee3a7328ef827ee1efd2228ca4f3e3b8a66d93766e009cd27b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::text::layout (cognitive 58): pdfcraft_xfa::text::layout has cognitive complexity 58 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 6 (12 pts), boolean chains 8, match/switch 3 (6 pts) (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":"engine/crates/xfa/src/text.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef9151a7ece1cacb46e715823165226d4f17558e39a091fe3f55d3dba8308e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::apply (cognitive 57): Session::apply has cognitive complexity 57 (threshold 15). Drivers by points: if/else 30 (41 pts), boolean chains 12, match/switch 3 (4 pts) (nesting depth added 12). Of this number, 55 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3960}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad5e3b5d67cff115bd131fa0e2dc72139578a4b0045675a1798efe8157f421a"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk_ops (cognitive 56): Walker::walk_ops has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (35 pts), match/switch 5 (13 pts), boolean chains 7, loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/audit/src/cover.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"574c9e56ab3982a3fa110db78bdf64804ac5cd44013e74890ba54fa5ede5675f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::parse_sheet (cognitive 54): pdfcraft_create::office::xlsx::parse_sheet has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 5 (13 pts), boolean chains 6, match/switch 1 (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":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d353614dcadc6e124e235bfcd385f5acb9e559737a78e123024a1141368698b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::added::draw_laid_shaped (cognitive 54): pdfcraft_edit::added::draw_laid_shaped has cognitive complexity 54 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 8 (14 pts), match/switch 4 (11 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/added.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5c7787438455d2ec1bf47898bfdd7414d93f7d39b01ccefb66b3ce0df5a1fa"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::camera_edges::hough (cognitive 54): pdfcraft_engine::camera_edges::hough has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 6 (13 pts), boolean chains 2 (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":"engine/crates/engine/src/camera_edges.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f7550c397ad86901bdd8eba802acd174cd2d64c3e186acafb94474033b963c"}},{"ruleId":"D2","level":"warning","message":{"text":"TextDevice::finish (cognitive 54): TextDevice::finish has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 6 (9 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4c23732f3477767808f2e7bd6eb9a80bf8a4d1d8ea0b1e0b2b843ad446d037"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::comment_add (cognitive 53): Automation::comment_add has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 11 (23 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/comments.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b627cf5793c4c138cac26324ccb0d1755f3f21498ddc331cfe615c38dd929de"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::docx::convert (cognitive 53): pdfcraft_create::office::docx::convert has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 9 (17 pts), match/switch 3, boolean chains 2 (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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1663b4c0cc81e07873bfba66cad5133d44b1818238727f19138267c9164a97"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::images::page_images_in (cognitive 53): pdfcraft_edit::images::page_images_in has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 2 (5 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/images.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"de960629f020ac5ff639508b67e09b49d480d5798c8f714b44cd457819527a6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::statement (cognitive 53): Parser::statement has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (44 pts), loops 3 (8 pts), match/switch 1 (nesting depth added 27). 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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5ecc1c872cf379036b03d2a119ec6544333c4dc3dc5b6099128cac1463ca41"}},{"ruleId":"D2","level":"warning","message":{"text":"artefact_mobile::office::sniff (cognitive 53): artefact_mobile::office::sniff has cognitive complexity 53 (threshold 15). Drivers by points: if/else 24 (44 pts), match/switch 3 (7 pts), boolean chains 2 (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":"engine/mobile/src/office.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e4c1af81e6cda5c99a146a4b8aa4aef776e3919121f6e00adc16fbfcc84f00"}},{"ruleId":"D2","level":"warning","message":{"text":"artefact_mobile::ppt::import (cognitive 53): artefact_mobile::ppt::import has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (36 pts), match/switch 2 (8 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/ppt.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"911373bb39963891950c5b127df302a390efbc4cfbe9f968dd359fba500df494"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::redact_mark (cognitive 52): Automation::redact_mark has cognitive complexity 52 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 7 (13 pts), loops 3 (7 pts), boolean chains 4 (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":"engine/crates/automation/src/redact.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d13fd69f6c4889609f5fa369078f2f0a0b2dee3ec93416f81c3b086b2737703"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::docx::parse_ppr (cognitive 52): pdfcraft_create::office::docx::parse_ppr has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (32 pts), match/switch 4 (14 pts), loops 2 (4 pts), boolean chains 2 (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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d930847c58836a1b31487790a658bbf5333b8add5b8914e9bbad3ad6226147"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::camera_clean::background (cognitive 52): pdfcraft_engine::camera_clean::background has cognitive complexity 52 (threshold 15). Drivers by points: loops 13 (40 pts), if/else 2 (12 pts) (nesting depth added 37). 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":"engine/crates/engine/src/camera_clean.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d44741367870cb8e7d67e8ec8e6ac36962fc2fea885abbfb7abbf3b46498278"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::xfa::resolve_som (cognitive 52): pdfcraft_js::xfa::resolve_som has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 4 (9 pts), match/switch 3 (9 pts), boolean chains 5 (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":"engine/crates/js/src/xfa.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"996a87936991f362624252c286c5f40d1c1fd1cfd1000eb048ec28637b9e0f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"artefact_mobile::xls_art::chart_bits (cognitive 52): artefact_mobile::xls_art::chart_bits has cognitive complexity 52 (threshold 15). Drivers by points: if/else 14 (31 pts), match/switch 6 (19 pts), boolean chains 1, loops 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/xls_art.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ff3f8c48a385d18e0574446b3aaeca7b8687748c2f1a6fc8f0b040068219a3"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::overlay::content (cognitive 51): pdfcraft_redact::overlay::content has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 4 (8 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/overlay.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da8258288313bc4325e9085b54fc282fd932438b417dbecaadf9020499ba7fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Layouter::draw_node (cognitive 51): Layouter::draw_node has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 6 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"7256c5b6a3371e71c551265c2fb85e26bc93fef6acc4430dd1048e1082234fbf"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::data::password_dataset_wants (cognitive 51): pdfcraft_xfa::data::password_dataset_wants has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 4 (10 pts), match/switch 3 (9 pts), boolean chains 4 (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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c1d711202b9e78b9d29d9ceb408bab17aadbc7b001b200ab2c8edc66b0f937"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::read_compact_xref_chain (cognitive 50): Document::read_compact_xref_chain has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (33 pts), match/switch 4 (9 pts), loops 4 (6 pts), boolean chains 2 (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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fefa65378e63897265ef22ca72c2eb63b2f841f12ad97601dcba7f81e40700"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::prepare_open_unguarded (cognitive 50): Session::prepare_open_unguarded has cognitive complexity 50 (threshold 15). Drivers by points: match/switch 14 (27 pts), if/else 9 (18 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 24). 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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3681}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d6734a4aac23118ebf3c6bb3ad4e73424d131bb8f482569149d7144e2851bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::read_xref_chain_materialized (cognitive 49): Document::read_xref_chain_materialized has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 5 (12 pts), match/switch 4 (11 pts), boolean chains 2 (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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3885c4c154a0f93bcefd413ef3fecf4b91b4953ceeb1b949c8291f5bf187950"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::printf (cognitive 49): pdfcraft_js::printf has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 4 (8 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/lib.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c28b677a8a3c90abfc22363256fc0ae6961f295c4faff32a1c39a0f1c94a689"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::data::merge_values (cognitive 49): pdfcraft_xfa::data::merge_values has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 5 (14 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/data.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"433aeff5a5854d01695fdc70548f208cc9567af34702b870fa71f985801dd6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"AudioExportKt.wavToM4a (cognitive 49): AudioExportKt.wavToM4a has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/notes/AudioExport.kt"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac531c5e1e111d2d347a8813cd130af0a6fc2b7e3dd80b9390b070d37ca144ba"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::formcalc::parse_date (cognitive 48): pdfcraft_js::formcalc::parse_date has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 3 (7 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"1811e548a51c784648d8c919cb742207ad86df21df8887e6bc8f9e19275d48a0"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentPanelKt.CommentPanel (cognitive 48): CommentPanelKt.CommentPanel has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (36 pts), boolean chains 9, 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentPanel.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd44dd350591dffcd97ce8117f7c9fbd2dbc8e20e1d984378d4e0a2397589a0"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::extract::image (cognitive 47): pdfcraft_create::extract::image has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (25 pts), match/switch 6 (13 pts), boolean chains 8, loops 1 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/extract.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ed93c3cb5b72f956d6a69ef479e905d9944da5662c8221f180659baf174929"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::isolation (cognitive 47): pdfcraft_edit::isolation has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 4 (9 pts), boolean chains 6, loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/lib.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"07bd8533fc254479f42ec225a623d913cb5baf755f970c94ce3eaf83b0555c67"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::af::js_tokens (cognitive 47): pdfcraft_forms::af::js_tokens has cognitive complexity 47 (threshold 15). Drivers by points: match/switch 7 (23 pts), loops 6 (17 pts), boolean chains 4, if/else 1 (3 pts) (nesting depth added 29). 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":"engine/crates/forms/src/af.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b618cf8fb065c12fa6349f0a029bc2b8f6e6118d907d4720a3a568e9f14357a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_cos::writer::write_full (cognitive 46): pdfcraft_cos::writer::write_full has cognitive complexity 46 (threshold 15). Drivers by points: if/else 23 (34 pts), loops 8, 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":"engine/crates/cos/src/writer.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8970f002f31291803ce7f4de8df61ec2ef5251188cde02e93e3fee4a8d43e3"}},{"ruleId":"D2","level":"warning","message":{"text":"Layouter::split_block (cognitive 46): Layouter::split_block has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 4 (7 pts), match/switch 2 (4 pts), boolean chains 3 (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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bdad2e1754bf61ba33b36cb5d5b65ce3c263ee44eda812ce4acd862c77f452"}},{"ruleId":"D2","level":"warning","message":{"text":"Layouter::draw_field (cognitive 46): Layouter::draw_field has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (21 pts), match/switch 12 (20 pts), boolean chains 5 (nesting depth added 12). 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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":1836}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0abf33278b5159f7243d6d2b56378d1c44a0edb9ecfcf8ca7b394b8f9edb02"}},{"ruleId":"D2","level":"warning","message":{"text":"LiquidMorphKt.LiquidMorphSurface (cognitive 46): LiquidMorphKt.LiquidMorphSurface has cognitive complexity 46 (threshold 15). Drivers by points: if/else 41 (44 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"740a47d36c7838d94cca224766ef691ae9f12fadb6c1da6dbd9296824cad84ce"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::interp::show (cognitive 44): pdfcraft_redact::interp::show has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 3 (7 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"707fc0f49f8f7a373c3ad204beb7c2d1d311e499f93a7da3bffb929100431c04"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector::fill (cognitive 44): Inspector::fill has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 8, loops 4 (8 pts), match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/inspect.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a16db21970120414a1e01b42d1e3c19f2aef472fe0bbaad824dec714bd53d66"}},{"ruleId":"D2","level":"warning","message":{"text":"StyleSheet::parse (cognitive 43): StyleSheet::parse has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6 (13 pts), match/switch 4 (13 pts), boolean chains 1 (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":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"1413df60fa11f7dd8bfe3acb724e08c2c912c54443c05291b49914924651b1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_export::rtf (cognitive 43): pdfcraft_export::rtf has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 6 (15 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/lib.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1fc455728598ced9d363f60447f7375ada214a3e860ac87d435c879887fc4b"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadAloud.skip (cognitive 43): ReadAloud.skip has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 23). 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadAloud.kt"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d887c8c01dd4700b114e4639d1566595099601934ca3638d4b689f8fd964f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadingModeKt.ReadingModeContent (cognitive 43): ReadingModeKt.ReadingModeContent has cognitive complexity 43 (threshold 15). Drivers by points: if/else 25 (37 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadingMode.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4202496f8e147bb24656f662e9ac190315aa432de842b5462028595940f7ba0"}},{"ruleId":"D2","level":"warning","message":{"text":"ClearAppKt.Shell (cognitive 42): ClearAppKt.Shell has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 14, match/switch 3, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/ClearApp.kt"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af675c11b446f110fb94d50cd853bfc5fbf3807db7f44cb0557f70013cc7824"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetViewerKt.panZoomFling (cognitive 42): SheetViewerKt.panZoomFling has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (37 pts), boolean chains 4, loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b53c1967f6d49e48e252fe03add32acfbe39c227d8daab0b7498af7e9391b5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::rank_tabs (cognitive 41): pdfcraft_forms::rank_tabs has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 8 (14 pts), match/switch 1 (2 pts), boolean chains 1 (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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c7c5f229e9de1caa34b51e63dbd209a0372bff055e422a180ad483371cc79d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::script::rerender (cognitive 41): pdfcraft_xfa::script::rerender has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 2 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/script.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c4639baaf89c6bcbf21fce20483f1490b4236aaeab3cd4b269018fae21b58d"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::walk (cognitive 40): Planner::walk has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 2 (7 pts), boolean chains 5, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"c828663a94261d735557f0f7bc938d9973bf22c65a942a8525eb242e00adf202"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_export::html (cognitive 40): pdfcraft_export::html has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 3 (8 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/lib.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"3615713002912b12ab931d2d6211e257b395b49af1b36499c4ad419e2e591384"}},{"ruleId":"D2","level":"warning","message":{"text":"Interp::eval_inner (cognitive 40): Interp::eval_inner has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 3 (6 pts), match/switch 3 (6 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9446c5309bc5c5bb6e60bf510e50345d364f7bbaa4b7a958069fe3b526a8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::interp::unlink_doomed (cognitive 40): pdfcraft_redact::interp::unlink_doomed has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 5 (9 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"4329f18992d8087d7eb2ef32973fe992ab6135b9949b116c87b4335c35acbf1b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::sanitize::content_pass (cognitive 40): pdfcraft_redact::sanitize::content_pass has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 4 (9 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/sanitize.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"decf23366a5c388d2b3776615dd27db811b779cafe553493bb271149c1ad4f3f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::data::rewrite (cognitive 40): pdfcraft_xfa::data::rewrite has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (35 pts), match/switch 3 (4 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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":1678}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e2415ddef7bc90d9cd2ea94f08de4dd08a8fe2cea07fe817cb7d2a2c8f983a"}},{"ruleId":"D2","level":"warning","message":{"text":"CreateDockKt.CreateDock (cognitive 40): CreateDockKt.CreateDock has cognitive complexity 40 (threshold 15). Drivers by points: if/else 27 (30 pts), boolean chains 8, match/switch 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/home/CreateDock.kt"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f1d60ba8cedd21f6b473ac4770e58894254379bf0155d8f267c8dd803a9fd2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::add_header_footer (cognitive 39): pdfcraft_edit::add_header_footer has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 4 (7 pts), match/switch 2 (6 pts), boolean chains 2 (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":"engine/crates/edit/src/lib.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"52585e32dfcd8297177956ddfeb3c71c156fbccedd77909a21d1302ba2656c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text_reading::remove_all_text (cognitive 39): pdfcraft_edit::text_reading::remove_all_text has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 6 (9 pts), match/switch 1 (2 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":"engine/crates/edit/src/text_reading.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"262b9f0bcd8b24ba46a76045f42a004b83797a10eb9c6083b0695d1607d7ff9c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_export::docx (cognitive 39): pdfcraft_export::docx has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 2 (9 pts), loops 4 (6 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":"engine/crates/export/src/lib.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"5313a1f819bbafb59f1967bd133daff2d3793a2797aa89d30d23cc82fcc6ab48"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::postfix (cognitive 39): Parser::postfix has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 1 (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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d076daea7fc210f86e4c2307715e0ef091f31c56dba6b2cfe0fb09b80905ef5"}},{"ruleId":"D2","level":"warning","message":{"text":"Interp::exec (cognitive 39): Interp::exec has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 7 (12 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cdbbb0d3faf2367a127ab8a4965bac0e901d8e8ea998c054626d379936d418"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_render::text::extract_page_filtered (cognitive 39): pdfcraft_render::text::extract_page_filtered has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 9 (14 pts), boolean chains 2, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0594bb8eebfa966965500857d47e03c1fc261a74c69413e8fa913a04a3d7b8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_render::text::search::find (cognitive 39): pdfcraft_render::text::search::find has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 6, loops 4 (5 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":"engine/crates/render/src/text/search.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66501e06982a847f6a5883ec51cf3a81af93d3966d6e82961af37ba24268389"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalFiles.scan (cognitive 39): LocalFiles.scan has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/engine/LocalFiles.kt"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b473fe1075dabe7354437ea85790622df616a89dcf76aa510cdf1b94f42fee94"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::run (cognitive 38): Converter::run has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 4 (13 pts), loops 2 (5 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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f011ad568ba2cefdd582dd1232720092e8ddefe57c4dc69dc3fd871906e913"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::format_value (cognitive 38): pdfcraft_create::office::xlsx::format_value has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 5, loops 3 (5 pts), match/switch 1 (2 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":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d586e22caf2dd058a4d0af8e0bd29f37b9ba42ce51795a5d3f3d32f7f527f001"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::unused::remove_unused (cognitive 38): pdfcraft_optimize::unused::remove_unused has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 4 (5 pts), match/switch 2 (4 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":"engine/crates/optimize/src/unused.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bebfd51fb0c9dbc3d53698bdfb80bb963849a0a2e8e6aa5db16a242b082ac5d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_preflight::xmp::xml_limits_ok (cognitive 38): pdfcraft_preflight::xmp::xml_limits_ok has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 2 (4 pts), boolean chains 2 (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":"engine/crates/preflight/src/xmp.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4b78687fa668dacbf49b70020a4221c456571325a083e270cf6bc8861f000c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::rect_for (cognitive 37): pdfcraft_annot::rect_for has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 11, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"d864336ba816e89b5b35249f6f03c74e79ba946b0957c78d4893c3904ea5a728"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::jpeg (cognitive 37): pdfcraft_create::jpeg has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 7, match/switch 3 (7 pts), loops 2 (3 pts) (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":"engine/crates/create/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5463af3dc9e4793fc253158a1c3482e7a9ed7e85e1a330d98a03152c764b1ae"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::flow::layout_table (cognitive 37): pdfcraft_create::office::flow::layout_table has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 8 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6fc2c31b352b3f7c400175d76bd62e2887b602ee6fcc5cac560ee0b0e46abd"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::background::page_background (cognitive 37): pdfcraft_edit::background::page_background has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 5 (15 pts), boolean chains 4, 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":"engine/crates/edit/src/background.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa064086f6f5a40c41c6d2c66eb300cc12428677921caa75b765cd1485c26ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::objects::added_geometry (cognitive 37): pdfcraft_edit::objects::added_geometry has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 2 (6 pts), boolean chains 4, 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":"engine/crates/edit/src/objects.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ee80f91b6a333c9c99423f4aca893d54a4c407c0df2f23529015af5280bdf9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::fonts_shown (cognitive 37): pdfcraft_edit::text::fonts_shown has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 5 (7 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":2080}}}],"partialFingerprints":{"codehealthFindingId/v1":"2867fe8680a27c7492d3e686600318ec569dd720c0cd4319bf86ed397a8ddda7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::printd (cognitive 37): pdfcraft_js::printd has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 4 (10 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/lib.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab3c3216a066251cc5a03b52de7d9a7448d594506ce06ff22eda71d585491ae"}},{"ruleId":"D2","level":"warning","message":{"text":"PageTree::next (cognitive 37): PageTree::next has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (3 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":"engine/crates/model/src/lib.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee0b4d92e56bae818406496ff7b18a8777ba1a60014d73ceffc8a10280feb2b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::labels::read_label_node (cognitive 37): pdfcraft_organize::labels::read_label_node has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (24 pts), match/switch 2 (7 pts), loops 2 (4 pts), boolean chains 2 (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":"engine/crates/organize/src/labels.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d708ea95c19dabd5811cac0eb5aaa471f40554d638689745b634be65c11681"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::tags::drop_object_refs_within (cognitive 37): pdfcraft_redact::tags::drop_object_refs_within has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/tags.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"539a07136107eba7a1b7ce5f8f6d29fef133db4f97bf67dd50a7541d7c6e23fd"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::validate_into (cognitive 37): pdfcraft_sign::pdf::validate_into has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 5 (7 pts), boolean chains 5 (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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70949d3288f347b06ed76544fccfb0a36469a92c099afbd6c4b3f07bf7f304e"}},{"ruleId":"D2","level":"warning","message":{"text":"MascotFaceKt.drawFace (cognitive 37): MascotFaceKt.drawFace has cognitive complexity 37 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 2 (3 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/mascot/MascotFace.kt"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"71295b8c15b9f46bb39b1a0d3c9c8b65b9e3dff30ad816ed34dfd89610884d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"NoteEditorKt.NoteEditor (cognitive 37): NoteEditorKt.NoteEditor has cognitive complexity 37 (threshold 15). Drivers by points: if/else 28 (35 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/NoteEditor.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f298154c8d3511ced418fe0a4ea64f3d4dade55942278744d1bf76f9258af33d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::summaries (cognitive 36): pdfcraft_annot::summaries has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 4 (6 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"272bee97dea6b047083c84e2b1dc72cf4df7624a07a97330d4eb1a98a179eec6"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_compare::visual_regions (cognitive 36): pdfcraft_compare::visual_regions has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 6 (13 pts), boolean chains 4 (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":"engine/crates/compare/src/lib.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c15afb469c0a2d77327c06c4940572ac73236e5d282d7fbff8bffa9cf7f3d0cc"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::added::shaped_layout (cognitive 36): pdfcraft_edit::added::shaped_layout has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 3 (8 pts), loops 3 (5 pts), boolean chains 4 (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":"engine/crates/edit/src/added.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c14c9b5da8a9353857a4c98d5753085f5867f7e13cb625dd0fb28893ba8f84c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::fragments::merge_page (cognitive 36): pdfcraft_optimize::fragments::merge_page has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/fragments.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2ece5fc786b9c593a72bbd9684f5cba00f180aad38e8e2ed88710716267ca5"}},{"ruleId":"D2","level":"warning","message":{"text":"artefact_mobile::ppt::read_group (cognitive 36): artefact_mobile::ppt::read_group has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (26 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/ppt.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"baad19db98fd689b07b48ef71368578f210ffe7e3bee8762d81122c73b602edb"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_compare::myers (cognitive 35): pdfcraft_compare::myers has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 5 (9 pts), boolean chains 8 (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":"engine/crates/compare/src/lib.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7619f91e83d964a4a3d4116092447cf75738bc1f1b9a02b5af531dec7251551e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::format_number (cognitive 35): pdfcraft_create::office::xlsx::format_number has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 8, loops 4, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a364b2008c82dbe0474c568c6d4229ade70da33f7adf08fcab635c0cb27753"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::xml::nests_deeper_than (cognitive 35): pdfcraft_create::office::xml::nests_deeper_than has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 3 (5 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":"engine/crates/create/src/office/xml.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccce767dcae773b99ba99fd8e406108dac4a57939526573c8011a9499c3cf8b4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::translate_blocks_inlined (cognitive 35): pdfcraft_edit::text::translate_blocks_inlined has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":3598}}}],"partialFingerprints":{"codehealthFindingId/v1":"b585bda9b799dfff0c9d365c8d22b62fd51352a9dc2ef96467d8894e6f4a5909"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::af::order (cognitive 35): pdfcraft_forms::af::order has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/af.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ef4b7e271b55642f7403349f69a66a577e391507bd11b60dd56d8a1fc5a9ff"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::detect::detect (cognitive 35): pdfcraft_forms::detect::detect has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 8 (9 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/detect.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fa0aca35d84d7503cd0d4c7d4e400b8a8a1e3a860b77fc54b48d27eb43bdf6"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::finish_validation (cognitive 35): pdfcraft_sign::pdf::finish_validation has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 10, 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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"42efe4b525fc6a0bab43a4373860835946d42e24f12f30c694efecb1d184df27"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::script::apply_overrides::walk (cognitive 35): pdfcraft_xfa::script::apply_overrides::walk has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 3 (8 pts), loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/script.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c164917f11231126bf8fc7c6345abc90ff0d63cee026894a705c148933da79"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerSheetsKt.BookmarksSheet (cognitive 35): ViewerSheetsKt.BookmarksSheet has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (30 pts), loops 1 (3 pts), match/switch 1 (2 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerSheets.kt"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"73137c37e27b3e20faba112e3db381e50bda30e7da54cb055a1c45bec1e0d0a7"}},{"ruleId":"D2","level":"warning","message":{"text":"XrefSection::has_any_entry (cognitive 34): XrefSection::has_any_entry has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/document.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8276642f081038dbd6e9c1990515e819e2a8ec7b74477c53b1fee49e0c9c03b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::text_lines_in (cognitive 34): pdfcraft_edit::text::text_lines_in has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 11, loops 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":"engine/crates/edit/src/text.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"031013a0c4336bbdf4c32c4408b2d4b039b9897af9cf8a01942ad6a7f13f824d"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::next (cognitive 34): Lexer::next has cognitive complexity 34 (threshold 15). Drivers by points: loops 5 (11 pts), match/switch 4 (11 pts), if/else 5 (8 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacd818a54d697c2c264071d95090859e551002a3da66edfc50a9511b09655db"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_fonts::pdf::embedded_sfnt_within (cognitive 34): pdfcraft_fonts::pdf::embedded_sfnt_within has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e94c29f36a48a5a5559cb21cf6183d4e6cec060b5bcfadc26a47bd05f6a8edc"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::image::decode (cognitive 34): pdfcraft_xfa::image::decode has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 3 (5 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/image.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b04b1e15a81cd30463c573fa5dfe5f59e866af7c2193c8a20ea563149f1ed7d"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolScreensKt.ProtectScreen (cognitive 34): ToolScreensKt.ProtectScreen has cognitive complexity 34 (threshold 15). Drivers by points: if/else 26 (29 pts), boolean chains 5 (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"14affdca5d36b91a880917eb741c2fd3e0ef92520a8668d5e3b9b9d5dfb317a0"}},{"ruleId":"D2","level":"warning","message":{"text":"FillSignKt.SignPanel (cognitive 34): FillSignKt.SignPanel has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (33 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/FillSign.kt"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc162c4e4faf5244fdaab4ae5126e8261e79e5bf9f033c6f6185b84b57894ad"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::content (cognitive 33): Walk::content has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 3 (9 pts), boolean chains 4, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/content.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"16805380dd2f58af889e795e27e410fe267c4cede160d1b2144dc551a76e7d09"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::autotag_fields::tag_form_fields (cognitive 33): pdfcraft_a11y::autotag_fields::tag_form_fields has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 4 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/autotag_fields.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5de70be599cea4e89d5ea91eb5ea4e19b21e363bd1eb77890a178dc2a7fd3b7"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::reconstruct (cognitive 33): Document::reconstruct has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 6 (8 pts), boolean chains 6, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/document.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b7e05fd22ec3f2462d740a5c445d7ece8c475998a8e21337f3fd9e14e1fe54"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::images::reading_images::walk (cognitive 33): pdfcraft_edit::images::reading_images::walk has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 1 (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":"engine/crates/edit/src/images.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3183140a75dd6fbd0b9bc9c626948cdefe750575ec08749e8b6dc9ede4b85a9e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::images::translate_images_inlined (cognitive 33): pdfcraft_edit::images::translate_images_inlined has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 5, loops 4, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/images.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6060b583490636ee1a374043582e3899e48b9423268f79a28bdb172b6a5fa72"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_print::spool::localize (cognitive 33): pdfcraft_print::spool::localize has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/print/src/spool.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f20d44ef930bdd3963602ea2f94a10809a9bacd5d9bb2ee2f2a63e4397af1a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::interp::unlink_from_forms (cognitive 33): pdfcraft_redact::interp::unlink_from_forms has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedb2e607a65f922b0a3bd2781694d25b49f7be15f56f7f0c4797dc6b9851628"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_render::text::collide (cognitive 33): pdfcraft_render::text::collide has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 9 (14 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0878024d341fa8ff003a7d5fc063e6327839cf6a769dcbf38036722962fd35c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolScreensKt.CropScreen (cognitive 33): ToolScreensKt.CropScreen has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 6, loops 2, match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09da481ce45a42a60fe24739ded23ad829d25335f1af54f6d54309d3103ac37"}},{"ruleId":"D2","level":"warning","message":{"text":"OverlaysKt.GlassDialog (cognitive 33): OverlaysKt.GlassDialog has cognitive complexity 33 (threshold 15). Drivers by points: if/else 21 (31 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Overlays.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"467ff83dcf735df157d64d5b293bab193ad94acf32776db537829c5a85f2afeb"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::merge (cognitive 32): Planner::merge has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded7103a343cd1aee21388a520b3f404664cf4d748806a9e29961ee16a7025be"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::images::image_transform_scope (cognitive 32): pdfcraft_edit::images::image_transform_scope has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/images.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7202d7679104ded60384b4147d1d890835410b32876c15b2864e31426894c8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::with_field_appearances_cached (cognitive 32): pdfcraft_forms::with_field_appearances_cached has cognitive complexity 32 (threshold 15). Drivers by points: match/switch 6 (20 pts), if/else 2 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 19). 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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddac95f7e57dafea5f93259d9eda22f050cdad98176c6cc550f67ac8e52b2211"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::detect::raster::components (cognitive 32): pdfcraft_forms::detect::raster::components has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 4 (10 pts), boolean chains 3 (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":"engine/crates/forms/src/detect/raster.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c6aef18b8dcb1e8d34b2a2cb2fbb884c524d4b85fc05509493c362e03f0053"}},{"ruleId":"D2","level":"warning","message":{"text":"Interp::assign_to (cognitive 32): Interp::assign_to has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 2 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"5970ad2ca26cdf9aa77cc5dbf36c17114e8003302aaf9bce190093556c3bea15"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::scan_date (cognitive 32): pdfcraft_js::scan_date has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (8 pts), match/switch 3 (6 pts), boolean chains 5 (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":"engine/crates/js/src/lib.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a581dea1fc1f45dba0063639c4b2ff944dc0ae7c49efb996d6c7166519d6c8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfdf::annot_from_xml (cognitive 32): pdfcraft_xfdf::annot_from_xml has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (23 pts), match/switch 2 (4 pts), boolean chains 3, 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":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f082b062bc5e9a72ec804709da0b1f4023ff8a4595097e92e0fa89bf3fedba5"}},{"ruleId":"D2","level":"warning","message":{"text":"artefact_mobile::xls_art::import (cognitive 32): artefact_mobile::xls_art::import has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/xls_art.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4a37606c6b8e563e638908a299a4085a58208e6f4de64b4863004b938fb395"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::word_count::exclusions (cognitive 31): pdfcraft_engine::word_count::exclusions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/word_count.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7255df037caf6406e0067fd188397a87b16b12767322213bbecf5acb8019ca64"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::actions::set_field_actions (cognitive 31): pdfcraft_forms::actions::set_field_actions has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 18). 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":"engine/crates/forms/src/actions.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9894a71edcc238964b7cd2242bb79ab7a7ec4161e0735f853f413f669bb675"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::detect::raster::writing_area (cognitive 31): pdfcraft_forms::detect::raster::writing_area has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, loops 3 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/detect/raster.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6467f290edc217fca2edde9c0f873a2bd321a714526b038467c6a628f94de5fb"}},{"ruleId":"D2","level":"warning","message":{"text":"PageWalk::next (cognitive 31): PageWalk::next has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 3 (6 pts), boolean chains 2 (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":"engine/crates/organize/src/lib.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bd40a97056f545909d1184718e6d16c9611aff43160cec4b1b0fe204a85ae8"}},{"ruleId":"D2","level":"warning","message":{"text":"TextDevice::draw_glyph (cognitive 31): TextDevice::draw_glyph has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 7, match/switch 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e95eb298b2e816f8b73c4df929e5e587d73b676551fd53e1abe09af1972e12"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::sign_inner (cognitive 31): pdfcraft_sign::pdf::sign_inner has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 6 (10 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"35483aecb872fc35b6138f6229ab77105ff387d53d036924ee5ee69130ee19cb"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::parse::apply_saved_state (cognitive 31): pdfcraft_xfa::parse::apply_saved_state has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/parse.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3ca36cadcfa78f00633e1ed40ee9f6f9bde36cecb437810f94308c9f4c6776"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfdf::import_xfdf (cognitive 31): pdfcraft_xfdf::import_xfdf has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea467b53baa9d7435fae4f0ff6e313b201bd7bfddaf50d3a38a14bc9152a4db7"}},{"ruleId":"D2","level":"warning","message":{"text":"artefact_mobile::ppt::text_look (cognitive 31): artefact_mobile::ppt::text_look has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (29 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/ppt.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b41fd5f61ef26c85cfdd706a5cf765153471a169fc0d01e99ffb25aada2629e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::check (cognitive 30): pdfcraft_a11y::check has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (5 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/lib.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed2a7000c59c0f1aa88efb2ca067c14bbc43767e45e05dadbeaea67b2136ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_content::unfiltered_image_end (cognitive 30): pdfcraft_content::unfiltered_image_end has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (9 pts), boolean chains 6, 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":"engine/crates/content/src/lib.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"718981a4e908c0dac4aec05022ab4fd3e44b0dcf4a71ad35bbb72d4fce3dee20"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageState::apply (cognitive 30): ImageState::apply has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 7, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/images.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f67d69d2548b2e80f69721495276bdb8d464e6dc3933c1a81bb042bb1b18a70"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::added::wrapped (cognitive 30): pdfcraft_edit::added::wrapped has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/added.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0944af30b3e582c9c1312267083b67f7983c41b6afe60a358161ed895cca067"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::camera_edges::best_quad (cognitive 30): pdfcraft_engine::camera_edges::best_quad has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (20 pts), loops 4 (10 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":"engine/crates/engine/src/camera_edges.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02066212aa50d5b8af037ccfe78fcba44a2c0b74aea05d70f8cbb754904ec67"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::scripting::apply_changes (cognitive 30): pdfcraft_forms::scripting::apply_changes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/scripting.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bc669d55ff391bc6cbc19c6aeadcdd7adaa2d119056489fe85ee6fc4241122"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::scripting::document_scripts_named (cognitive 30): pdfcraft_forms::scripting::document_scripts_named has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (4 pts), match/switch 1 (4 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":"engine/crates/forms/src/scripting.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"485a037d70e7d899dea6349495b0cefaa078349e368627f5f52900147e0f10a4"}},{"ruleId":"D2","level":"warning","message":{"text":"Pruner::content (cognitive 30): Pruner::content has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 8 (14 pts), loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/prune.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7e6f7636fdc5f55e71830163b1f5751e8b8df29278c98cbb48032de04dae60"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_print::range::select_pages (cognitive 30): pdfcraft_print::range::select_pages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 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":"engine/crates/print/src/range.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"acedbb9a79dc8dde8c7736ca32a7355f522dd4fd397c288f266ad18060b3cba8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::localize_resources (cognitive 30): pdfcraft_redact::localize_resources has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 5 (12 pts), loops 3, 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":"engine/crates/redact/src/lib.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ac8bcb965c23ab2586092ec43d08a0eb7753b701fe11f62ff96351785132b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Emitter::page (cognitive 30): Emitter::page has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 2 (4 pts), loops 2 (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":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e832f718e94434b16d1fbee8c356ba5951ff6854ae32ca3b92fc2087191c7d7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::packets::read_packets (cognitive 30): pdfcraft_xfa::packets::read_packets has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 1 (2 pts), match/switch 2, 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":"engine/crates/xfa/src/packets.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"148a9d2a8e676e4278e57d91dfff658db96adf7eab52e9eb59e920d93edb9728"}},{"ruleId":"D2","level":"warning","message":{"text":"artefact_mobile::xls_art::shapes (cognitive 30): artefact_mobile::xls_art::shapes has cognitive complexity 30 (threshold 15). Drivers by points: loops 4 (14 pts), if/else 3 (10 pts), match/switch 2 (6 pts) (nesting depth added 21). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/xls_art.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6a1ba3e295e071fe612736ab6b71671a4955ce4a73fa9dc80eee4a8f8de859"}},{"ruleId":"D2","level":"warning","message":{"text":"DigitalSignKt.SignatureDetails (cognitive 30): DigitalSignKt.SignatureDetails has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (22 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DigitalSign.kt"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"c235bdd4a0f2f69d6993f05f71580b6a15f91846a64b9cccfa6b4518ca972389"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::signature_scan::box_blur (cognitive 29): pdfcraft_engine::signature_scan::box_blur has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 7 (9 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":"engine/crates/engine/src/signature_scan.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca8ebf487472bc989c5a878aaafe5a27ce54f53a005ddb5f30f3e272b9c0922"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_fonts::embedding::embed_mapping (cognitive 29): pdfcraft_fonts::embedding::embed_mapping has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/embedding.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cee228c5229d5b7457d66a663111e89ef372fb791634050b0c7e4f8c47b18f7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_fonts::pdf::unicode_map (cognitive 29): pdfcraft_fonts::pdf::unicode_map has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 4 (8 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce96bf668892c0885a7bf7c44294e7e5129c59b2bc17fff51e2519b6cf935f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Interp::method (cognitive 29): Interp::method has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 8 (17 pts), if/else 4 (10 pts), boolean chains 2 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aec9d6a83743817e5f5e04b06de07e88d93955499ea928d300463d3487f218b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::refuse (cognitive 29): pdfcraft_js::refuse has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (10 pts), boolean chains 2, match/switch 1 (2 pts) (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":"engine/crates/js/src/lib.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"3551ad599adcaabefb003e0aa9ad112a5ee08810bc4881d4eacbbbeaf7346649"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::dedupe::collect_resource_refs (cognitive 29): pdfcraft_organize::dedupe::collect_resource_refs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 3 (7 pts), match/switch 1 (nesting depth added 18). 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":"engine/crates/organize/src/dedupe.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a907d2a100e1e386e0bf3e731b8bcb134affa5db241db3410e77f2d40bd1c9cc"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_print::page_form (cognitive 29): pdfcraft_print::page_form has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (25 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":"engine/crates/print/src/lib.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4533bdda8f862bbb77f121496489da931e5b509638c3e885175ef3af19588dd"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::image::decode_and_clear (cognitive 29): pdfcraft_redact::image::decode_and_clear has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/image.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f4e066fd7859a64f871d76052c051506eb38c63cf17cf5a14dd4998993ce7b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::change_kind (cognitive 29): pdfcraft_sign::pdf::change_kind has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 7, match/switch 4 (6 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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15a76de89fb74624151374a78d869de0e0892db94651a17d02c26d4a2198a52"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentListKt.CommentRow (cognitive 29): CommentListKt.CommentRow has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 6 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentList.kt"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e2deedeb861db472ebf89d99d3453b58e8c7ac0143b3e40668bef39f3f5a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"EditKt.InlineEditor (cognitive 29): EditKt.InlineEditor has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (22 pts), loops 3 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4902462a1063de8933ed45ea9d7594cd7a6af604e5737e51f0c64b32cf9a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerBarsKt.ViewerTopBar (cognitive 29): ViewerBarsKt.ViewerTopBar has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 4 (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerBars.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25060db8e12a62f2b87299b6f3324f35ed3c1df6f6c802a49e7a0eacb03aec9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::alt::content_bboxes (cognitive 28): pdfcraft_a11y::alt::content_bboxes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (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":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7878f266a06c9f810cbd091d43a11da248611b2f64dc2a4e784c1dc622f7f818"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::erase_ink (cognitive 28): pdfcraft_annot::erase_ink has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 4 (8 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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f599408b7a9d61b71479b5028b609582ab2c5c11c397f792b7354475b9d156e"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::fill_sign_add (cognitive 28): Automation::fill_sign_add has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 3 (6 pts), boolean chains 5 (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":"engine/crates/automation/src/comments.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f1b34f576c997c068b69b0ca5a30c900802e6a26e3f9347d9842cd147d9889"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::form_set_props (cognitive 28): Automation::form_set_props has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/forms.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"81408e2cc24d436f306893af884ecf49c7c2196c8c6abc16dfb9f1a1527b7377"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::literal_string (cognitive 28): Lexer::literal_string has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 3 (10 pts), loops 2 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/parser.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b669e7e5e107bd007f6f1aad5ad8ff80ffecd2bb062a1934cc40dc6cfe941f"}},{"ruleId":"D2","level":"warning","message":{"text":"Styles::para (cognitive 28): Styles::para has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd6576106980b17dac02ef54968350f4eb192d6e06f57b3a73a2fa2c9377881"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::refresh_scoped (cognitive 28): Session::refresh_scoped has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (16 pts), loops 3 (6 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":4242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eb68d1e8c6a1e1a711eef84ac5a63f763a4486d8002078a01b424a38671ab8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::camera_edges::refine (cognitive 28): pdfcraft_engine::camera_edges::refine has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/camera_edges.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4667173fcb05adb341de8915f2161e0cdeff2b2e04c00a052322eb8491870f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::printcheck::image_reports (cognitive 28): pdfcraft_engine::printcheck::image_reports has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 3 (6 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/printcheck.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b35bd9eab32045249c61d6b5dc8d47c639b4dc0356cffc4ba87f2ea181b8bb"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::af::calculation_sites (cognitive 28): pdfcraft_forms::af::calculation_sites has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, loops 3 (5 pts), match/switch 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":"engine/crates/forms/src/af.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1fb6de97288c35511b28488810ed7026bd3b942472d8009797df9c7bfe8bc0f"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector::name_tree_find (cognitive 28): Inspector::name_tree_find has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), match/switch 1 (4 pts), boolean chains 3 (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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"559ddc716260cbd919e9436a637fc2adfcd8f348c91f468b9010c66b1ba99ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"Layouter::flow_subform (cognitive 28): Layouter::flow_subform has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 2 (4 pts), match/switch 2 (4 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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"c549d10561671bdf87e24c095e6e266376ac5c654c914e378ae1f0feda9da91a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::xml_nesting_depth (cognitive 28): pdfcraft_xfa::xml_nesting_depth has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 2 (4 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":"engine/crates/xfa/src/lib.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa084e109362fc019bed2f9860f447c77750e958226d21dabbc6f742af7f7ea"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfdf::xml_nesting_depth (cognitive 28): pdfcraft_xfdf::xml_nesting_depth has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 2 (4 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":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f332dcbdbf89e1155b01125236eae22049cbd4e2af04d2dd66c53d7f67845d90"}},{"ruleId":"D2","level":"warning","message":{"text":"GlassLuminance.run (cognitive 28): GlassLuminance.run has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/AdaptiveGlass.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26c65f57c0061a785a5d317a8e25d0ed5a7e296ff1d0c4dc03c537953a2d9d1"}},{"ruleId":"D2","level":"warning","message":{"text":"ButtonsKt.glassControl (cognitive 28): ButtonsKt.glassControl has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 3, match/switch 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Buttons.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"394f5cc5305751859fac99c7ff756bc0b072264e8108008c96d20cdea643e0a1"}},{"ruleId":"D2","level":"warning","message":{"text":"MorphButtonKt.RectMorphSurface (cognitive 28): MorphButtonKt.RectMorphSurface has cognitive complexity 28 (threshold 15). Drivers by points: if/else 24, boolean chains 3, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/MorphButton.kt"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b659b8ca28137f6d9738975b33d9466d9efce480121cda307dac4bdb23a68d8"}},{"ruleId":"D2","level":"warning","message":{"text":"PhotoEditorKt.StraightenDial (cognitive 28): PhotoEditorKt.StraightenDial has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (25 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9abb6658147f895e410dfbe4da6177fdbd11c3546decaa8e9bbd652fdb66986"}},{"ruleId":"D2","level":"warning","message":{"text":"DigitalSignKt.SignaturesSheet (cognitive 28): DigitalSignKt.SignaturesSheet has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 1 (2 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DigitalSign.kt"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d865a233f555fe16a12fb3a343db9516ce7ffb259a8b687a347e3adb62a32f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::set_style (cognitive 27): pdfcraft_annot::set_style has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 6 (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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa87e676b4c623ecfdb0d46b108ab82111f7a18795e27731cf55158615a58a5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::doc_combine (cognitive 27): Automation::doc_combine has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 8 (12 pts), if/else 4 (8 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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff146e7f05a6a651539db6e248aed76283a19891761a3a5492119535c19fb6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Ops::next (cognitive 27): Ops::next has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 3 (8 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":"engine/crates/content/src/lib.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"25386e57656ac41adcb0d4c8315457d362e92751a858f716fb2a9c0dc9f5ff80"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::text_fonts::discover (cognitive 27): pdfcraft_engine::text_fonts::discover has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 5, 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":"engine/crates/engine/src/text_fonts.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3957c33e83838ba07d9d091fb1a3450a2a8b5e71edf2360627e839fbd9bb3d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_fonts::pdf::parse_cmap (cognitive 27): pdfcraft_fonts::pdf::parse_cmap has cognitive complexity 27 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 4 (10 pts), boolean chains 3, match/switch 1 (2 pts) (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":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c9c7f5ac89399dd3051f6222cec14d60591cb5a1ef73a0a4e9bbb8134fe1d2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::detect::raster::ink (cognitive 27): pdfcraft_forms::detect::raster::ink has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (6 pts), boolean chains 3 (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":"engine/crates/forms/src/detect/raster.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ff2c3bae0a774cf4c3509a8bd7b395d9a88aecd48ff89907997a88f1f68f38"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_measure::list (cognitive 27): pdfcraft_measure::list has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (6 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":"engine/crates/measure/src/lib.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e05d00066b50ad90f4efe1fa2fd67ec115d6d36c6574227a9e8ca55e5814f79"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::dedupe::dedupe_resources (cognitive 27): pdfcraft_organize::dedupe::dedupe_resources has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 6 (8 pts), match/switch 1 (3 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":"engine/crates/organize/src/dedupe.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"737c0c2a710582298f3bd4e18492ceb5aa58a0aec4b299e4625ea11078d6cdf6"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::prune::filter_at (cognitive 27): pdfcraft_organize::prune::filter_at has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (26 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/prune.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b192f1284deaeab59d57c03993e8d797880132dc7ffc8fb9700da010d5a3aea"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::data::pattern_to_iso (cognitive 27): pdfcraft_xfa::data::pattern_to_iso has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (5 pts), boolean chains 2, 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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeff61b32148cc5df1b0d1d09dc3ab9c573f6bc8fbcd1fd55637588d34c46b0"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetBook::render_page (cognitive 27): SheetBook::render_page has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 7 (10 pts), boolean chains 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":"engine/mobile/src/sheets.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ae6c512f8a3cbf88f3f76510c3dbe9fe1110b946b04d76696c25aa13998b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"QuickPreviewKt.Preview (cognitive 27): QuickPreviewKt.Preview has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (22 pts), boolean chains 3, match/switch 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":"android/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreview.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c498039b09549c3ea639cbde118e82e2f0e24193abf957073196022716203a"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsScreenKt.WallpaperPicker (cognitive 27): SettingsScreenKt.WallpaperPicker has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 1, match/switch 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bb52b9d32a251ff7f80493c90e442a61482ae90ad3bdfde52258fb617a7820"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::links::find_urls (cognitive 26): pdfcraft_annot::links::find_urls has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 7, loops 3 (7 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":"engine/crates/annot/src/links.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a5d5c862627a77e981c0d0f3405d21cb427d935a068f0dc3df3705d5a909b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::content_update (cognitive 26): Automation::content_update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 2 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/content.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ce1cf9ea4f0e3f3a0622c88e62624db3fcc5c38be5bb5d9b636117e38925cb"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::remove_marks (cognitive 26): pdfcraft_edit::remove_marks has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (8 pts), match/switch 2 (8 pts) (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":"engine/crates/edit/src/lib.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcafcae5d88ac8bd3bf7b90960edac7fdc773798eba041519ef078d00cad9c24"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::wrap (cognitive 26): pdfcraft_edit::text::wrap has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":2930}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ecadc1a8ee63fe0a626a13c5a1c60d974384214eed77be1b080a94fa65a666"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner::apply_effects (cognitive 26): Runner::apply_effects has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/xfa.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1892e7fc5c9ff5a319860e360a3d9bd03dc2f6e0601fbc7ed3cfffc89ed505"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_fonts::wrap_with (cognitive 26): pdfcraft_fonts::wrap_with has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (6 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":"engine/crates/fonts/src/lib.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b19262425d03dae7eb4dbb992046b596ecd6a72741e34fb84f24dc3ac8e9b1"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::author::patch_widget_look (cognitive 26): pdfcraft_forms::author::patch_widget_look has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (7 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/author.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"8296d0951ee793250557272ff9d47be6a32cd68955c2a8bec5ff6214e285fd3b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::detect::raster::enclosed (cognitive 26): pdfcraft_forms::detect::raster::enclosed has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 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":"engine/crates/forms/src/detect/raster.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2f6b5f52d92eee3212edafcc54b3c16acc0d1315336323600848e905ac2e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::images::process (cognitive 26): pdfcraft_optimize::images::process has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 8, match/switch 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":"engine/crates/optimize/src/images.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ad5f245fc5014a89a8a2e6204db498f3c5c1f4d18833543b395b3533d854ec"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::links::remove_unreferenced_dests (cognitive 26): pdfcraft_optimize::links::remove_unreferenced_dests has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (6 pts), loops 2 (5 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":"engine/crates/optimize/src/links.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"86435de1e8a8bc934fa068cc7b6fd1827fe848a6bdeb4dea0f17a8b5423c0639"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::import::resources_with_ancestors (cognitive 26): pdfcraft_organize::import::resources_with_ancestors has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (7 pts), match/switch 1 (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":"engine/crates/organize/src/import.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff7370b23960c7d885d791d4787c5b82d7cae41b13648abda8f88bf5aac54a7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::outline::name_tree (cognitive 26): pdfcraft_organize::outline::name_tree has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (7 pts), boolean chains 2 (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":"engine/crates/organize/src/outline.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f703d8cf89eedd750898a5ab1b45f7e718d051e16dc3e7e4f7482bb09be50372"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::patterns::phone (cognitive 26): pdfcraft_redact::patterns::phone has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 14, if/else 11 (12 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/patterns.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69898a2e4eb494db10d04e8e2763b7e479e3116ffcf6c7ecfe966db6a21356b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::cms::parse_signer (cognitive 26): pdfcraft_sign::cms::parse_signer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/cms.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca7e1576391a728c4a485dff3eac17a6aa430143de325f903c677ca1dc9a644"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::validate_doc_timestamp (cognitive 26): pdfcraft_sign::pdf::validate_doc_timestamp has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 7, match/switch 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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35cde952261faf0c45ab92d0c1695c5a0c35f4df13362be3acbc334c2a3901e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::signed_page_resources (cognitive 26): pdfcraft_sign::pdf::signed_page_resources has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (4 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 10). Of this number, 15 points are the body\u0027s own statements and 11 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"77be63d7b0801e3835f2ba67125c3e9fc06b2c17c519e0662143f8f6f2536385"}},{"ruleId":"D2","level":"warning","message":{"text":"MascotFaceKt.drawEye (cognitive 26): MascotFaceKt.drawEye has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 4, loops 3 (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":"android/app/src/main/java/com/chethan616/clearpdf/ui/mascot/MascotFace.kt"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ea8ef0011148c9981516836705ae76d36b3961750a2d1c3b0eac34d8301b4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::paragraph (cognitive 25): Converter::paragraph has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a94471d4472438e7a1689d2262d4fe602e4884cbffe9e17539383342c84760"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::extract::space (cognitive 25): pdfcraft_create::extract::space has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 8 (21 pts), if/else 2 (4 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/extract.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c82d539069aefa14ce9a896e3f236a817f3d3385f1cecbd0174800f8d2327be"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::added::draw (cognitive 25): pdfcraft_edit::added::draw has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/added.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2ea4e38376b7bc5674e8ae22118e182fbe7ec4cf07ef1cb57ec6f4e9930691"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::bidi::reading (cognitive 25): pdfcraft_edit::bidi::reading has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (8 pts), boolean chains 4 (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":"engine/crates/edit/src/bidi.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a05916b5fcfb58d64caa6b74134efe5a045eddd1955a1d9a9310279f2d07288"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text_reading::lines_of (cognitive 25): pdfcraft_edit::text_reading::lines_of has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text_reading.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ab47e4cd91b91bc4563084b1d97f06a56e5c23ce1c16f57347da1012b45234"}},{"ruleId":"D2","level":"warning","message":{"text":"Sheet::put_row (cognitive 25): Sheet::put_row has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/xlsx.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05be09ccb26901c091e3033e3393585413a0e5d664dcc45323f6ddcd3f34828"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_export::pptx::table (cognitive 25): pdfcraft_export::pptx::table has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (8 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/pptx.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"103d7bbb5ad70b72b447f35b67bd631b077601e634e51bbba647f64bd46e04c2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::walk (cognitive 25): pdfcraft_forms::walk has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (18 pts), loops 2 (3 pts), boolean chains 2, match/switch 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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff55b447e3e3fe5d7e24b34db3e937e4852cfebb5c172c2d50d0cce096ac574"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_oracle::pixels::unmatched (cognitive 25): pdfcraft_oracle::pixels::unmatched has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (10 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/oracle/src/pixels.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"56fb059afef0c140b87eecb3debd1618e26c6ddcce8b29bf23272a4691ad29de"}},{"ruleId":"D2","level":"warning","message":{"text":"Copier::fix_annotations (cognitive 25): Copier::fix_annotations has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (8 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":"engine/crates/organize/src/import.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34ae41229ef9efc6a0c12caa19842015e7fa9ee52aefae1d1407a70664567f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope::layer_hidden (cognitive 25): Scope::layer_hidden has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8169d9e5163b02e7315768639807dc833c62c2e829cf140476ae409fa44b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::interp::clean_replacements (cognitive 25): pdfcraft_redact::interp::clean_replacements has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (8 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32361b6bfa1c57d0200c0a0cfdb7230f92165daeb27c744381dd7d8f70c0bd2"}},{"ruleId":"D2","level":"warning","message":{"text":"OcspResponse::parse (cognitive 25): OcspResponse::parse has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (5 pts), match/switch 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":"engine/crates/sign/src/revocation.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8141d987e051003577fa2adabb3b9a35dbd112703423daadbec87df081720daf"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pkcs12::bags (cognitive 25): pdfcraft_sign::pkcs12::bags has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pkcs12.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a901339b641767c61f1444c76437a64ac45e0bf8746c72b33a75825a97f3f94d"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolsKt.toolGestures (cognitive 25): ToolsKt.toolGestures has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Tools.kt"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02e9d814114e3acc7c9db3b4d841efbf36d50f51c234d1f69044ea8a7a5a633"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::links::email_at (cognitive 24): pdfcraft_annot::links::email_at has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 9, loops 4 (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":"engine/crates/annot/src/links.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f23097a1a68e560c219106faefd42092af054bb6bc0a025c396198bc32c966"}},{"ruleId":"D2","level":"warning","message":{"text":"Discovery::walk (cognitive 24): Discovery::walk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 7, loops 2 (6 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":"engine/crates/automation/src/batch.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23244356515c0f33a9e43f45ce537085d99b64ebe77eecd4da0158fbc3c92d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::text_find_with (cognitive 24): Automation::text_find_with has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), match/switch 2 (4 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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9c6a8ae4655e4a188bf854a7f07b3c699f53e092b9aa69007064d6c17e467c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::pptx::custom (cognitive 24): pdfcraft_create::office::pptx::custom has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7316b37b3e91626100f7b0a1537c98bc13026bcbba6e5488c5091664993c207"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::covers (cognitive 24): Planner::covers has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 6, match/switch 2 (5 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"5744c3dc4a972791ec4979229e998eb134711facf6a2a73eeefa6c7fec67b35c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::vertical_encoding (cognitive 24): pdfcraft_edit::text::vertical_encoding has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 3 (10 pts), boolean chains 2, 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":"engine/crates/edit/src/text.rs"},"region":{"startLine":3541}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc717a2da6e5ce2cc206d46e155467d838f547bc4cf2167f38ab6646d4a0e5fc"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::camera::warp (cognitive 24): pdfcraft_engine::camera::warp has cognitive complexity 24 (threshold 15). Drivers by points: loops 4 (11 pts), if/else 4 (9 pts), boolean chains 3, 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":"engine/crates/engine/src/camera.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1e0ad36c7aa65ab49326d3ebacb14c7782c9842f30b56b332e15c790dcdcd9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_fonts::source_shaping::shape (cognitive 24): pdfcraft_fonts::source_shaping::shape has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/source_shaping.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0712c0cfc432fedbed380d7e634074bf52abaf8b69c551155db664aeb2e21b7"}},{"ruleId":"D2","level":"warning","message":{"text":"FieldTable::cells (cognitive 24): FieldTable::cells has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 4, 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":"engine/crates/forms/src/table.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50ad0669ee8a035e49ee628c37b7c020d2d4c021e1c6291fbc1fb78f27dba11"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::button_action (cognitive 24): pdfcraft_forms::button_action has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (18 pts), if/else 2 (3 pts), loops 1 (3 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"148bb2ff3590c6a39579c77470a4a7278d9a0b9abacb6e4f0212f02599f2cdbe"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::af::format_date (cognitive 24): pdfcraft_forms::af::format_date has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (5 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":"engine/crates/forms/src/af.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3403bd03d605d80c159465e56f20f12aa9bb6980f1eecebab14796fb1e718597"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::author::add_field (cognitive 24): pdfcraft_forms::author::add_field has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 7 (8 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":"engine/crates/forms/src/author.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ef0c667dfd591650928760ace09c77a648e9be6c4de1d9ba89ae54db5ba61e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::author::duplicate_field (cognitive 24): pdfcraft_forms::author::duplicate_field has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (6 pts), match/switch 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/author.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f0443999717ea0c0c194a7d5179ffb23b1b8e3fe3cfdeafab23478e28d6d36"}},{"ruleId":"D2","level":"warning","message":{"text":"Interp::member (cognitive 24): Interp::member has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 7 (14 pts), loops 2 (6 pts), if/else 2 (4 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd72b76a9f044487e71f4c2b6b427b3cfcb39d254bfd554fdaecfa4822f43d4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::printx (cognitive 24): pdfcraft_js::printx has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 pts), match/switch 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":"engine/crates/js/src/lib.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c8afafdbd2b8f70a4b0083812f465278290e6a724858326846602e7eb56d22"}},{"ruleId":"D2","level":"warning","message":{"text":"Geometry::snap (cognitive 24): Geometry::snap has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 7 (10 pts), boolean chains 3 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/measure/src/snap.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b1500b4d8c94d784da86151562079557f013990ff4d5df335e95babf92b6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Walk::content (cognitive 24): Walk::content has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/images.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc90d139a2a4581d0cf01f1d3a33b5c773694952cc35e05d37ab3de2d4a367b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::audit::audit_space (cognitive 24): pdfcraft_optimize::audit::audit_space has cognitive complexity 24 (threshold 15). Drivers by points: loops 8 (13 pts), if/else 8 (11 pts) (nesting depth added 8). 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":"engine/crates/optimize/src/audit.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a2d5b90058a687ddb593970e6ed802fd4f57a1624f366d4995ef701d942130"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::tags::clear_ancestors (cognitive 24): pdfcraft_redact::tags::clear_ancestors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (9 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/tags.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b3f418ddc5018d1dc9a8dd2058eef89fb93caa837c715af539070cf440bf9b"}},{"ruleId":"D2","level":"warning","message":{"text":"Structure::get_page_fonts (cognitive 24): Structure::get_page_fonts has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/structure.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"877bccbd911f55b1984c8daa2a3d1cb443ce6175cf04a57ca42426e28c2f237f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_render::transition::frame (cognitive 24): pdfcraft_render::transition::frame has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/transition.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec492de06b6ed54bad61dc769da51d7505c9c3d3f2f4ace3ad3ff24bde7c41ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::children (cognitive 24): Walker::children has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (7 pts), match/switch 2 (5 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":"engine/crates/xfa/src/script.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f7a9b56832e4164545d077bc4701a7363fbb7bed924ed7d7676d27162cf4be"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlsKt.GlassToggle (cognitive 24): ControlsKt.GlassToggle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 21 (24 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Controls.kt"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d97108c56a3ea425aa179326e79c29a1e9f4ece070742fd7e063e4dd9960e3"}},{"ruleId":"D2","level":"warning","message":{"text":"TabsKt.GlassTabs (cognitive 24): TabsKt.GlassTabs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 22 (23 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Tabs.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1980e5ff60c5482a83578e83e33bc8234801fd8f44a2be118c0a2b2be1c9994"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetGridState.loadBlock (cognitive 24): SheetGridState.loadBlock has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"457ecf8db5f13cef8a9b7fbef6b4d1a37988ea8c4b599d7408148deeebd10f35"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::alt::clear_parent_tree (cognitive 23): pdfcraft_a11y::alt::clear_parent_tree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 1 (3 pts), 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":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6157e5638694b57a5566ec0b09504c8f01d1c96f970cff2354fe9ad15f3196b"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::doc_batch (cognitive 23): Automation::doc_batch has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, loops 3, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/batch.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9be581b5fabeb2083942e7097fa9546f9cc014b9f415bdfba19a038f7344c5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::pptx::render_slide (cognitive 23): pdfcraft_create::office::pptx::render_slide has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 4 (7 pts), boolean chains 4, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7be8126bfc8246da03cf4456bb6697f1d86507343335328a62bd6747d04991"}},{"ruleId":"D2","level":"warning","message":{"text":"DetectionPath::rectangle (cognitive 23): DetectionPath::rectangle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 8, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/detect.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"67408f8a6d3a07ce8eaea43b5b755b0f8aad677c4e6e8019cd9e35ded6e5778c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::adopt_page_fields (cognitive 23): pdfcraft_forms::adopt_page_fields has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13a35008fda6821cb6fc78e1edaaba4a447d6f89d9f51cf88abdf6268e7d944"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::recalculate_with (cognitive 23): pdfcraft_forms::recalculate_with has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/lib.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a308ac759786c6963bc8c62f2548f020b4adb003a9907ec6ef4649b132e8f8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::detect::raster::runs (cognitive 23): pdfcraft_forms::detect::raster::runs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/detect/raster.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"374f07071e5e928452ea71b8c052b408085130cde49f5a61a06c88b4d06da323"}},{"ruleId":"D2","level":"warning","message":{"text":"Pruner::protect_type3_resources (cognitive 23): Pruner::protect_type3_resources has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/prune.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba08a2bdcf31044ccc69fdcfd987767b098970013902af94a8ac374f17c9b52"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::boxes::set_page_box (cognitive 23): pdfcraft_organize::boxes::set_page_box has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/boxes.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc03f35c49928ecf908262bd570a3c8bb16a327b3edc4f6967d36038fc7203f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::marks_checked (cognitive 23): pdfcraft_redact::marks_checked has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 2 (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":"engine/crates/redact/src/lib.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0146591f0898ae8647adc874964680a669b548ee423f46e0280a6a71c7cb88f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector::name_tree (cognitive 23): Inspector::name_tree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (9 pts), loops 2 (4 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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"18838f8f929658c198f044e03da617bed6e393b865c544fe694a3ab07f679bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"PageText::column_text (cognitive 23): PageText::column_text has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4, match/switch 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2a35496c9393656a616dbc8e2b39e7fb7415dfc628611c8bd1afca46cd9572"}},{"ruleId":"D2","level":"warning","message":{"text":"artefact_mobile::reading_blocks (cognitive 23): artefact_mobile::reading_blocks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/lib.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6d12320a4621046797ae61144dd1e4b6d6564d7c1046e8ace053fb7ce5d8ac"}},{"ruleId":"D2","level":"warning","message":{"text":"MainActivity.collectRequests (cognitive 23): MainActivity.collectRequests has cognitive complexity 23 (threshold 15). Drivers by points: loops 14, if/else 4 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 3). 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":"android/app/src/main/java/com/chethan616/clearpdf/MainActivity.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d873c9527b7ab47998d238b9bfb04862c50dcf04d87dcc135f673e1898f028a3"}},{"ruleId":"D2","level":"warning","message":{"text":"FreeTextLayout.wrap (cognitive 23): FreeTextLayout.wrap has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (6 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/FreeTextLayout.kt"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb8687e4d92840db59eba477abab38d5aa4157f398b660fbac84ae158c5bfb2"}},{"ruleId":"D2","level":"warning","message":{"text":"FillSignKt.SignaturePadScreen (cognitive 23): FillSignKt.SignaturePadScreen has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/FillSign.kt"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"088e333fb356751893b9f3ac94c387c45fd240b4d0b3c86b1965ee807d873415"}},{"ruleId":"D2","level":"warning","message":{"text":"FormsKt.FieldEditor (cognitive 23): FormsKt.FieldEditor has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 5, loops 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Forms.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f154bb2c910105d833b52bd058b8ccdbbea390757dd3d1bb04b3d8f011b00d"}},{"ruleId":"D2","level":"warning","message":{"text":"VoiceSheetKt.VoiceSheet (cognitive 23): VoiceSheetKt.VoiceSheet has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 2, match/switch 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/VoiceSheet.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"412a01f7e680873aa65c1b8dace9370a79d8f80ca9444a23d823f86257e97dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"Checks::enter (cognitive 22): Checks::enter has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, 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":"engine/crates/a11y/src/structure.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fefe38c608eb3136bdca045bd392d1452e1fa5645fe29ecae623267a4256526"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::alt::elements (cognitive 22): pdfcraft_a11y::alt::elements has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 1 (2 pts), 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":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1c57b75b6550a81610ad8cbedb8a706926c3ae615742888f7dbe3c6056c359"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::content::document_rule (cognitive 22): pdfcraft_a11y::content::document_rule has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 8). 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":"engine/crates/a11y/src/content.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4e5e9aebf0be40ee6adee9fc5d699627e1f0b6f205f2541bcc5b52ce6eda1f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_audit::audit (cognitive 22): pdfcraft_audit::audit has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 2 (6 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/audit/src/lib.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cbb28e72f3260aaf1aa8b6fcb3510d087402e3deee7f7ff3fec1fa2b8ee63c"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::doc_split (cognitive 22): Automation::doc_split has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b75e68e9a490f7b8031be2a254d159ad4f67e0b83a921a2369a267993fdb7a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_content::comment_edges (cognitive 22): pdfcraft_content::comment_edges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (5 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":"engine/crates/content/src/lib.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe68a0af7c63147eb15da7cf7dca41c9922d920043c19d4b0c3ed92f88f4b02"}},{"ruleId":"D2","level":"warning","message":{"text":"Numbering::parse (cognitive 22): Numbering::parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (6 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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b29f0bc88dd97eb10b0a3578dc4d97da3e9b34a7910ecfa32b3099fe9d3761b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::xlsx::sheet_images (cognitive 22): pdfcraft_create::office::xlsx::sheet_images has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 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":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42d3051f085bbfd0b8dfaf7db0c588a7a7f5bae4ff6b589d6ae07751686c12b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::added::scan_markers (cognitive 22): pdfcraft_edit::added::scan_markers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 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":"engine/crates/edit/src/added.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ade778faf4df23ace9e6ebee15f3940809b766560fae99c42c1d441e75411da"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::added::validate (cognitive 22): pdfcraft_edit::added::validate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, 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":"engine/crates/edit/src/added.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5976192ff96b9719e86a5a326434ea596db692239c22b353be3e3d27dfa58fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Runner::set_value (cognitive 22): Runner::set_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/xfa.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4d89d8260b984c55ab3c6357a7a816d6450ff7fb446c099998dba6cd0f9129"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::calc_order::components (cognitive 22): pdfcraft_forms::calc_order::components has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/calc_order.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b947528010b00bbd7047425c10fd68d85db899d67a5342e26e8c90d5ee24908b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::table::cell_name (cognitive 22): pdfcraft_forms::table::cell_name has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/table.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0811ad21fa920187a1d2827e4904aff1453bc077ca01d7bbaff5059a0b3250"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::links::remove_invalid (cognitive 22): pdfcraft_optimize::links::remove_invalid has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 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":"engine/crates/optimize/src/links.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8121a6db2bf9ffe4871840ce404b037917dfa8e8af03db1a97ce64a119093870"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::import::field_roots (cognitive 22): pdfcraft_organize::import::field_roots has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 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":"engine/crates/organize/src/import.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8ff52eaf0864218761bd63fbc8288bfb8d390110880faf15f0ccd8019c1f52"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::view::set_initial_view (cognitive 22): pdfcraft_organize::view::set_initial_view has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 8 (9 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/view.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56d0f7a960bfc3b2e8921b3297a9cda69c57eff1bb94efc3f5500a6a67ef6ee"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::interp::strip_hidden_layers (cognitive 22): pdfcraft_redact::interp::strip_hidden_layers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f97d41bbc877df3da59317140da0ab5a37c27f798aadf47f76f74ce03d896d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::dss_walk (cognitive 22): pdfcraft_sign::pdf::dss_walk has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (10 pts), loops 3 (7 pts), if/else 3 (5 pts) (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d46257c1698b012a40fca3593d35e2a878ecff80f46955f75ed24c9120dc9d8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::parse::parse_rich::walk (cognitive 22): pdfcraft_xfa::parse::parse_rich::walk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/parse.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1e7a2b8beea007ac3cf32dacdc7277735922445d944d213947a3b3138ba099"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::parse::parse_value (cognitive 22): pdfcraft_xfa::parse::parse_value has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/parse.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e41c86c9ab8c64646206cecd1de711aeac8970cec5000d565e80fae879d096"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfdf::walk_fdf (cognitive 22): pdfcraft_xfdf::walk_fdf has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 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":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc2266fb66bca1fe773415276e0d6edce2b37aebc82cd8efd1b42e21d7eec4b"}},{"ruleId":"D2","level":"warning","message":{"text":"MindMapKt.MindMapPreview (cognitive 22): MindMapKt.MindMapPreview has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17 (21 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e25da456004323926498c138192f04512a0cc4c180f47af3562c4b42712d96b"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerScreenKt.drawNotes (cognitive 22): ViewerScreenKt.drawNotes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerScreen.kt"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48140ed91bf47e64db9b4d759c679ed16669d9261507c63f6226948f4197388"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::appearance::line_end (cognitive 21): pdfcraft_annot::appearance::line_end has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 1, match/switch 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":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c38a4473f02964059c5c95d9ffa89d9f572f1026bba729931e858ed89de459f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::appearance::line_layout (cognitive 21): pdfcraft_annot::appearance::line_layout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 6, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa95fe9055983cb1c8903f84912834342b54e24bf4b9d0388381854f421a286"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_cos::parser::parse_indirect_in (cognitive 21): pdfcraft_cos::parser::parse_indirect_in has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (9 pts), loops 1 (2 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":"engine/crates/cos/src/parser.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0c914a8488227554be26d184e30b06421fc32efee20c5906ea4d62b25f11c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::tree (cognitive 21): Renderer::tree has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"0297ba6bd7e9a4fed2030cea600e5302d0d1ca3957d6e672d78c073c0f21abc1"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::shape_inner (cognitive 21): Renderer::shape_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, match/switch 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5879c150ed80f57423322c91597fb2320b296eefa53a7850bd478afa8ddcad"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::added::type3_shaped (cognitive 21): pdfcraft_edit::added::type3_shaped has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (7 pts), match/switch 2 (3 pts) (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":"engine/crates/edit/src/added.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4083bab44593312ce22934cd01936451368e15d9c467fe41e9795b2255aca3a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::inline_forms::apply (cognitive 21): pdfcraft_edit::inline_forms::apply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (7 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ba8398ea6d5f179bd9fb38d79a5e80ce961a196328d2dcec83829d72e86f83"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::signature_scan::label_components (cognitive 21): pdfcraft_engine::signature_scan::label_components has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (9 pts), boolean chains 2 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/signature_scan.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cb0d5993928f2909cf2f8020d0ac24b8265357422c9171cb8f9d18c5b2a049"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::af::notation_tokens (cognitive 21): pdfcraft_forms::af::notation_tokens has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (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":"engine/crates/forms/src/af.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4919db82a8b8ca383acaa536db302ffd52e49c26d12c77e98fb01b794db8be"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_print::text_direction (cognitive 21): pdfcraft_print::text_direction has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 1 (2 pts), 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":"engine/crates/print/src/lib.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f7f2747c3ba85a032169b94d64a0ec9cd84213382df432f4de3e6ebc5f7060"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::x509::build_chain_noted (cognitive 21): pdfcraft_sign::x509::build_chain_noted has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/x509.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"c181f9239bfbed5343397b0526e945b91ceede1d838dada0c956bf9e9fa5cef9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::data::acro_password_fields (cognitive 21): pdfcraft_xfa::data::acro_password_fields has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (2 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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa3593b2c3e13991664593c5a09124d8346934370a0277c6018e8327f302a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"MindMapKt.parseOutline (cognitive 21): MindMapKt.parseOutline has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"19213a9b8749facb32f9de7d2143ec7b10d4956eb3b22cd7f7d574526bf68d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolsKt.DrawLayer (cognitive 21): ToolsKt.DrawLayer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 3, 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Tools.kt"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa991a50759112c06e90a0182317af60d7199b355cf4b7468e8b23347a834285"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerSheetsKt.DocumentInfoSheet (cognitive 21): ViewerSheetsKt.DocumentInfoSheet has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (19 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerSheets.kt"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9e2f13de2e8a6d57ab6c28ce22b31438e6c61d1fed10ff2fb7ae06be951d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_audit::annots (cognitive 20): pdfcraft_audit::annots has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 4 (7 pts), boolean chains 3, 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":"engine/crates/audit/src/lib.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71c2e70387992c1c2f2acd0df998d74950ffa274f43c5f3a77a8f618f53fc58"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::page_transition_set (cognitive 20): Automation::page_transition_set has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 5 (10 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dddde2379d5a76640ef467c3f27a12e23c814c8217b2f146aecb2564eccd60"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::doc_print (cognitive 20): Automation::doc_print has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8 (11 pts), if/else 6 (8 pts), boolean chains 1 (nesting depth added 5). 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":"engine/crates/automation/src/printing.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"192a71c8e0636a9bae060208150fdf7eec642e9178a280254c39e412f483ae93"}},{"ruleId":"D2","level":"warning","message":{"text":"McpServer::dispatch (cognitive 20): McpServer::dispatch has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/mcp.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bcef5274cd5e24d7fa2909ab505e042d2344f7d8a4b104fa61c015586ebad9"}},{"ruleId":"D2","level":"warning","message":{"text":"Numbering::label (cognitive 20): Numbering::label has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3, match/switch 1 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8efdebe0281e02ed5926be3f4700d21499c17cd398c4923752b51f4e5a59a4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::extract::extract_images (cognitive 20): pdfcraft_create::extract::extract_images has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/extract.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0f49bbcf18455d1f4cf0908eb7139bb85e30d1c5e20be205d7052d3c627389"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::draws_text (cognitive 20): Planner::draws_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebeda330539e23fdcf454f71042aca6891aa37e3a54e09583701e41f64b05d96"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::objects::checked_streams (cognitive 20): pdfcraft_edit::objects::checked_streams has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), match/switch 2 (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":"engine/crates/edit/src/objects.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f0a547823ff40969316e844886153a393d457b370dc2ae28b6414fcb3c92d5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::edit_script (cognitive 20): pdfcraft_edit::text::edit_script has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), boolean chains 4 (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":"engine/crates/edit/src/text.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"349cd0be19b58cf721c2474162b5fb9c1c746153ddfffad67a66f03fab793d79"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::reveal_ops (cognitive 20): pdfcraft_edit::text::reveal_ops has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":3466}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfaa4559fd9bdb519f42f86f6ee17ab386d4b0e7477cc3b488b1577e61685b8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text_reading::segment_line (cognitive 20): pdfcraft_edit::text_reading::segment_line has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5, match/switch 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text_reading.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e4fce9f3f275647fd8968eef207566790d9a3ef99288455d0f1626d50e1845"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintReadiness::text (cognitive 20): PrintReadiness::text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), loops 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/printcheck.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f911c52fc9c0bbe3620eb966b2a63d864542963bdd8e197049dc3ae0ed30720a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::comment_summary (cognitive 20): pdfcraft_engine::comment_summary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":5563}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd49771444affcf2088b57ce06eac4b2d253f34aca6b54ca058be0813bbaa1aa"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::scan_colours::sample (cognitive 20): pdfcraft_engine::scan_colours::sample has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 4, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/scan_colours.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"221687f8730858239fd310e2492404c33a40bc06b8916e7971364de46a6e7468"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::signature_scan::extract_ink (cognitive 20): pdfcraft_engine::signature_scan::extract_ink has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, loops 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":"engine/crates/engine/src/signature_scan.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e577d1210d616afa5ab7fe1949a7e3e35946c50fd4fd333e52ef9edf901821"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_export::xlsx::xlsx (cognitive 20): pdfcraft_export::xlsx::xlsx has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (5 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/xlsx.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e26757cd14d455c3355f7f6317c8e20441cf91c92a70822a6ae129d36499a7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_filters::lzw::decode (cognitive 20): pdfcraft_filters::lzw::decode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), match/switch 1 (2 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":"engine/crates/filters/src/lzw.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbb313c50b20c6635f53391854a98d478eac6fe8244d1ae92881fc41f6c0d56"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::scan_parts (cognitive 20): pdfcraft_js::scan_parts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/lib.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a3df1ddf188c510b9305f37313e402529155d8666f574d37fd77f93d374efe"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::formcalc::format_date (cognitive 20): pdfcraft_js::formcalc::format_date has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (7 pts), match/switch 2 (6 pts), if/else 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"815c1b8e2a6d5ca2f95c1c16ab6a2a13becb2006f2b68d8277700e250a8c2f08"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::images::run (cognitive 20): pdfcraft_optimize::images::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/images.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"118a0515775e71df88b8fb963c1410f6c2e650e047669e1b9724e2cf1d2c25a7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::links::tree_entries (cognitive 20): pdfcraft_optimize::links::tree_entries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/links.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9103cf4b6c07dab34196aa7c0d129514e2169d17dffc9021f23e2e2ffc14e4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::unused::data (cognitive 20): pdfcraft_optimize::unused::data has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, match/switch 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":"engine/crates/optimize/src/unused.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7222d149c39539522482c691632e80ecb5c1efc4f3989ff23e0f5b4e9ccbec9b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::prune_tree_node (cognitive 20): pdfcraft_organize::prune_tree_node has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/lib.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadc47162c15d40dd092f0f7835fab7824e0634e3fe3431387aeb827d7d6be09"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::drop_widgets (cognitive 20): pdfcraft_organize::drop_widgets has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/lib.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"26733eadb94e55c6e605e71b3b1bd89e4471b00140570a748b9010e42e18e8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::import::field_and_widget (cognitive 20): pdfcraft_organize::import::field_and_widget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/import.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7390378d7d3436ea06a3d1d6d48127e24c285adbff3af90de61a1fd004708e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_preflight::content_colour (cognitive 20): pdfcraft_preflight::content_colour has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/preflight/src/lib.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdbb94b08e3ac77fd95d80e8b3878cbf4acd8ed681d1f5a72249364eebd227b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_render::inspect::inspect (cognitive 20): pdfcraft_render::inspect::inspect has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (5 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/inspect.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60f981f8b04602281055f1299809bb87d1046f64775db832f949a5dcf469ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"Certificate::parse (cognitive 20): Certificate::parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/x509.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d093ec314308ded70e7ae11084ea0d54e2c98409dcdbf2949d26eda32e367ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::layout::divide (cognitive 20): pdfcraft_xfa::layout::divide has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (19 pts), 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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f139a145ba9247fa183a09b752fcd84f0b2cea61af6fce9ecded4e84c66018f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfdf::place (cognitive 20): pdfcraft_xfdf::place has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fb1c18e4f2ca565bd00500c8d8169544219b353171d155bbd44980eb8081a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentsKt.PdfField (cognitive 20): ComponentsKt.PdfField has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (19 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/Components.kt"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6fc1c6918e83bfb59a072e4e7463e4b6572fe2faae8c8a799b167a752d17b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Checks::exit (cognitive 19): Checks::exit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/structure.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d61f0ee707f44d55aac507bf34f13516fc4e258a01d6e911195de9f1b962c9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::tags::set_tag_property (cognitive 19): pdfcraft_a11y::tags::set_tag_property has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/tags.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"771e0bd2f2dd85fadeedbc504b5e64751be73b160ce7d9f223070ba84bd90656"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::comment_edit (cognitive 19): Automation::comment_edit has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"engine/crates/automation/src/comments.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19884c3cf260a1afb74b45291ff2f8f7c8d530ca6ff1d596c4df8648aeb6ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::doc_initial_view (cognitive 19): Automation::doc_initial_view has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 5 (9 pts), loops 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34348a5f0b91e1d375d8037adc566af384e74653257ae694c45c40446e8ebca"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::jpx (cognitive 19): pdfcraft_create::jpx has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/lib.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb30eb838c2bd846839b5f39f7cea4e16e644b2e8c29d97c2971997588916b1"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::tiff_pages_within (cognitive 19): pdfcraft_create::tiff_pages_within has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 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":"engine/crates/create/src/lib.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7226e83372c488e70db641d0cf873a9d9b31533d6791751d1a00333969bc5f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::docx::apply_run_props (cognitive 19): pdfcraft_create::office::docx::apply_run_props has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"982d49908596f223625fccd01537c06ca659f59a58e92c6d022d30865b30a144"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::space_rgb (cognitive 19): pdfcraft_edit::text::space_rgb has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 6 (9 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e483a9b589f462c16061061e48a7eaf1ac595b3e055135809c0b0af9ed166f3"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::replace_line_inlined (cognitive 19): pdfcraft_edit::text::replace_line_inlined has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 1 (3 pts), boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":2634}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6932eebdb72aa7a8e6bcb798476b94b3dc4b2767ad08ad3e6e68d247596305e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::clear_block_inlined (cognitive 19): pdfcraft_edit::text::clear_block_inlined has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, 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":"engine/crates/edit/src/text.rs"},"region":{"startLine":2847}}}],"partialFingerprints":{"codehealthFindingId/v1":"66053f9ce1ac7ddc3427d69dc9799791a3a051c008ae737d72048260e981b340"}},{"ruleId":"D2","level":"warning","message":{"text":"Document::export_pages_checked (cognitive 19): Document::export_pages_checked has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 4, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/compare.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c8fd588338c12db15fb22d0a67d3afefd0b330029e164311181fb7afadc716"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::undrawn_notices (cognitive 19): pdfcraft_engine::undrawn_notices has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, 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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"9748214bea3217c17ad4ae1cbe4fe4c374247a7f310ae1d4b253514ec0de1253"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::shown_under_redactions (cognitive 19): pdfcraft_engine::shown_under_redactions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63d7de302456d59f0224e7ea677dee7e050fcd603be017407fb47ba8444157b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::check_permission (cognitive 19): pdfcraft_engine::check_permission has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41d0e17a62d4f868d1927b276efac262a3cad75ec35bc7fc954fc7c22b1a38e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::camera_edges::shrink (cognitive 19): pdfcraft_engine::camera_edges::shrink has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (9 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/camera_edges.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dadd965f7cfe7e215f45d601545f7a71da06118bc365ad6326fdae15913be4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::clear_password_values (cognitive 19): pdfcraft_forms::clear_password_values has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29c1208668c60b72270cab8e1c2bfc6ca074d9d1a15486c9deeb234e5e27f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::appearance_inputs (cognitive 19): pdfcraft_forms::appearance_inputs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/lib.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1532409f6dbabe3eabf5ac834dd00372e56276fae73cb4ef1f05173f8e3f41"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::detect::label_for (cognitive 19): pdfcraft_forms::detect::label_for has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 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":"engine/crates/forms/src/detect.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"452e959438b8bb3a7823737aace092ed4598bae4d4bca45a99c147e2b0e84f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::formcalc::parse_num (cognitive 19): pdfcraft_js::formcalc::parse_num has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, loops 1 (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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7cb567675181a5108064e5379c52198722a211819a00ad45c1aaf3adcafe181"}},{"ruleId":"D2","level":"warning","message":{"text":"Walker::walk (cognitive 19): Walker::walk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (5 pts), loops 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":"engine/crates/measure/src/snap.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc1ca34f778e6e216b4b94650c07bd3ca8699631e34f58c6f166cc9c0795fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_measure::validate_geometry (cognitive 19): pdfcraft_measure::validate_geometry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/measure/src/lib.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ef6d4b99684a73f8a3e70b4e69aae925db745dbe318216c7a4464380c7e0aa"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::view::initial_view (cognitive 19): pdfcraft_organize::view::initial_view has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 7). 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":"engine/crates/organize/src/view.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8225dcd46cfdeaedbb867fb57bb9b4a01d896cbd4eb4026b7175fd89521277"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::patterns::date (cognitive 19): pdfcraft_redact::patterns::date has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/patterns.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"37398eba066d3125e5b64867e9652e338f00adfd237b6d9b09959c73f884fe74"}},{"ruleId":"D2","level":"warning","message":{"text":"SignedData::verify_signature_noting (cognitive 19): SignedData::verify_signature_noting has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 1 (2 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":"engine/crates/sign/src/cms.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"a615e71b566fcb2a36d3270779b61fbd7e2299f7c2e1d5056855d4de1bdefdfa"}},{"ruleId":"D2","level":"warning","message":{"text":"OcspResponse::check (cognitive 19): OcspResponse::check has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/revocation.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cef7000e66d0735f4e4640570d8e35521935e11ccd2662c2423b409bb0e676"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::sig_fields (cognitive 19): pdfcraft_sign::pdf::sig_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"77608270e889469f3b0e51d7e9c0b1d48b36ac909a35764e617eb4ead51a485b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pkcs12::open (cognitive 19): pdfcraft_sign::pkcs12::open has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 4 (5 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pkcs12.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aed0a32b02e82f6d17d8b2599db3efeb7ccd483e3c825c3a0573a0b0d3467bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Layouter::flow_table (cognitive 19): Layouter::flow_table has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"968c1946069acdf0ae2b68e00d14a6dcc15f1ed5c332401dfc32aeeed20b8c2a"}},{"ruleId":"D2","level":"warning","message":{"text":"SlideDeck::page_text (cognitive 19): SlideDeck::page_text has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 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":"engine/mobile/src/slides.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6264e73a5fb602a93e862ca9788dfe88f0347f3e49e8f9aef1ac2cb09b8a9813"}},{"ruleId":"D2","level":"warning","message":{"text":"ClearAppKt.RouteHost (cognitive 19): ClearAppKt.RouteHost has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/ClearApp.kt"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf4980a4988e30baef08b07ee5137d77bb3c0af2743d2ed8ea101bbcfddfcb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Haptics.fallback (cognitive 19): Haptics.fallback has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Haptics.kt"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a27f99e6edf0370864a43540d3f8d6c64ed86531ad856a0cf8d24a393149fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentListKt.CommentListScreen (cognitive 19): CommentListKt.CommentListScreen has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentList.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf931a72dc8968d9931a0858651a3da946882339a8f99494cfafaabb1867c10d"}},{"ruleId":"D2","level":"warning","message":{"text":"EditKt.SelectedParagraph (cognitive 19): EditKt.SelectedParagraph has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03803369caa3c44f62a0c36522e9de9e02d65de7b94aa3f843419e730b7dc47"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewerSheetsKt.MoreSheet (cognitive 19): ViewerSheetsKt.MoreSheet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 19. 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerSheets.kt"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1025b15b47ee672c4141eb76cd213eb9bd6acbc27087c7730d5189b31dbe70"}},{"ruleId":"D2","level":"warning","message":{"text":"WidgetCards.pill (cognitive 19): WidgetCards.pill has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17 (19 pts) (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":"android/app/src/main/java/com/chethan616/clearpdf/widget/WidgetCards.kt"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac1c527865341ec36391045fcd0ec88b0ba441d5e18133db4dd3ba5bf726d24"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::alt::artifact_marked_content (cognitive 18): pdfcraft_a11y::alt::artifact_marked_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (7 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8873790c16c1b595e2b3be556c0a25f2ae1bf7d4c43a7a0d196efa50c316af"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::with_missing_appearances_cached (cognitive 18): pdfcraft_annot::with_missing_appearances_cached has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"696f03ad620265375c9310ca3573572e7c3be1f55049c5a65b590ee0be3cf030"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::appearance::rich_plain (cognitive 18): pdfcraft_annot::appearance::rich_plain has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 2 (6 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a03c48613f5893eaf0698994235ba20434799f6c0d561b1bb6a1846e30adb2"}},{"ruleId":"D2","level":"warning","message":{"text":"Recipe::parse (cognitive 18): Recipe::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/batch.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6651e5b3cc439ffe3af1b38eea4ce0661d81a2fa02d854a5201513579709c43"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_cos::writer::write_incremental (cognitive 18): pdfcraft_cos::writer::write_incremental has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/writer.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b103d87b4e7e536f1afa671ed07b06696a5228a1cb31126ebd527347219bf2c6"}},{"ruleId":"D2","level":"warning","message":{"text":"ParaProps::merge (cognitive 18): ParaProps::merge has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad8258dbfc3cd36c03fc587044eae8970b585046c4c489a93d063d8325e5712"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::vml (cognitive 18): Converter::vml has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 1 (2 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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a71ce0198ac2dcfd852f6b865a0d60842230c206e18926761170dbce5b9b98"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::flow::pieces (cognitive 18): pdfcraft_create::office::flow::pieces has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), match/switch 1 (2 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":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbcfbacc60c93b599d28cd6e383da2e2d2045600e57365ed275c93fed47793e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::xfa_after_data_change (cognitive 18): pdfcraft_engine::xfa_after_data_change has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3489}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c08e3b39dd6a472027464517bb9989d5f022ba22a3332cc1d8c77f455b5dfd"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::copy_image::collect (cognitive 18): pdfcraft_engine::copy_image::collect has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 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":"engine/crates/engine/src/copy_image.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bb4de1ca4d1305e2a9988e96667e49b2845e8af12470d670b053171b7345c3"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_engine::dates::format_day (cognitive 18): pdfcraft_engine::dates::format_day has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/dates.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"9404d12451791fdb2075e2b9953a6759a28f78950d32cb90f8e1b6ddf4e8afab"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_export::xlsx::plain_number (cognitive 18): pdfcraft_export::xlsx::plain_number has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/xlsx.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b205594e48006c35acab5f46f6510bc7bf67e8637c427f99a779c4c913085f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_fonts::script::script_outline (cognitive 18): pdfcraft_fonts::script::script_outline has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, 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":"engine/crates/fonts/src/script.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8621a5b9a916ca84db0efb0055adaa46fb59eeb6403fd5454a8d41b95dcd6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::string (cognitive 18): Parser::string has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 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":"engine/crates/forms/src/af.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c66e1bb26ccfc9b495eee3617b27d78b836530ce29a4cf38d05e9f224a51aa"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::author::patch_da (cognitive 18): pdfcraft_forms::author::patch_da has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/author.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfbb5b8f8dbf49bffd8a8b3913f8acfaee54ad9635617dc840f65f4ba615f00"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::calc_order::fixed_order (cognitive 18): pdfcraft_forms::calc_order::fixed_order has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (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":"engine/crates/forms/src/calc_order.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"444d0043b4973a556ccf76f5477e3b4be0fc838afe4f2575deff8f361797a629"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_geom::perspective::solve8 (cognitive 18): pdfcraft_geom::perspective::solve8 has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (8 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":"engine/crates/geom/src/perspective.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd294cb4642be5045e3d3d6bbcd2015551fb1bd92c31f3d43cbdf102cccbe6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Interp::node_member (cognitive 18): Interp::node_member has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 5 (8 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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9062bb755c2ac46c66cb06144bc8f83a60d0cd8ab8d7631593aa2e8ffc5d86c"}},{"ruleId":"D2","level":"warning","message":{"text":"Copier::copy_dict (cognitive 18): Copier::copy_dict has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, 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":"engine/crates/organize/src/import.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b186db2e91288e2bf249363d0a605b84a461d77d15df7f2fd3edc75d802951b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::drop_destinations_to (cognitive 18): pdfcraft_organize::drop_destinations_to has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3, match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/lib.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64cd334540b58fe685f3f5d76ba643425f2fcfd26d092a81bcf6cf251c06422"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::transition::set_transition (cognitive 18): pdfcraft_organize::transition::set_transition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/transition.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ba84486c58565d346ac9dc5e5535f01105c6bb2c17f152f595574bd00cc53e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_preflight::uses_device_colour (cognitive 18): pdfcraft_preflight::uses_device_colour has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/preflight/src/lib.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"168648179544fe904f354a00ce03eb19daa05ebfb99d52fd67fb17c58184f09a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::interp::content_draws (cognitive 18): pdfcraft_redact::interp::content_draws has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 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":"engine/crates/redact/src/interp.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6ffbccd23e15044c41aa28525d697a1d56b18bfe63d9a534b6018aa39b0c38"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::patterns::credit_card (cognitive 18): pdfcraft_redact::patterns::credit_card has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/patterns.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4b0fb9b9a76f7002dd506d15949ecb689342c750295836804875bf3e0adaa0"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_redact::tags::by_mcid (cognitive 18): pdfcraft_redact::tags::by_mcid has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (7 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/tags.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ad0402d1926f0e342ee0f0cdffa7baaa5f7438710968207a3afff3220f26f7"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector::name_tree_raw (cognitive 18): Inspector::name_tree_raw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (4 pts), match/switch 1 (4 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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce3db370143ce356ba551ea3a9bd7733803e1d3644543d5353ba8f9a0614d00"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector::fonts (cognitive 18): Inspector::fonts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f5f39ec6fe931d0afb50d1a372921bb0bfff9a642dcc31c2fc79a0d50cf880"}},{"ruleId":"D2","level":"warning","message":{"text":"RenderPool::watchdog (cognitive 18): RenderPool::watchdog has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/raster.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b11371999d8d59fcfcca0f9cc2b3ea6954beaac75843de40d40df33772254f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::check_dss_revocation (cognitive 18): pdfcraft_sign::pdf::check_dss_revocation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bd98fb53d4ab85e2cec3273a03ac49cd8b3bfbfb511e714940761983f0ce60"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::x509::load_certificates (cognitive 18): pdfcraft_sign::x509::load_certificates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/x509.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7ed6a6bef6dbec680a0cac7214eac1c55492dfabf7fed4a7f0ae4fcc21a71f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::pdf::signed_fields (cognitive 18): pdfcraft_xfa::pdf::signed_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f38b2125b5754876b797a7e2614557383845410e425c8417d19e08893f06792"}},{"ruleId":"D2","level":"warning","message":{"text":"MobileSession::widgets (cognitive 18): MobileSession::widgets has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), loops 2 (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":"engine/mobile/src/lib.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ae96ed15d520037e127e27e4a2a9383806dc9562da11a42872939c90b1b3e4"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetBook::find (cognitive 18): SheetBook::find has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/sheets.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ca2c57ab1797b735e6e932882b862473d6a78c901612c2ecd415715e304457"}},{"ruleId":"D2","level":"warning","message":{"text":"artefact_mobile::ppt::read_shape (cognitive 18): artefact_mobile::ppt::read_shape has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (6 pts), loops 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":"engine/mobile/src/ppt.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfe62d6c63e065a3bdd46a484964b6542b9e0b61215caf47f4fb156a9fc0d60"}},{"ruleId":"D2","level":"warning","message":{"text":"Thumbnails.ofContent (cognitive 18): Thumbnails.ofContent has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, 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":"android/app/src/main/java/com/chethan616/clearpdf/engine/LocalFiles.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1945d88e54d4756ed0200e54be65d8d8fa3fe5d5e9eccf9e11098b8894a8c5eb"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentsKt.SheetRow (cognitive 18): ComponentsKt.SheetRow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/Components.kt"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed92f87efdfc50c75a05b233ab35a1098dee2e3c34cc28f8c2322b480534935"}},{"ruleId":"D2","level":"warning","message":{"text":"GlassMotionSettingsKt.BezierEditor (cognitive 18): GlassMotionSettingsKt.BezierEditor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 3, boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/desk/GlassMotionSettings.kt"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ade65c3ee7f5ba70f0b74c46d08759e40b3d30dc165c36aa2951ea5c1f84c89"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsScreenKt.ReadAloudLanguagePage (cognitive 18): SettingsScreenKt.ReadAloudLanguagePage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (16 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d878394842e4cd057360b8520b47ac974f0d9b422cce4078e3212bd77dd53f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"HomeScreenKt.HomeScreen (cognitive 18): HomeScreenKt.HomeScreen has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/home/HomeScreen.kt"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff10f7f02c47e39c32e303beeb425a801a81bbeea34517538bdf9021e2fd881"}},{"ruleId":"D2","level":"warning","message":{"text":"DocLayout.nearestPage (cognitive 18): DocLayout.nearestPage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DocLayout.kt"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef3cb7da2245d60ede1d901b9200b30577f46209838e571a9acf9d68edecec5"}},{"ruleId":"D2","level":"warning","message":{"text":"PageWalk::next (cognitive 17): PageWalk::next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83cd289497ce069f65806eb7bad0ba530484e645911bad48e3999a202635d12"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_annot::links::list (cognitive 17): pdfcraft_annot::links::list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 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":"engine/crates/annot/src/links.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"116f924bb61095a8351975f5f779c038c65d0fb57e888f0d9bec1df7cd87d6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::doc_create (cognitive 17): Automation::doc_create has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 3 (5 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c50acdedde7614e79d793d20486d01c3af6e75fb426a1d81a9666232223d4f"}},{"ruleId":"D2","level":"warning","message":{"text":"Styles::parse (cognitive 17): Styles::parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"87af12790cb1a2bce87af24b6779f04b140035f444db4d2995e699d8188b83a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::setup (cognitive 17): Converter::setup has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"86201a84a3c38c2f3b6e176568ecc1658cb7a50c68e204ce863e0310e56eccce"}},{"ruleId":"D2","level":"warning","message":{"text":"Colours::of (cognitive 17): Colours::of has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"737fff907ed6b0d3d413261246b9c640cf42092d3aa7daabe9c3d013a3bc270f"}},{"ruleId":"D2","level":"warning","message":{"text":"Zip::open (cognitive 17): Zip::open has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/zip.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e88258435262dfdddf12183ce13b30dcec39cee4912f73f771fc4395eb22c5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::flow::layout_blocks (cognitive 17): pdfcraft_create::office::flow::layout_blocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfd00b26849add092ea3479d2b480138e1a626f397327ac1128dfd7f5bda6d8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_crypt::create (cognitive 17): pdfcraft_crypt::create has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 1 (3 pts), match/switch 2 (3 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/crypt/src/lib.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b185279732a847d664b14b275b4eb20cb27ac662e3a106a2e767fab521eb753"}},{"ruleId":"D2","level":"warning","message":{"text":"Planner::inline (cognitive 17): Planner::inline has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 4, loops 1, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"5feff66f27f8c9908962281afcfe1f34974520014974a8a1b8f15111ebcf9c26"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::add_watermark (cognitive 17): pdfcraft_edit::add_watermark has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/lib.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"4525aa619dbeb6ca5bbcdf313ca0f7a195f08e90a60c71db449df6a41e3bf90c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::bidi::to_visual (cognitive 17): pdfcraft_edit::bidi::to_visual has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 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":"engine/crates/edit/src/bidi.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc68ba8fa34482eb3a5a1bfd6443c3801b1c31d9d0f56eb5b4d0a721a71faa4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::images::transform_image (cognitive 17): pdfcraft_edit::images::transform_image has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/images.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72467c76260163d3a9e09cd9d46337502e84edf50c07b0015f6897f3f45021c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::images::crop_image (cognitive 17): pdfcraft_edit::images::crop_image has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 6, 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":"engine/crates/edit/src/images.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae2d749c22f068f100e7c4459456e8bd37e401ef837856a8d8c564e98807a90"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::layout_draft (cognitive 17): pdfcraft_edit::text::layout_draft has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06a00d88a3b9f70f054e6114c673d429630e2b51fb152706b65b28f29aaed1c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::enumerate (cognitive 17): pdfcraft_forms::enumerate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/lib.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bb2c34eb641be2d643952c5fa1740d77fc1c4804347a0628a998aea750eeea"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::calc_order::calculation_order (cognitive 17): pdfcraft_forms::calc_order::calculation_order has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 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":"engine/crates/forms/src/calc_order.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bb1245342c372f51fc20e42b6663075c0d910692f653fada4a9aba9f9a36c8"}},{"ruleId":"D2","level":"warning","message":{"text":"Interp::binary (cognitive 17): Interp::binary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb95bbcab55b76fa32b247f1f3ec0df0c921b74e65700749496b2359ac71681b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_js::formcalc::word_num (cognitive 17): pdfcraft_js::formcalc::word_num has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1aafe2f9efdb9854e4a426cca6a1a834e5f1c00989c498c7d2e63f549235a91"}},{"ruleId":"D2","level":"warning","message":{"text":"Pruner::protect_glyph_tree (cognitive 17): Pruner::protect_glyph_tree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/prune.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"db97e2ed246e6527b3898967a7bdb82004489ac076029ef564cb977787d33553"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::import::combine_grouped_with (cognitive 17): pdfcraft_organize::import::combine_grouped_with has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (6 pts), loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/import.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa38d6de469acaf1fe50837547e7194b451a9e65371ae8c637c833121ad6bbe9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_organize::outline::recount (cognitive 17): pdfcraft_organize::outline::recount has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/outline.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c3190df072681bb3babcc444cf103023b811363ec499f44a144914b3cc5f60"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_print::impose (cognitive 17): pdfcraft_print::impose has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). 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":"engine/crates/print/src/lib.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e479b21217e0369f2830d11b25009214bf9925678fc9d9678034c02407d9040"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector::field (cognitive 17): Inspector::field has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, match/switch 5 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"380b9450e2ccb6ea38e1620a2e07621b15fa58205bdef2cd370b4a94a1dcccc9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_render::inspect::xml_child_body (cognitive 17): pdfcraft_render::inspect::xml_child_body has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/inspect.rs"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10f6078131188652b1a503f4b6d34cbb7698a1ff74d11e6d39e4cc31996c8d9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_render::raster::render_page (cognitive 17): pdfcraft_render::raster::render_page has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), boolean chains 5, match/switch 4 (5 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/raster.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"29396377b0a489d7d2332f60904e24a85a634a224429f2fb647f35360eb254f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Graphic::draw (cognitive 17): Graphic::draw has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (6 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/graphic.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"960e57ee3302b7e5bcd32ea997e3d30691399d27f7235ed11cf0cb04a318e9e2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::signature_contents (cognitive 17): pdfcraft_sign::pdf::signature_contents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"027673334420fa70a7ac7d95e9994b7651e029838ab0a3c0a2c87bc2acd3fe26"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pkcs12::pbe_decrypt (cognitive 17): pdfcraft_sign::pkcs12::pbe_decrypt has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pkcs12.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"89aa1f00e8c6ab7593a45b5e7a892e79fa0fbc321c992751b1b00ea27deea675"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::pdf::jpeg_info (cognitive 17): pdfcraft_xfa::pdf::jpeg_info has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e275c875f1516ab123d489a92f8587d3a1d16a98414691d6ec56f75f3fc74f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::script::refresh_value::walk (cognitive 17): pdfcraft_xfa::script::refresh_value::walk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/script.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"6098035d0787427ef76f2ac3ceb96afb0dd4367c107e451cdd6da499e9b99cee"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfdf::import_fdf (cognitive 17): pdfcraft_xfdf::import_fdf has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"429851949be72cfc77f95c44405a35f50ea426801b50e12927301d1f6827d3f0"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfdf::import_table (cognitive 17): pdfcraft_xfdf::import_table has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (2 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":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"55219bdd8b90b8a65dd6e1e040673e5e1e33adbde4e166c0abc1296be514e6e7"}},{"ruleId":"D2","level":"warning","message":{"text":"AppViewModel.openFile (cognitive 17): AppViewModel.openFile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, error handling 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"9984798ededd65247628a25b069ba2ae47f202059f418c0c802fa2c8be1c9596"}},{"ruleId":"D2","level":"warning","message":{"text":"AppViewModel.save (cognitive 17): AppViewModel.save has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, error handling 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ca0dc0021a8fce23966764d451d648623c6bac53a560ea15365f306a89579"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolScreensKt.PasswordField (cognitive 17): ToolScreensKt.PasswordField has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae63fe849c709afadb52033ade81842d357fd1adbbe1b308f85f51793b44133"}},{"ruleId":"D2","level":"warning","message":{"text":"SearchState.run (cognitive 17): SearchState.run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Search.kt"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57b66420018ca4ce2c4bcb442f079edf8741798e19fbf2f5269afb16c1868ce"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::alt::mark_tag_artifact (cognitive 16): pdfcraft_a11y::alt::mark_tag_artifact has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb70ac6e7f37215467284deff1098989cf427486d430b3e2a54193f681dbeb1e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_a11y::autotag::text_spans (cognitive 16): pdfcraft_a11y::autotag::text_spans has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/autotag.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec83b2bd8b529698dfc2d35cedffad44672dd37a9fc9e5e9b3353059d244505"}},{"ruleId":"D2","level":"warning","message":{"text":"Automation::marks (cognitive 16): Automation::marks has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (8 pts), if/else 3 (6 pts), loops 1 (2 pts) (nesting depth added 7). 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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ce52849628b7e722e9fa68838925d468bc0acf63ecec75e2a76d52510b2bfc"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_content::inline_image (cognitive 16): pdfcraft_content::inline_image has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/content/src/lib.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0dc10b7ba46df87eb285714d81ab0f09f2e4a1e9708b66f6d9dbfae9f5d0043"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_cos::security::walk (cognitive 16): pdfcraft_cos::security::walk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 3 (5 pts), boolean chains 4 (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":"engine/crates/cos/src/security.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe74a05f694d0b2a765c752c71500b899b238abc35b8173ee58fc18dd8643e15"}},{"ruleId":"D2","level":"warning","message":{"text":"Converter::block (cognitive 16): Converter::block has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 4 (7 pts), match/switch 1 (nesting depth added 8). 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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"360b4e97566a4994f520cc09fcf1dd256417e81ca2a41dcec85153dbad767e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_create::office::pptx::parse_theme (cognitive 16): pdfcraft_create::office::pptx::parse_theme has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), 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":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b2e0f9962efb372af305c4524b6d260f2e9a9d9febef52ec6c5995ffdf6e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"SecurityHandler::open (cognitive 16): SecurityHandler::open has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (2 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":"engine/crates/crypt/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b631c9a46df5a6f5fbdef643c8925c9ca68549526944e179f5074b94d5cf6d93"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::inline_forms::plan (cognitive 16): pdfcraft_edit::inline_forms::plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 3 (4 pts) (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":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"23522c4aa631ac86eec42d1186c7c6994f43a63facc0248ccfb6fc9fd49308e4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::inline_forms::retarget_structure (cognitive 16): pdfcraft_edit::inline_forms::retarget_structure has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f793cc114e91837c893c4537b1ca3567ddef73e0308ddf3c2121a8a5e6e6f193"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::positioned_tracking (cognitive 16): pdfcraft_edit::text::positioned_tracking has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d13dd7c31416f5cb21bfad04ffbede71836ae3a84ce952b7f64ae246c292874"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::add_shown (cognitive 16): pdfcraft_edit::text::add_shown has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 6 (8 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecb804dff39e865c3057d52a5412dc11a8aa0399e024e7611ac0631173cab74"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text::type3_font (cognitive 16): pdfcraft_edit::text::type3_font has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), 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":"engine/crates/edit/src/text.rs"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a6c7ced7065ce6bd7cd77ec1b2774689e1b12a0e9f505203cc4e83d7ea54be"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_edit::text_reading::shading_color (cognitive 16): pdfcraft_edit::text_reading::shading_color has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (14 pts), boolean chains 1, if/else 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text_reading.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"b956ad746506a6f5684685280aac6b6f724f854743f4c737cd71cd78af19e939"}},{"ruleId":"D2","level":"warning","message":{"text":"Styles::xml (cognitive 16): Styles::xml 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":"engine/crates/export/src/xlsx.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d26459579f49e8ec68bef269e9678b9798cfc91bf44fe53430924ee419f29ca"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_filters::flate::inflate_raw (cognitive 16): pdfcraft_filters::flate::inflate_raw has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 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":"engine/crates/filters/src/flate.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16e24d9c4f57a07bb7746c91259654eccbe5ec27a048d5591aacc97caf6ab88"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_forms::detect::raster::shapes (cognitive 16): pdfcraft_forms::detect::raster::shapes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/detect/raster.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb496e73b7ff9416c6d5637d9cf7181aec6fa32e04b97bf1161db5c94359d5d9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::lzw_to_flate (cognitive 16): pdfcraft_optimize::lzw_to_flate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/lib.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e4d1a1ac9e19d1ee658427274ff0f7885f8ecc8a90b7b385f9479b8be50db7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_optimize::unused::find_names (cognitive 16): pdfcraft_optimize::unused::find_names has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), match/switch 1 (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":"engine/crates/optimize/src/unused.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b4d90f5f04fa4858d48b51d9804f790aefda599b42036e6f573e9810cf6abc"}},{"ruleId":"D2","level":"warning","message":{"text":"Scope::visibility_expression (cognitive 16): Scope::visibility_expression has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (6 pts), match/switch 3 (5 pts), if/else 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"97565b25accdd58e683e898c0564e737714b596c72a2c4557e56848e5606c270"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector::transitions (cognitive 16): Inspector::transitions has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 3 (6 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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bfe978c663e6ec22b0e0da587da0e1652245f822b8cc09980efe3bdb9041fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector::outline_window (cognitive 16): Inspector::outline_window has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad4c204c5646eac88114f525be6c905f4827df151e4f316aaa2e2274789b2d1"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::pdf::list_cached (cognitive 16): pdfcraft_sign::pdf::list_cached has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41770c5286e40bd2d764693b75b3bcecde35cd40a233b2aeba8ee7f61784f32"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_sign::windows::entries (cognitive 16): pdfcraft_sign::windows::entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/windows.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb61eca97e53ee88d93fb1962158672ab72c6852b3bedf6858682a2a491073a"}},{"ruleId":"D2","level":"warning","message":{"text":"Layouter::draw_border (cognitive 16): Layouter::draw_border has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, match/switch 1 (2 pts), 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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"75559949c1c94832ad2b710f425d574562104085b2d89af67cfecb7791d79bf8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::data::wanted (cognitive 16): pdfcraft_xfa::data::wanted has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (6 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/data.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d443378dcfc21e6dd969fecfac3fa5e982c55ea8af5317c8346f24358c0659d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdfcraft_xfa::text::words (cognitive 16): pdfcraft_xfa::text::words has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (5 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":"engine/crates/xfa/src/text.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dac4a524c7b756a23dbbda5fe30448851b90f490902914eff3b0c9e02796fb"}},{"ruleId":"D2","level":"warning","message":{"text":"artefact_mobile::ppt::read_slide_list (cognitive 16): artefact_mobile::ppt::read_slide_list has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/ppt.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a5053d65ffb15185b5f1a099e21801dc5caf790f9b691b9eeddf532f2d66ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentsKt.PdfSheet (cognitive 16): ComponentsKt.PdfSheet has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/Components.kt"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a292103b3f594e7c1ef268eb8902327dfd300f02ff067b40cea25ff008f298"}},{"ruleId":"D2","level":"warning","message":{"text":"CommentDragKt.CommentDragOverlay (cognitive 16): CommentDragKt.CommentDragOverlay has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 4, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentDrag.kt"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f654b42fb03a202c239ff204856f2fd40473c97e6a749d86691ef6f97d45850e"}},{"ruleId":"D2","level":"warning","message":{"text":"DigitalSignKt.CertSignScreen (cognitive 16): DigitalSignKt.CertSignScreen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DigitalSign.kt"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3749526ca91f91910dcd9a3bc6200093cbcdcb1adee51b90364e96427defb88"}},{"ruleId":"D2","level":"warning","message":{"text":"QuickToolsKt.CustomizeToolbar (cognitive 16): QuickToolsKt.CustomizeToolbar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/QuickTools.kt"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a5104050b5671b92110213ff71583ca85a542afca53c530c043de49938272e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_automation::tools::tools: FunctionTooLong \u2014 pdfcraft_automation::tools::tools runs 1186 significant 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 1086 over it, 11.86\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":"engine/crates/automation/src/tools.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7b1f34e204102f95c28443648e1899a7b62c73af4a4eb75382e85a52328ab5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppViewModel: TooManyMethods \u2014 240 methods. The bar is 30 methods; this is 210 over it, 8.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd418d48a5ea6511dc4cb55a236875c5f2c0b9d1322c32f223e2e1b6e38bfc6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 3471 significant 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 61 free functions. The bar is 500 significant lines; this is 2971 over it, 6.94\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed209af88f4f4be4a5e6fcf731ef549b79d0e6d65911d939dae40e7e58a4432b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PhotoEditorKt.PhotoEditScreen: MethodTooLong \u2014 PhotoEditScreen runs 669 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 569 over it, 6.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d9c4837da3f6e5eefc28bf5048de920bbb2289651baa02de1825832eed0253"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Automation.call: MethodTooLong \u2014 call runs 659 significant 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 559 over it, 6.59\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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dfb0b1f82137a1b1fc1568d38e9379648e6d6647f0003ebf6fc2e900f3841e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Automation: TooManyMethods \u2014 179 methods, declared across 14 files: src/lib.rs (56), src/a11y.rs (44), src/comments.rs (16), src/forms.rs (13), \u002B10 more file(s). The bar is 30 methods; this is 149 over it, 5.97\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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2657671f2f88b3d7097a763141be5e9a8a4569f738c5e9cfc77ec9b1e8a5f254"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_edit::text_regions::rewrite_styled_block: FunctionTooLong \u2014 pdfcraft_edit::text_regions::rewrite_styled_block runs 583 significant 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 483 over it, 5.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"580c11655031946889264f80d850610a0b9783c8f6cfea02d07601acbb449bf7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppViewModel: ClassTooLong \u2014 2177 significant lines (blank, comment-only and punctuation-only lines excluded), 240 methods. The bar is 400 significant lines; this is 1777 over it, 5.44\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/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6929fb90e5fb270b56dd9d37135ad437936107b7519284615dbee18767ed25ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/text.rs: FileTooLong \u2014 2390 significant 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 93 free functions. The bar is 500 significant lines; this is 1890 over it, 4.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"909eb00cff1f334c8be560b19561bde833804df0c9b129a710b0ea869b0d9e5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/AppViewModel.kt: FileTooLong \u2014 2237 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: AppViewModel (71-3567). The bar is 500 significant lines; this is 1737 over it, 4.47\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab70a0adc27c3edcd0e1ce8586f5e385ed5da958df4ca5d541e1a7948d5c2306"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Automation: ClassTooLong \u2014 1729 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 179 methods, 3 blocks, lines 117-2399. The bar is 400 significant lines; this is 1329 over it, 4.32\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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"253efb4a33ffefec4953e2ae4ca5732578f76156ae433d7834190452a421c52e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: Automation (3 blocks, 117-2399). The bar is 500 significant lines; this is 1616 over it, 4.23\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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93e3aad74ec2181bf233f39f3df738e3e73cccf24dc7ba8055023ac3c8c94b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_annot::appearance::build: FunctionTooLong \u2014 pdfcraft_annot::appearance::build runs 420 significant 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 320 over it, 4.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b85b012498be464a5fce0a4c7f748a420ea4e944628d9356a40e620ea9e8040"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MindMapKt.MindMapEditor: MethodTooLong \u2014 MindMapEditor runs 393 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 293 over it, 3.93\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d42c81872e91986d16fe9d952f90bd26ebec2aa8ec140547b8ea8c382b2a06"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 117 methods, declared across 8 files: src/lib.rs (91), src/js.rs (7), src/dates.rs (6), src/compare.rs (4), \u002B4 more file(s). The bar is 30 methods; this is 87 over it, 3.90\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9630abb6fba813d2cef2a482b8dce03ea6306454574004dc662209731e47a3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1831 significant 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 75 free functions. The bar is 500 significant lines; this is 1331 over it, 3.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffdf605804cbac816f46c082ed5cb6fb5c22cb7e725ff93cbe9aa690738a948"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_engine::run_edit: FunctionTooLong \u2014 pdfcraft_engine::run_edit runs 333 significant 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 233 over it, 3.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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c1254f5160e69bd129f5b2713f1eba799b19e65500afb668c7c1e81f958d54"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SheetViewerKt.SheetViewer: MethodTooLong \u2014 SheetViewer runs 315 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 215 over it, 3.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ac582c8215bcb20a6c1caac3e22144c2e5ecfaeb8ecc1788d5523997989194"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_edit::text::rewrite_block_from: FunctionTooLong \u2014 pdfcraft_edit::text::rewrite_block_from runs 310 significant 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 210 over it, 3.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":"engine/crates/edit/src/text.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ff0cac8060304681db3a00d6958f5a4964d901ef1d5b8628b4073b1e3db810"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pdf.rs: FileTooLong \u2014 1536 significant 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 46 free functions. The bar is 500 significant lines; this is 1036 over it, 3.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5f2726708326db7f74a19b962fd9a59ee275b527c49b226a378819d124c899"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ViewerScreenKt.ViewerScreen: MethodTooLong \u2014 ViewerScreen runs 300 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 200 over it, 3.00\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerScreen.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6937adbb818fe40dde41f5ea2e2ccea176bc957c94ffcb30e5d897d6b34fe9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/document.rs: FileTooLong \u2014 1473 significant 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: Document (3 blocks, 406-2219). The bar is 500 significant lines; this is 973 over it, 2.95\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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ff47d9f8a7e6fe74e21611f600dc439ebce52fa0396fe4665b1ddb7cd8c6c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inspect.rs: FileTooLong \u2014 1468 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 968 over it, 2.94\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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65efba7d290e526672deed7e96504f55e6e9264f5350a0d2d6a86e43727c3560"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Session: ClassTooLong \u2014 1167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 117 methods, 2 blocks, lines 3229-5413. The bar is 400 significant lines; this is 767 over it, 2.92\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3229}}}],"partialFingerprints":{"codehealthFindingId/v1":"14120c181f64d88b5b963f9bd4787c0e593730b903f8a059e40cd67ae2238a78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_edit::text::interpret: FunctionTooLong \u2014 pdfcraft_edit::text::interpret runs 288 significant 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 188 over it, 2.88\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":"engine/crates/edit/src/text.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad904e221fcbb67b20977930bf1d7f1009a1c850f578973e5759668bbbc744a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_create::office::xlsx::draw_sheet: FunctionTooLong \u2014 pdfcraft_create::office::xlsx::draw_sheet runs 280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 180 over it, 2.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac830668a3a12b050976eb4148ff952d26086311de04ad6b483b66a738e1ff2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Document: TooManyMethods \u2014 83 methods, declared across 9 files: src/lib.rs (59), src/compare.rs (8), src/text_preview.rs (5), src/copy_image.rs (4), \u002B5 more file(s). The bar is 30 methods; this is 53 over it, 2.77\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f7fd846b70e432f70eb017a572274e5be4d2512d9f4a0fc7229acf06a18c0c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Document: ClassTooLong \u2014 1066 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 77 methods, 3 blocks, lines 406-2219. The bar is 400 significant lines; this is 666 over it, 2.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":"engine/crates/cos/src/document.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e55cc3c60db0a5abe0ef2cc24f49afa0132f305d7e8ccb61d19d16488e1129d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SheetViewerKt.drawSheet: MethodTooLong \u2014 drawSheet runs 259 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 159 over it, 2.59\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51202c1102b8de7ee0deb533da835b92af7450910bbf81da38eeaf5ae46dc09"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Document: TooManyMethods \u2014 77 methods. The bar is 30 methods; this is 47 over it, 2.57\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":"engine/crates/cos/src/document.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abb9be1ef07e7f99882ad0d8cea7a1d3c227d50262eb0ac4085b1327143eae9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tools.rs: FileTooLong \u2014 1271 significant 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 771 over it, 2.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":"engine/crates/automation/src/tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"835881996f53d0e36b455fdc3b72d658bc14005fe4c3c887fa745f6e57055b01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_forms::author::set_props: FunctionTooLong \u2014 pdfcraft_forms::author::set_props runs 253 significant 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 153 over it, 2.53\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":"engine/crates/forms/src/author.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"725ff95046768bdef2e7e9f5d7768a281d4540180cc40d5bd61432007f98c326"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/data.rs: FileTooLong \u2014 1258 significant 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 71 free functions. The bar is 500 significant lines; this is 758 over it, 2.52\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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69edb5384fdfd243a8777bc71d678e4bce2bdaa8462c356e4dadbe1ff7e097d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sheets/SheetViewer.kt: FileTooLong \u2014 1149 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 649 over it, 2.30\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f46c3faba829e8748d0857ad2652b9561d9231e5c134993edf18a67550394f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1148 significant 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 53 free functions. The bar is 500 significant lines; this is 648 over it, 2.30\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":"engine/crates/js/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"434ea4ce7b9cbabd8046caf4f511dd3f04d6323028f1b40c0718efeac329f3be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/author.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), declaring 45 free functions. 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":"engine/crates/forms/src/author.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6365b2c17b8e8b95834e1b9721613cb9f1d5b6b2949b55405c7b7beea4031c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 616 over it, 2.23\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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cda31666617125828c0216bfee15184a836bb27e506db4a27043f4cc6924b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/text.rs: FileTooLong \u2014 1099 significant 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 599 over it, 2.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ea50b0022bfa848fc4b637aa12c1009dadb3844c20a62116a3d10a87ad0d58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/xfa.rs: FileTooLong \u2014 1071 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 56 free functions. The bar is 500 significant lines; this is 571 over it, 2.14\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":"engine/crates/js/src/xfa.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3857c145b7874fd0fe5baf8621d2e64f8dbb16abf3a6ebf2f3b7a2e55abf846b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.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), declaring 39 free functions. The bar is 500 significant lines; this is 569 over it, 2.14\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":"engine/crates/xfdf/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"406b5926890210c19d61ee7d192fe3a65d957d8b89a9bbf7f0002994b9bcc307"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: office/docx.rs: FileTooLong \u2014 1067 significant 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 567 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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7234274e81d8fce82ebfa682edbb71800046553dcd6fe638f52102375487001e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_redact::apply_to: FunctionTooLong \u2014 pdfcraft_redact::apply_to runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"42a7f5cf553b36dd849785c80873f00a24ca42e095e36f6c00fceae26cb6ef11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_redact::interp::process_from: FunctionTooLong \u2014 pdfcraft_redact::interp::process_from runs 208 significant 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 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7aeec10e1de9caa9724d6ce7734c37da6e90efdc21dc6940f5f35bcc740b31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notes/MindMap.kt: FileTooLong \u2014 1036 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 536 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"becbda302f65b87df74a7d4ee54d88bd338d5f3ccd29f588da0c88c8529b51e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: notes/PhotoEditor.kt: FileTooLong \u2014 1033 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 533 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df2b6213ef47b53d7da3bf769bad31ca3ff6fa06d879f6931aac2982c64441f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: office/pptx.rs: FileTooLong \u2014 1021 significant 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 521 over it, 2.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":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b3d6e1465d8f8c6956b77cf9b70a16ebe4f65b41feea9a484e1c6e8e17f0a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/appearance.rs: FileTooLong \u2014 1013 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 513 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"877c4df5d34cf380d479a1a11586ccaa2ea725a76c4a216fb85f30b07cede857"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Inspector: ClassTooLong \u2014 794 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 2 blocks, lines 802-1982. The bar is 400 significant lines; this is 394 over it, 1.99\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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87a219b99a079dd3cb36b09eabe6f70762d2ec1513a4b6b971d7224c9a96052"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: office/xlsx.rs: FileTooLong \u2014 986 significant 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 486 over it, 1.97\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":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cad66e26a34ac6b1c17cc96dfe3b33d61cea4cfd58ad2c2970deb911ff132e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_annot::add_annotation: FunctionTooLong \u2014 pdfcraft_annot::add_annotation runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6672835c1c933e21c36df0db435db621358b2ab0f8685b242b1c1b01390dd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_render::text::arrange: FunctionTooLong \u2014 pdfcraft_render::text::arrange runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/text.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"288a14149178eadccd6fed4b4a9fe0b8b9534f7b9e481e03b522d389bbd67c3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/import.rs: FileTooLong \u2014 966 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 466 over it, 1.93\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ecbaf2d2bb9578d912d6d89c076e4a2a534fd1664e30681f10490538cd3913"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/interp.rs: FileTooLong \u2014 956 significant 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 456 over it, 1.91\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aecf69e19b47076e8784e020ce4f224c1176620876ad2056e443c709d2271f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LiquidMorphKt.LiquidMorphSurface: MethodTooLong \u2014 LiquidMorphSurface runs 190 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 90 over it, 1.90\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce0a20a3d7ea7e2171d2cc7839adb6a418b6b8a8006193ae8c08cd2cf8d3488"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_create::office::rtf::control: FunctionTooLong \u2014 pdfcraft_create::office::rtf::control runs 189 significant 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 89 over it, 1.89\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":"engine/crates/create/src/office/rtf.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"100460760cc147de65e5431cd071268993f9bea5b4d35092e6582f4c566d1b2a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Emitter.widget: MethodTooLong \u2014 widget runs 188 significant 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 88 over it, 1.88\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":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"364807f9c4658bc80d8c9d5054daf9dbe1d0fb67a325f5b0abb0790105242e4d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MobileSession: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/lib.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c994c1fd18ee353489f05068dd245866a7a9c7745eae7c8d401f2f6f08508d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SheetViewerKt.SheetGrid: MethodTooLong \u2014 SheetGrid runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2fbb856a547211088580448116286a6a912055844293f0c10235e57316e58d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Automation.comment_add: MethodTooLong \u2014 comment_add runs 175 significant 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 75 over it, 1.75\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":"engine/crates/automation/src/comments.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a78e4da03ca7563eaa99612f1e14328f2e00cb1dc21bc11134a684a5768414"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/text_regions.rs: FileTooLong \u2014 862 significant 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 362 over it, 1.72\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":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f772709229d6c16b769202028daf1a7b2335a6cfc01a6cc5cd81dcd8e1a6eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pdf.rs: FileTooLong \u2014 861 significant 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 361 over it, 1.72\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":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"324297146bf06f808f4ee27c3753acaaaab880ab24eb65ef879df33004a2f10e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PagesScreenKt.PagesScreen: MethodTooLong \u2014 PagesScreen runs 171 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PagesScreen.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"757a5bdf10c6f794bfdce2f2f9ac627499d17269802246d7de8b35baa1a5fdd6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_create::office::rtf::convert: FunctionTooLong \u2014 pdfcraft_create::office::rtf::convert runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/rtf.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e33f0bf2f3f5fde5a48aa7cf20f02d6a758d9e1c8be76deff8d467ae5cd5d7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/added.rs: FileTooLong \u2014 832 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 47 free functions. The bar is 500 significant lines; this is 332 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/added.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcd1d720359e93e52ca58777d326cfa668753a9aaa0b94829a2b200e06a37d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/a11y.rs: FileTooLong \u2014 811 significant 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: Automation (3 blocks, 209-1080). The bar is 500 significant lines; this is 311 over it, 1.62\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/a11y.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc699847e4c8f27cdc8b5488f9895ec34c24898270a90da5cae6c22e0dfdf8dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pdf.rs: FileTooLong \u2014 791 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 291 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00512f2a5dd0396d9b4d399d36b189a1516d618347397059983d99e97ff476ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_export::tables: FunctionTooLong \u2014 pdfcraft_export::tables runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"501dcf4fb7406c7aa5131af6c5b2a2be193e72e462e8a963c941e290058700e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Document.read_compact_section: MethodTooLong \u2014 read_compact_section runs 153 significant 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 53 over it, 1.53\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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"30187ba93cff63f8f0190de8746a60f786b2314dc4ed63d7d7dcffc02d56e12b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: office/flow.rs: FileTooLong \u2014 742 significant 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 242 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93061180e93249667752e835804c0494d343e3ff247d9533412ebc8761d63df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/appearance.rs: FileTooLong \u2014 735 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 235 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/appearance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a41a0f0fb50d5592227a5457c6b5fbd96c8e459dc9d64ea4fcb35dcbd126e8c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NoteEditorKt.NoteEditor: MethodTooLong \u2014 NoteEditor runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/NoteEditor.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a261a65195b889f9bd3ff4db29e0959e13e6edc69a5af1ee4db51ed414a09f2d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SheetBook.cells: MethodTooLong \u2014 cells 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":"engine/mobile/src/sheets.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af4e11b371b54a757a74a84100c7c745f382bf0a3e7ff9ebaad2950bb10f2b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 216 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3366a57d08cefa6997a6b8358397027c5121a7e1b4ddc5fa8f37c4822a5a7e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.apply: MethodTooLong \u2014 apply runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3960}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47e3d6472bdcc25154259ef9cf30164cdd51e0c12c26129efabcb7b9aa2ae60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_js::xfa::install: FunctionTooLong \u2014 pdfcraft_js::xfa::install runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/js/src/xfa.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef306f1b5f52210ee00788e738309eadef6af16ca64d8c24f884d2ac98c1dd33"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_redact::interp::xobject: FunctionTooLong \u2014 pdfcraft_redact::interp::xobject runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/redact/src/interp.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"18118b5cafb57b0a39deb3408919fd8bdfbd910c24c34f93fd55c6f316e3dc0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/ToolScreens.kt: FileTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 214 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73c0d3f840abd57741beb2200b1dfd3c57983716a4249826de40a9f68eb690b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MorphButtonKt.RectMorphSurface: MethodTooLong \u2014 RectMorphSurface runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/MorphButton.kt"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2747e7079c2268169b4a123d1d0b16b0afadc35a5779d692a6c8d0671041d72b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_forms::appearance::field_appearance_fit: FunctionTooLong \u2014 pdfcraft_forms::appearance::field_appearance_fit runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/appearance.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8537746ab70ff55faf650ff49702386421a0f753337c9bf846438ee48897be6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/raster.rs: FileTooLong \u2014 689 significant 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 189 over it, 1.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/raster.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aaedfaca2600b1bc7c574879f7ed5618c853342150b00a1ca5808657efefb7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/inline_forms.rs: FileTooLong \u2014 672 significant 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 172 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":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ffffd6567e7e9785ded10de92f62b3128a0c9fe0da5bf1f38b5c560ab6f073"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 165 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45d2683c419f8fbbfa101ea0bf5f7788e0bda3d0e4de4041db803200b6ac913"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Walker.ops: MethodTooLong \u2014 ops 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":"engine/crates/measure/src/snap.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd01b187bf8f6d8d15676efbf2a06a39a6ae7ce0a16d173651de873d86c660b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 656 significant 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 156 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/export/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9275fac74d7ed51b1679ec8816d9edc481e08e35491834545b5d49bf5f21c08e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: pdfcraft_organize::outline: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/outline.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"420d6680941dad00bcb9614e32944ad0c9db29a50800335c1ae71bfee55c3881"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: office/rtf.rs: FileTooLong \u2014 646 significant 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 146 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":"engine/crates/create/src/office/rtf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a13edafcf2ed0b1930335f7e7e7cdfbe7f9861148b07f2dac6da16661790787"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommentPanelKt.CommentPanel: MethodTooLong \u2014 CommentPanel runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentPanel.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49cffc943b990a36b348f3e11264481145ec7742987feff51c924babbe82ae1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_forms::author::add_field: FunctionTooLong \u2014 pdfcraft_forms::author::add_field runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/author.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31b035179b546f8597eadc744f4d6c1fb18f9e914d62e93425bde25600ff58a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Inspector: TooManyMethods \u2014 38 methods. The bar is 30 methods; 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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95e128fa818b40cdbf4167a2254d1dff22754ceabb6c9404c9a2d0689671ef3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Edit.label: MethodTooLong \u2014 label runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":2134}}}],"partialFingerprints":{"codehealthFindingId/v1":"342cb05b5ad98adb8273586702455f65511686f9b6e58a1118cdd5aebcdf1e1d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Converter.table: MethodTooLong \u2014 table 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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"15af0ffd9074e51ed87a4a1212d3b36f8fee1f4a51ad404c003761cf2c5495d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_create::office::flow::render_line: FunctionTooLong \u2014 pdfcraft_create::office::flow::render_line runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1346078f097603fcc8a7b734f260a05c817f187803d06b687fab301d8d725e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SheetChartsKt.paintChart: MethodTooLong \u2014 paintChart runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetCharts.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"28844829553c28c4f829db4bb49d20c85d8c47961060ea34852c8d72c5120d31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_preflight::convert: FunctionTooLong \u2014 pdfcraft_preflight::convert runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/preflight/src/lib.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"702022bbdf29afff55cf2c0bee84d8c789317ec00d3f8b1807c0e82be6d6d2c9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Converter: ClassTooLong \u2014 477 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 2 blocks, lines 649-1446. The bar is 400 significant lines; this is 77 over it, 1.19\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c5955f37f3b7a38b8e362be99e4902dcd6a6b9b04ae47ce68cb5e00a10af34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Session.prepare_open_unguarded: MethodTooLong \u2014 prepare_open_unguarded 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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3681}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aec262c2f71b25a966788aef855786523e4b9901df841f23c225b4a14958cc4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.page: MethodTooLong \u2014 page runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/draw.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed000b959c8223a6b1a3e4ae388b97f9a1868c2cd8afe0b4a8723d397bcb2b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.text_body: MethodTooLong \u2014 text_body runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dfa1afa0052fb712f2695bbb437582f1a67639dae5e32c5fdba4a27fb494d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_engine::check_permission: FunctionTooLong \u2014 pdfcraft_engine::check_permission runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cb4cf35c7a862be17939e7b55695e60c60d3af7f32c2bd06b4f16252f88edb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_edit::flatten::flatten_in: FunctionTooLong \u2014 pdfcraft_edit::flatten::flatten_in 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":"engine/crates/edit/src/flatten.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"95cb1f696512e4a9d57232159e981576ede8dbc21181561852c755ec27204df6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_xfa::data::merge: FunctionTooLong \u2014 pdfcraft_xfa::data::merge 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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5dfb43b397167c5f555eaa3be3d4087cf9f6597abb551ef2e19a028860e7951"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dates.rs: FileTooLong \u2014 584 significant 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 84 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/dates.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d364112ef075cffa6af36a387980e5c06715577c1fd1cd8d131c0b7e9b1cfcf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/images.rs: FileTooLong \u2014 577 significant 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 77 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/images.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"946292ca58e9825119c2f7c432ac216173880cfb2e723bee4f52d48d7027db38"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parse.rs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75656cf4525a6931b8bf82c8bb381b8bde470e036eb771df695528985e411ffe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/xfa.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/xfa.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"715c56e2e4d92a0a26f4efeaa0bef0ad77b9f3a64edd5fbc91b28e6d6d1098ce"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Edit: ClassTooLong \u2014 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 2 blocks, lines 1386-2274. The bar is 400 significant lines; this is 54 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"4143e2e323a2a2c1f35363d465fdbcfd78e539bb5a17ffd3afb51f9f5e282f8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_edit::text_regions::group_layout: FunctionTooLong \u2014 pdfcraft_edit::text_regions::group_layout 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":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cecde20b5b952ca76ed8f8a50c3224d8e56b656fcaf7724513990ee6cca8b0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/comments.rs: FileTooLong \u2014 558 significant 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 84% of them inside a single declaration: Automation (2 blocks, 117-743). The bar is 500 significant lines; this is 58 over it, 1.12\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":"engine/crates/automation/src/comments.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e1e111d361fb1ac70b55f29e6a24f69a03472a9981ec906428f5c685325046"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_create::office::flow::layout_para: FunctionTooLong \u2014 pdfcraft_create::office::flow::layout_para runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d223970649e13c5ae1580815d886d6226b489a7904caf87249c267774f8b0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_organize::import::import_pages_mapped: FunctionTooLong \u2014 pdfcraft_organize::import::import_pages_mapped runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/import.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba72f57d1debccb293416d31a204cb210578b49eaeed7ca1b96623d5e1c39544"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Automation.redact_mark: MethodTooLong \u2014 redact_mark 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":"engine/crates/automation/src/redact.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a96edb26150b186744f926868cf02878f66c353590e150480cb1769a2fe8a7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_preflight::verify: FunctionTooLong \u2014 pdfcraft_preflight::verify 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":"engine/crates/preflight/src/lib.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e6fbcbf93dbffa9c440fbea852f8e6bf7c2f24c40aa8c90f38f70495e7f5e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_redact::sanitize::remove_hidden: FunctionTooLong \u2014 pdfcraft_redact::sanitize::remove_hidden 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":"engine/crates/redact/src/sanitize.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"5139635bd9ca5574d9ed9f6fa29e5a88a0daa7307b2c777366905e3a8f98e6ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer/ViewerScreen.kt: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 45 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"570df67355cde497f704bcedb0ab1039700ad960becc227a012a46b66f79d4bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_forms::walk: FunctionTooLong \u2014 pdfcraft_forms::walk 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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"406956d29339da2c4ecbe1739065651f7dd80068e5dc5037bbad1a547fbe3cee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/forms.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 76% of them inside a single declaration: Automation (180-713). 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":"engine/crates/automation/src/forms.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad0326c772ae3841f29c57a9326f6102ad0619b9cfe88d4b4b960739a9f843d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QuickPreviewKt.Preview: MethodTooLong \u2014 Preview runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreview.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ead62599ddfe0c872394be108a7b6dc9021fe0f25f1d88104f5ba96157e33c2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SheetBook: ClassTooLong \u2014 428 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 3 blocks, lines 153-749. The bar is 400 significant lines; this is 28 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/sheets.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fecf9acaad41053d85aa6520aa8f5cab4bb9144d5a51ae5ffa3aa541a495022"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_annot::appearance::stamp: FunctionTooLong \u2014 pdfcraft_annot::appearance::stamp 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":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d93513482c7c67d637e47bac935453f036a098268869170c64b63bebf120bc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Shown: TooManyFields \u2014 32 stored fields beside 1 method. 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":"engine/crates/edit/src/text.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed2aaae200fc6465bde4fbecb6a16dca159b682f1d9e572ed796b898d5ff4e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer/Edit.kt: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 32 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fe886c18f652ced4c8b260f0a53a0835816a3679165aa73bc28ebeb3aeee32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sheets.rs: FileTooLong \u2014 532 significant 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 80% of them inside a single declaration: SheetBook (3 blocks, 153-749). The bar is 500 significant lines; this is 32 over it, 1.06\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/src/sheets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58d2f6cba7192906b2d74a19b988d40f4335961751aa0835c93e81b85e6f172"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_fonts::embedding::embed_mapping: FunctionTooLong \u2014 pdfcraft_fonts::embedding::embed_mapping 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":"engine/crates/fonts/src/embedding.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"39636655daae39317a6d6705d50dcaef31fee02603b67858431bbdc9df5ec4e3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Inspector.annotations: MethodTooLong \u2014 annotations 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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74b9e12ccd6e2cdf1f47770f55fef0f9558c578b08a397b8685590f90fa2178"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 528 significant 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 28 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":"engine/crates/preflight/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e1cc85d9ef69518b5c5211a0d7037c1e9e27d01b60d219fa399001b1a73286"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClearAppKt.Shell: MethodTooLong \u2014 Shell runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/ClearApp.kt"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc45fb233e80213509ded1ea7b386d936cbea41cceec888adc62376d883ec172"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/keys.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":"engine/crates/sign/src/keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24073f0a9e009871710668c8263f7730f9cd706cfd131679de3a6a6422d3bffd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewer/ViewerSheets.kt: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerSheets.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50dacfe2a65c159bfd1d667f3757b8de01851f8df0cffc57eb067eae7bdeaaf1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: desk/SettingsScreen.kt: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1255eb0e0b6b4f07fd52d3eaea928be63c9e8c8f3125c8358664c20115f9be1d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Renderer: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 2 blocks, lines 820-1347. The bar is 400 significant lines; this is 7 over it, 1.02\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":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"d693b388248891fe48239f71e76cc06c743779d023a55012b6d511aa882bcdcd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 505 significant 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 5 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b81ce650612b602514ba51916c4ef89b918b43489a1310dc902cb1313e2710"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_optimize::optimize_with_progress: FunctionTooLong \u2014 pdfcraft_optimize::optimize_with_progress 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":"engine/crates/optimize/src/lib.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"acdb6ff70349fae3ed0c0d9dd4402c5b04606a8d046a1160a25a37b9bb2ad174"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdfcraft_xfa::parse::parse_rich: FunctionTooLong \u2014 pdfcraft_xfa::parse::parse_rich 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":"engine/crates/xfa/src/parse.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac460bebcf83c3293c818fef2f9b2e97bb2ef2ea8fc94aeae2a0d758f4491e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (42 shared lines): engine/crates/edit/src/text.rs:1607-1734 | engine/crates/edit/src/text.rs:1757-1831 \u2014 These two members are variants of one another: 42 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":1607}}}],"partialFingerprints":{"codehealthFindingId/v1":"a518015241dee67bf65f68c4e99dae9f69f7b7360972105b7aca53f569379a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): engine/crates/forms/src/appearance.rs:532-564 | engine/crates/forms/src/appearance.rs:960-1051 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/appearance.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d669f042b2f9216892a8d229d266c48f5e01c90eb8972ab8c59ff3a80de9dad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/crates/create/src/office/docx.rs:628-641 | engine/crates/create/src/office/pptx.rs:26-67 \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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"024c3f6a0e19feb91cac70a4c83cc79c095be8114b9943d8022bef7d26f46601"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/crates/engine/src/lib.rs:5031-5071 | engine/crates/redact/src/lib.rs:184-235 \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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":5031}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb5eadfc0acfaba318b71b6b6b398e97161da8fa8dfc1d4d93c85ddd26f6016"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/crates/a11y/src/headings.rs:181-309 | engine/crates/edit/src/inline_forms.rs:662-723 | engine/crates/edit/src/text.rs:1208-1587 | engine/crates/redact/src/interp.rs:801-1096 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/headings.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5b5f1c287ecc01b3bed8c7c7354a4895487d4e63aadb72fbbff2816d9e629e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/crates/annot/src/lib.rs:734-766 | engine/crates/forms/src/lib.rs:499-523 | engine/crates/model/src/lib.rs:160-213 | engine/crates/organize/src/lib.rs:104-144 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"538fc5cbac423f4fdc33ec932cbff7e986db5f1e952a3085b694c75a67aec2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/crates/audit/src/cover.rs:316-339 | engine/crates/edit/src/text.rs:772-793 | engine/crates/edit/src/text.rs:2080-2131 | engine/crates/redact/src/lib.rs:250-269 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/audit/src/cover.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"db432eacbe9fee0214410fd1537ec6c5e159558923b6dbd1b8979ebf4b7c7cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): engine/crates/automation/src/forms.rs:588-615 | engine/crates/automation/src/lib.rs:1401-1484 | engine/crates/automation/src/lib.rs:1610-1660 | engine/crates/automation/src/lib.rs:1662-1699 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/forms.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a069bff64bf5c8b10f47fead4a1e33f2694ea91288b48cff963d3512b18d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): engine/crates/xfa/src/lib.rs:40-91 | engine/crates/xfdf/src/lib.rs:97-148 \u2014 These two members are one piece of code written twice and then edited apart: 52 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":"engine/crates/xfa/src/lib.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96247444330cf8d55d438d73d4a35d09185394c7f5600d38a35370f262d94cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): engine/crates/engine/src/lib.rs:4165-4192 | engine/crates/engine/src/lib.rs:4194-4221 \u2014 These two members are one piece of code written twice and then edited apart: 28 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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":4165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34be0e1c3ab19c6c54b8c5626bced2df261e0a43ec7a5ddf430bd3ec2b8909b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): engine/crates/annot/src/lib.rs:1102-1134 | engine/crates/engine/src/lib.rs:2278-2307 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4deef6beeb18fb61c95049a27351033b94bacb123a4f12f732ed6a8cf3781e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): engine/mobile/src/slides.rs:104-140 | engine/mobile/src/word.rs:174-210 \u2014 These two members are one piece of code written twice and then edited apart: 37 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":"engine/mobile/src/slides.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec90f2c703aeb812f0e69d5c62cb7d3dd9ac9025f14e9dc0b20e9792cac1a3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/crates/forms/src/actions.rs:140-160 | engine/crates/forms/src/actions.rs:197-214 \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":"engine/crates/forms/src/actions.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee0d1716d4cf668abcd2e231d58c78caf58d41393d11e04d5db87dc04613472"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): engine/crates/organize/src/import.rs:591-610 | engine/crates/organize/src/import.rs:613-633 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/import.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d125426e679be9db3ddb5009625ea38412458981dd1c0be39a5e650384e03e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): engine/crates/render/src/inspect.rs:1122-1145 | engine/crates/render/src/inspect.rs:1155-1182 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"971bfe705f835138401d36bd1b70b740161564c1fd13f099143cbe298bffbf66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): engine/crates/a11y/src/headings.rs:106-126 | engine/crates/a11y/src/tags.rs:209-228 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/headings.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea4f57292f9bbbdcfb458021e004d5c887eebe36f88efde72b2263db9a3491b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/crates/render/src/inspect.rs:2230-2243 | engine/crates/xfa/src/packets.rs:84-98 \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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b82ece9cf1150b51d0c2d4e1eeaa4ee5b978a1ba75ca0fd4dd91728a72018ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt:538-553 | android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt:557-572 \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":"android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13657aebaa9550509cd7e4f9d605062597c0c0bbcc574c5ec2019ad65b9df6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): engine/crates/edit/src/indic.rs:122-141 | engine/crates/edit/src/indic.rs:145-167 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/indic.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d5017ce6620d4383a8a238b1eae676fabd425211204e15e9662863896b4a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): engine/crates/create/src/office/draw.rs:54-70 | engine/crates/create/src/office/draw.rs:72-87 \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":"engine/crates/create/src/office/draw.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89b4cd2be96b45cdae10289090834e48a3a173b64fccbf66679e77a77ecb5c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): engine/crates/xfa/src/layout.rs:362-385 | engine/crates/xfa/src/parse.rs:694-717 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9beb09eb34a6832f10583d8452485bcb5d514bc59498045cb7be6cdf8607ddc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): engine/crates/create/src/office/zip.rs:174-195 | engine/crates/forms/src/lib.rs:241-260 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/zip.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"af432b87804aacbdce88cf3c14c85a6e6f3dae5546cacdbbdf44ecbcb74f4a92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): engine/crates/forms/src/author.rs:550-565 | engine/crates/organize/src/import.rs:879-893 \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":"engine/crates/forms/src/author.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0b1841873069b29c055ee260b9fbf091bc46e46bb3031a991b9a7f4e5681f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/crates/forms/src/author.rs:500-508 | engine/crates/redact/src/lib.rs:157-165 \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":"engine/crates/forms/src/author.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a683bd6ca2aa45f5edb33096ed29d6494b868bc54a1b8654da9996e9469736bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/ui/home/Cards.kt:97-111 | android/app/src/main/java/com/chethan616/clearpdf/ui/home/Cards.kt:411-425 \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":"android/app/src/main/java/com/chethan616/clearpdf/ui/home/Cards.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"839e7f7796521c902f599f65e368a068918ca25bcbd53816a5c0e5452fe5279b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): engine/crates/edit/src/added.rs:45-60 | engine/crates/xfa/src/text.rs:34-49 | engine/crates/xfa/src/text.rs:57-72 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/added.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46a706c78b07910c317f475f1241b7c559fd3f0be80451a2f040d932fe0cd0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/crates/xfa/src/data.rs:747-757 | engine/crates/xfa/src/data.rs:760-769 \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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf50a94243afc96cb2bfcf2b9ee1ad8bd2155c15770a60828156e1150bb36dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/crates/render/src/inspect.rs:522-531 | engine/crates/render/src/inspect.rs:535-546 \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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5193fae11b186f900f39b0ed35520b1a25307909c5b9f0da28a5d2cbfd292c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): engine/crates/model/src/lib.rs:21-25 | engine/crates/organize/src/boxes.rs:54-58 | engine/crates/redact/src/lib.rs:152-155 \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":"engine/crates/model/src/lib.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbfe6f84b6472cb053d67fe6de0c5ab92975bf708407edc013da828de253c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/crates/cos/src/writer.rs:651-662 | engine/crates/js/src/formcalc.rs:1874-1889 \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":"engine/crates/cos/src/writer.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"c175dc95ca927943e6e656b023bdc5eda11c61523d1bc4a9b8d9c45e77b093d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/crates/engine/src/text_preview.rs:71-79 | engine/crates/engine/src/text_preview.rs:83-91 \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":"engine/crates/engine/src/text_preview.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd467b907e397b2c8e45bdce28ab0f7b172829413ab22a91f0830b008eff983"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/ui/onboarding/Onboarding.kt:344-352 | android/app/src/main/java/com/chethan616/clearpdf/ui/onboarding/Onboarding.kt:355-363 \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":"android/app/src/main/java/com/chethan616/clearpdf/ui/onboarding/Onboarding.kt"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee3306617dcc939fa927e2b9f82080ff13a8646d098030c436c5f9cbf44b466"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/crates/sign/src/pdf.rs:165-178 | engine/crates/sign/src/pdf.rs:180-193 \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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a095b6b7440e9929e85e2caa45756da744a0d956d2dfe4689854299d1206fcf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/crates/forms/src/af.rs:890-896 | engine/crates/xfa/src/data.rs:352-357 \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":"engine/crates/forms/src/af.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"517cfe115213b14ac682958afe84a1b0c40b2f62296589fb9c0855187bc7df4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt:341-352 | android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt:355-366 \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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42fc8cf5cfff12acb8a1400f0262eedc7fa8a0a2c37a428c638f7e29a743fcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): engine/crates/forms/src/lib.rs:650-666 | engine/crates/render/src/inspect.rs:1814-1835 \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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eeb5f5eddf669f011d382efe268fb35ad9ce69590b3397e490b294c8505a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/crates/filters/src/predictor.rs:96-105 | engine/crates/filters/src/predictor.rs:107-118 \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":"engine/crates/filters/src/predictor.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc64e6a9f3a0e3afddde964c65d4d359ddbf12bad5b29aa6d0a2ebf0c7d335fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt:665-678 | android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt:2255-2267 \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":"android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ec8bc0c746a0ea4c66606bbe6b2c68673378386978a056050d431835911a17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/crates/xfa/src/data.rs:496-513 | engine/crates/xfdf/src/lib.rs:194-213 \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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cbbf6191bd973c7459dd5e9897a657fc22ddbf2838b04f5f78188533e0e49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/crates/cos/src/writer.rs:489-497 | engine/crates/organize/src/dedupe.rs:179-187 \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":"engine/crates/cos/src/writer.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"470d25a6747282026e681292864ed3bc35aa07ef70fa01bd7b5ce511d99bb761"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/crates/annot/src/appearance.rs:284-292 | engine/crates/xfa/src/pdf.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":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51a85274ab3438179ca795586b9f040e6ee2b1aa78f3ca90374bc0953eb6957"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/crates/cos/src/object.rs:285-290 | engine/crates/cos/src/object.rs:325-328 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/object.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ac86a79359446ac6523dc7f99af6b4ff3608ee5a230b1aa7265a77ce5de0f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/crates/organize/src/attachments.rs:86-98 | engine/crates/organize/src/import.rs:1372-1381 \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":"engine/crates/organize/src/attachments.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8af23ec7c6748fb874e852bd9ab6e9faa4d1d8aff6a5e8991f1f05f70b8dd8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/crates/render/src/inspect.rs:231-241 | engine/crates/render/src/inspect.rs:244-254 \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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c311e613efcc816c91d428a6167033d4c6d36d166ccb1791d3afb7ba67c96f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): engine/crates/engine/src/signature_image.rs:30-42 | engine/crates/engine/src/stamp_preview.rs:47-58 | engine/crates/engine/src/text_preview.rs:20-32 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/signature_image.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"350074ad2976b3f3c34cf3989c703e79707a5d81a66e14851d1c218cc09add01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): engine/crates/edit/src/images.rs:408-412 | engine/crates/sign/src/graphic.rs:64-69 \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":"engine/crates/edit/src/images.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6da3eabdae9a013d1a700735bf5d7087e0831ea16750d188e106e1a8b1f2ced"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): engine/crates/js/src/formcalc.rs:528-541 | engine/crates/js/src/formcalc.rs:543-556 \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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9b5df2c821015829f683ac73bcd0b904a73c1f7f15b3ff3fa867b98116ba25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): engine/crates/a11y/src/alt.rs:65-77 | engine/crates/a11y/src/structure.rs:414-426 \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":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c724ecce0f2cb52fc4e4a54a0c2e8cdda3fbce463a83857339347d658f52f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/crates/annot/src/appearance.rs:331-340 | engine/crates/forms/src/appearance.rs:387-394 \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":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f706105019bbec23b42924de1e6b9ccf17a8adccac4563522dc25bb35c8d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/crates/automation/src/comments.rs:78-81 | engine/crates/render/src/inspect.rs:292-295 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/comments.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0b8538073f51334833f8991b490fe0cb518f20c849f929d1de052e85777b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/crates/engine/src/export.rs:87-94 | engine/crates/engine/src/export.rs:97-104 \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":"engine/crates/engine/src/export.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a602ac72bbebbbb83fc674c2b5043ecbf20446ce8aacd0a0ac7f064afc00b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/crates/engine/src/lib.rs:5244-5253 | engine/crates/engine/src/lib.rs:5257-5266 \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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":5244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67af636c06dbfbff51af41343f015474d75fd440c92416b02293f256a396484"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/ui/home/Cards.kt:353-362 | android/app/src/main/java/com/chethan616/clearpdf/widget/WidgetCards.kt:295-302 \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":"android/app/src/main/java/com/chethan616/clearpdf/ui/home/Cards.kt"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b56276627d037596c0ee1e46d51c2e50f8c55313dc646b3ca888374aabca2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/crates/organize/src/lib.rs:665-673 | engine/crates/preflight/src/xmp.rs:172-175 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/lib.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f1146a200ad0f2c3e581dc9b83ead0de90e09af675b5e24ce9892ae5bda977"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/crates/xfa/src/layout.rs:1128-1135 | engine/crates/xfa/src/layout.rs:1139-1151 \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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c277ebc8b6fd7a81708a1268a2abe161568c5f64a0d8b0fd419e34cd3b96bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/crates/a11y/src/alt.rs:149-152 | engine/crates/edit/src/lib.rs:367-370 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"03047e1c411ea9d4409ee26008a7fcd567da95e96c60032340e93df352906b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): engine/crates/engine/src/lib.rs:5324-5334 | engine/crates/engine/src/lib.rs:5344-5355 | engine/crates/engine/src/lib.rs:5359-5367 | engine/crates/engine/src/lib.rs:5371-5378 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":5324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7110659c496dd1e37e9333d67338065e094ea9f2625935c62c44267ad317af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DigitalSign.kt:391-406 | android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/FillSign.kt:302-310 \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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DigitalSign.kt"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14ab2cb9f6da8963dbdfda46ca96331095b9bb72454127741a485e58ed8d909"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/crates/sign/src/keychain.rs:45-55 | engine/crates/sign/src/windows.rs:74-85 \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":"engine/crates/sign/src/keychain.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99f5422a4563fc0fd30fd25882905c8176a49bd5c7f8fb1dcd83c7451eec275"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/crates/measure/src/lib.rs:626-634 | engine/crates/measure/src/lib.rs:635-642 \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":"engine/crates/measure/src/lib.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f4b3b7b608111b0a67015e4c94cb2ec325292c86afe681135e93b3c074ecd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/crates/a11y/src/alt.rs:155-161 | engine/crates/a11y/src/content.rs:56-63 \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":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3bd791b21d7716761c3c72a462778050d45cfdabd54a69bf0a84074b689f28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/crates/js/src/formcalc.rs:477-488 | engine/crates/js/src/formcalc.rs:490-501 \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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"023f9a958910e306a14bbe8ffba280cfa181a5f6a47b423c3f058069cb37b9da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): android/backdrop/src/main/java/com/kyant/backdrop/highlight/HighlightStyle.kt:80-95 | android/backdrop/src/main/java/com/kyant/backdrop/highlight/HighlightStyle.kt:111-125 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/backdrop/src/main/java/com/kyant/backdrop/highlight/HighlightStyle.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd366d89fdb1c5dbe4ab2e14e7829adccb6da7085e7eeb5a9433a4a56e2f1418"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): engine/crates/edit/src/text.rs:2761-2766 | engine/crates/export/src/lib.rs:617-621 \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":"engine/crates/edit/src/text.rs"},"region":{"startLine":2761}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79302417977af703e47f531f1aa76cf862a4ff3dd85d31626faad66a8f8c144"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreviewActivity.kt:209-214 | android/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreviewActivity.kt:216-220 \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":"android/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreviewActivity.kt"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21fc317c09aa9a2382fcbc4235d95bebc225a013277ffe6333581f678a4918d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/crates/create/src/office/docx.rs:285-288 | engine/crates/create/src/office/docx.rs:290-293 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd600e146c41366f1b3df746d6ee9d2b6c768ae483e6eae781ff749687506adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/engine/DocumentFiles.kt:97-104 | android/app/src/main/java/com/chethan616/clearpdf/engine/DocumentFiles.kt:107-112 \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":"android/app/src/main/java/com/chethan616/clearpdf/engine/DocumentFiles.kt"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3202e5c4272a33b11bb2e0b0a47257c79ccd4358684097a54962f6e57847369"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): engine/crates/render/src/text.rs:909-917 | engine/crates/render/src/text.rs:949-957 \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":"engine/crates/render/src/text.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf12d5cb1b3f2b514aff16144454a731cdadacd6ce707bfec1a949c97b5de6f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): engine/crates/automation/src/lib.rs:2505-2509 | engine/crates/automation/src/lib.rs:2531-2535 \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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b4b8a7a9d9eb1dc5692243ceccc9c4e178a59341c6c2a59f4c8fd92b68e81c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt:264-270 | android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerOverlays.kt:269-277 \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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed71241fec4287de3e1f2bb0557841920b86fe03cbdb93b767fc269488f0d67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/crates/automation/src/a11y.rs:418-424 | engine/crates/automation/src/a11y.rs:970-976 \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":"engine/crates/automation/src/a11y.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cac6568e097db3d2c7dc6713d7c0801bddc57a41bf90d8d5b7263a835982c13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/crates/automation/src/comments.rs:600-606 | engine/crates/automation/src/comments.rs:608-613 \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":"engine/crates/automation/src/comments.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5705c2d49c5e4407b87541d2b1ea4a8ac7c1e384fdd0fbd6706efba836d5e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/widget/ArtefactWidgets.kt:475-479 | android/app/src/main/java/com/chethan616/clearpdf/widget/ArtefactWidgets.kt:481-486 \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":"android/app/src/main/java/com/chethan616/clearpdf/widget/ArtefactWidgets.kt"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bc6238384f48b823c1b8fbad6be25d6767870b4d86e7b116662604943de823"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): engine/crates/engine/src/lib.rs:5112-5123 | engine/crates/engine/src/lib.rs:5187-5197 \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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":5112}}}],"partialFingerprints":{"codehealthFindingId/v1":"908befe900dfd27d81f5e29be072247a26c05a27b88520a1b6acd61ca57e7ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/crates/create/src/office/docx.rs:1476-1487 | engine/crates/create/src/office/docx.rs:1489-1500 \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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2f1934d3473a5255089bb276e2d082a826815bd1e2eefde8911df1b01152b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): engine/crates/create/src/office/xlsx.rs:341-351 | engine/crates/forms/src/af.rs:831-840 \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":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbeaded7de80abf231751cad4f7e3e62101f7c95453ad9d1ad89bbe6745589c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 5\u002B corresponding lines): engine/crates/annot/src/lib.rs:1650-1654 | engine/crates/edit/src/lib.rs:258-262 | engine/crates/forms/src/appearance.rs:31-35 | engine/crates/ocr/src/lib.rs:211-215 | engine/crates/xfa/src/pdf.rs:97-102 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f72ff38b3815e1735fa4919c2520be630b6a4fc47d55ed0a009cb971013b57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/crates/create/src/office/pptx.rs:179-184 | engine/crates/create/src/office/pptx.rs:217-223 \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":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b85fd3c9f3e08dd547f5a9bb22289786b47a2f9c8e4a8f7250fa963a680c895"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/crates/export/src/xlsx.rs:95-106 | engine/mobile/src/xls_art.rs:81-92 \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":"engine/crates/export/src/xlsx.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f60cd170de381427af510ba5c6f5a28b32e85be98b9e61286f895ae6651991"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): engine/crates/cos/src/document.rs:1175-1182 | engine/crates/cos/src/document.rs:1233-1240 \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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a64b8261044d03e0220769207ffdd5c1c3bbfbab71d54aa264bbffb09ff14d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/notes/Notes.kt:175-179 | android/app/src/main/java/com/chethan616/clearpdf/notes/Notes.kt:252-259 \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":"android/app/src/main/java/com/chethan616/clearpdf/notes/Notes.kt"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4565d2e8fe2ab083179d8e8d13c330e8f4d859f0f5cb4dde1f82dc2b9074850"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/crates/xfa/src/script.rs:109-115 | engine/crates/forms/src/lib.rs:527-532 \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":"engine/crates/xfa/src/script.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"953be3aecceff1b7f118a26eed03d4edb1bb65383ffe5d4d088285fb725ba8b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Backdrops.kt:65-73 | android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Surfaces.kt:98-106 | android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Surfaces.kt:119-129 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Backdrops.kt"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7b21ec67af1b1dd085c20a4bb621751c293ac894f117e27c6c350b74d74904"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): engine/crates/annot/src/lib.rs:967-969 | engine/crates/edit/src/added.rs:238-240 | engine/crates/edit/src/text.rs:683-685 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd70faa1be0accba520cb89e443dff38ecab7389986f91208c925c259ae77fa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): engine/crates/edit/src/indic.rs:14-27 | engine/crates/fonts/src/lib.rs:74-89 | engine/crates/xfdf/src/lib.rs:815-826 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/indic.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba148f9ae385f43c5cdef9ffcc2c64cb6c14c502b5da48fff14465b0de8afb38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/crates/preflight/src/lib.rs:164-171 | engine/crates/organize/src/pdfx.rs:167-172 \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":"engine/crates/preflight/src/lib.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5078ecfc9d1450f1634e8222eda2300aa6085946fe5fc85dad9f91947cc819f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): engine/crates/annot/src/lib.rs:725-728 | engine/crates/forms/src/lib.rs:490-493 | engine/crates/organize/src/lib.rs:95-98 \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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb57a19da997c86000e8cba315b2ab54d98146c3e544635ae8d1965b9f658f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): engine/crates/js/src/lib.rs:249-260 | engine/crates/js/src/xfa.rs:314-325 \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":"engine/crates/js/src/lib.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c79b95bf77eea70678657ce64e9f42d62cd4b7feba5b480129b8579330ccdf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/a11y/src/content.rs:169-171 | engine/crates/a11y/src/structure.rs:409-411 \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":"engine/crates/a11y/src/content.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d212d9ad95dd19c059e24868dca2041e2c0a13c7c7e999ef4e1af34576bda5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 3\u002B corresponding lines): engine/crates/annot/src/links.rs:85-87 | engine/crates/edit/src/added.rs:234-236 | engine/crates/fonts/src/pdf.rs:72-76 | engine/crates/sign/src/pdf.rs:1683-1685 | engine/crates/xfdf/src/lib.rs:245-247 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/links.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32bb5c0142e56346c460600bb55ded53fa9c0d1b9a75f9c98512ff9b648a43a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): engine/crates/annot/src/lib.rs:705-709 | engine/crates/organize/src/lib.rs:69-73 \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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"6371b5f7ecdf860586ac74cbc5eb0aa2c634397a4b4dbc69c4eea1595be31e93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/crates/forms/src/appearance.rs:627-633 | engine/crates/forms/src/appearance.rs:637-643 \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":"engine/crates/forms/src/appearance.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38be8ba7d2f245453af07286827338f11706006736a0f3549ae191b37b82488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/crates/sign/src/keychain.rs:38-41 | engine/crates/sign/src/windows.rs:67-70 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/keychain.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3a0f4467fc843472d174be40de5779e803695a6f5d23a1f8ae13362381639b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): engine/crates/edit/src/bidi.rs:47-53 | engine/crates/redact/src/patterns.rs:202-207 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/bidi.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"77165fbfc564c8ec15a2dcac930605835fd76d3a15822d29ec7b5043a3b452f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/crates/engine/src/lib.rs:600-603 | engine/crates/engine/src/text_preview.rs:57-62 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"99111dd1a8cf54d70c0863f46c98d36a7d69c36a221b59aee93febd2d9f677c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): engine/crates/edit/src/flatten.rs:21-24 | engine/crates/forms/src/lib.rs:467-470 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/flatten.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26ce95a736b3419cc12d40368495a72258815cbe37bf880c0779bf4949f797d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): android/backdrop/src/main/java/com/kyant/backdrop/effects/ColorFilter.kt:20-30 | android/backdrop/src/main/java/com/kyant/backdrop/effects/RenderEffect.kt:15-25 \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":"android/backdrop/src/main/java/com/kyant/backdrop/effects/ColorFilter.kt"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed57602d906561ba4530c4ee8d00581962a965d66909b7e21db0552e0f96762"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/create/src/lib.rs:156-158 | engine/mobile/src/ppt.rs:116-118 \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":"engine/crates/create/src/lib.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e645d08a4105a6dee2643d1d0a4aea703683dfa3410313d73778e35daaba32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/crates/optimize/src/links.rs:69-75 | engine/crates/organize/src/outline.rs:230-236 \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":"engine/crates/optimize/src/links.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9009e26b2722492eec3bfa965371512b0e0634d3bd897dffbd2059dc68fa696b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/create/src/office/docx.rs:817-819 | engine/crates/create/src/office/pptx.rs:611-613 \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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b7422e4dac9accfb94b5e32d18ae466206daf8a1cda714167a677147e7e21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/automation/src/a11y.rs:674-676 | engine/mobile/src/office.rs:228-230 \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":"engine/crates/automation/src/a11y.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc8df5f35a1ed0c1630aa2a9dec01577a9cca79d7148140e28ace72b237b57a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): engine/crates/js/src/lib.rs:270-276 | engine/crates/js/src/xfa.rs:419-425 \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":"engine/crates/js/src/lib.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdf6f10ed1769188864e855a9548c6f43dcc4902ae154962a234b96260e3498"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): engine/crates/js/src/lib.rs:719-723 | engine/crates/js/src/xfa.rs:1221-1225 \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":"engine/crates/js/src/lib.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba2d0367f70c1760d07293e23519438b6098ca78f54875bddafa607e1d65a74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): android/backdrop/src/main/java/com/kyant/backdrop/effects/ColorFilter.kt:79-86 | android/backdrop/src/main/java/com/kyant/backdrop/effects/RenderEffect.kt:43-48 \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":"android/backdrop/src/main/java/com/kyant/backdrop/effects/ColorFilter.kt"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdce6052e048dbc719adc622994818cd0c73204d59b0c617d3fab5a071cf0798"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/edit/src/text_reading.rs:293-295 | engine/crates/export/src/lib.rs:519-522 \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":"engine/crates/edit/src/text_reading.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edfc436f2ce2941a4e50a3c79f1062601f1a6cb8bb02fcb4a8a2ab05b6ca70d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/engine/src/ocr.rs:75-77 | engine/crates/ocr/src/lib.rs:104-106 \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":"engine/crates/engine/src/ocr.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7ca6a005ffcea23a5b4c84cf2d6b54f83324b1352d8f44ce6f609f0e6513f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/forms/src/appearance.rs:491-493 | engine/crates/forms/src/lib.rs:1458-1460 \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":"engine/crates/forms/src/appearance.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ad92a02c9efa5de9ff4923c74383827933b414496f0f9182b1d33dcea2a9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/organize/src/pdfx.rs:189-191 | engine/crates/preflight/src/xmp.rs:143-145 \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":"engine/crates/organize/src/pdfx.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4453621a7cb2d0f9af5cdf890a11e2b124005e426e4d0db19af8685bf15c90f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): engine/crates/a11y/src/tags.rs:150-152 | engine/crates/cos/src/security.rs:14-16 | engine/crates/xfa/src/data.rs:289-291 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/tags.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b65879634f1183731c1436fb366c1582a320af063bd9516807d40b51ccc60a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): engine/crates/cos/src/object.rs:411-417 | engine/crates/preflight/src/lib.rs:205-211 | engine/crates/render/src/inspect.rs:1037-1043 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/object.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaea8a248b831474c0274aa70063195652f0c7971cc5f1d882efff0354880a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): engine/crates/a11y/src/content.rs:66-68 | engine/crates/a11y/src/headings.rs:170-172 | engine/crates/optimize/src/audit.rs:122-124 | engine/crates/redact/src/interp.rs:391-393 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/content.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"12076dbc6c11026035955a638356b5c1942ce9be6e211f40d7e6177af1c66064"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/a11y/src/content.rs:143-145 | engine/crates/preflight/src/lib.rs:159-161 \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":"engine/crates/a11y/src/content.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3c3274556316d3aa00974af323a7e4357c1689a7ca3a30332bb36d636c109e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): engine/crates/a11y/src/lib.rs:35-38 | engine/crates/export/src/lib.rs:117-120 | engine/crates/optimize/src/images.rs:256-259 \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":"engine/crates/a11y/src/lib.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee442b4d35df29d9d84b6bfb3b8f451cd0d223ced4e877a8b2da8ed5921bdcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/create/src/office/xml.rs:106-108 | engine/crates/xfa/src/parse.rs:65-67 \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":"engine/crates/create/src/office/xml.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"45285c72999ccd52cee5c9c93d3d041386e370168a0afacc5301372d622679e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): engine/crates/edit/src/added.rs:362-364 | engine/crates/edit/src/bidi.rs:28-30 | engine/crates/edit/src/text.rs:2296-2298 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/added.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47b22fbb103160bb4e1eeab94b76ab56bf24a01d4fda69ef1a1d1454d149fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): engine/crates/a11y/src/report.rs:10-12 | engine/crates/automation/src/a11y.rs:137-139 | engine/crates/preflight/src/xmp.rs:147-149 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/report.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3058199242bf8697378f687d57d8d38f3a7ff165688cef639ab80a0dc06ee4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/create/src/office/xml.rs:101-103 | engine/crates/xfa/src/parse.rs:61-63 \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":"engine/crates/create/src/office/xml.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"321897f63e8ed132e7003027a0793265d0f6fbb7fc41c497562682def7f79d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/annot/src/appearance.rs:230-232 | engine/crates/xfa/src/pdf.rs:104-106 \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":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e4f84d9002f4bd67562991745339c7c2ddbaee61ce945a5eb22fc1d13cc0dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): engine/crates/annot/src/lib.rs:854-856 | engine/crates/organize/src/lib.rs:163-165 \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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ee49f0cc816a78713dd0fdd37b0d690f16ed2d5a60e45dc9637fd5b1ab1be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): engine/crates/annot/src/lib.rs:955-957 | engine/crates/forms/src/author.rs:113-115 | engine/crates/xfa/src/pdf.rs:108-110 | engine/crates/xfdf/src/lib.rs:280-282 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a05818a5664643013c3749850855a9248351642f08f62f4ad206cee1dc1604"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt:154-156 | android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerBars.kt:528-530 \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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d099c305a393bec0860a0baee80dfefc1c14995c7fb76489f09d3dd117ea2e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): engine/crates/xfa/src/lib.rs:57-91 | engine/crates/xfdf/src/lib.rs:114-148 \u2014 before extracting anything, compare \u0060engine/crates/xfa/src/lib.rs\u0060 and \u0060engine/crates/xfdf/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/crates/xfa/src/lib.rs:57\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":"engine/crates/xfa/src/lib.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f937db81eb5fc9b54e426196ce4ef383e5f68a87102014ff0d2f3efb37a4adfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): engine/crates/forms/src/appearance.rs:537-564 | engine/crates/forms/src/appearance.rs:1022-1049 \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 \u0060engine/crates/forms/src/appearance.rs:537\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":"engine/crates/forms/src/appearance.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"2770b3445c0ff24dbed982545abbc667ace03378d1d06b483603938b99cdca33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): engine/crates/edit/src/text.rs:1653-1678 | engine/crates/edit/src/text.rs:1775-1799 \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 \u0060engine/crates/edit/src/text.rs:1653\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":"engine/crates/edit/src/text.rs"},"region":{"startLine":1653}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d1963c73bd6771c43a723ef016ec31a6438e67f0f5f3e898879a92a180056c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): engine/crates/redact/src/lib.rs:448-462 | engine/crates/redact/src/sanitize.rs:392-404 \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 \u0060engine/crates/redact/src/lib.rs:448\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":"engine/crates/redact/src/lib.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0af857482f5530d98ee4f5e65e6fc62fc8de3d8562449da043e43bc951f192"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 3): engine/crates/a11y/src/lib.rs:515-536 | engine/crates/forms/src/table.rs:379-398 | engine/crates/print/src/lib.rs:93-113 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/lib.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"959d5a29958aff381b0367d9ec9215eab76e4fec268221eeaa928981550a2919"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): engine/crates/cos/src/document.rs:1984-1997 | engine/crates/cos/src/document.rs:2054-2065 \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 \u0060engine/crates/cos/src/document.rs:1984\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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ef281718da58d31107629a023d7fd0195e67e0a603671c466d55bca62c49b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/crates/edit/src/text.rs:1279-1292 | engine/crates/redact/src/interp.rs:927-940 \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 \u0060engine/crates/edit/src/text.rs:1279\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":"engine/crates/edit/src/text.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a25d25a05afef17e6c9c6cff90aab8c0db81fc6982605aa91cac11875d11d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/crates/forms/src/lib.rs:501-514 | engine/crates/organize/src/lib.rs:106-119 \u2014 before extracting anything, compare \u0060engine/crates/forms/src/lib.rs\u0060 and \u0060engine/crates/organize/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e35dc68ff9a2158771dd4bd62e09a42b16a751ecd02e4e4d1f524908447a50a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): engine/crates/preflight/src/xmp.rs:83-95 | engine/crates/xfa/src/lib.rs:67-79 | engine/crates/xfdf/src/lib.rs:124-136 \u2014 before extracting anything, compare \u0060engine/crates/xfa/src/lib.rs\u0060 and \u0060engine/crates/xfdf/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/crates/preflight/src/xmp.rs:83\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":"engine/crates/preflight/src/xmp.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a65c0450ef0a9fd78639abd47ecb950acbb8bbd71db4d9be143b47daed7572"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/crates/a11y/src/alt.rs:251-262 | engine/crates/optimize/src/images.rs:66-77 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/crates/a11y/src/alt.rs:251\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53ce148486bca1c6d66f2f2ec84e9270d578f5ed57c994f2a44ff93048e1f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/crates/forms/src/lib.rs:655-666 | engine/crates/render/src/inspect.rs:1824-1835 \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 \u0060engine/crates/forms/src/lib.rs:655\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060seen\u0060 to \u0060\u0026std::collections::HashSet\u003CObjRef\u003E\u0060 in one and \u0060\u0026HashSet\u003CObjectId\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/forms/src/lib.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"219442f9acf9890c44da0d2cb8f6c818666559df5e514b90b298a20ef70d853e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/crates/js/src/formcalc.rs:1520-1531 | engine/crates/js/src/formcalc.rs:1536-1547 \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 \u0060engine/crates/js/src/formcalc.rs:1520\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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b91f0f32710fcf22f106baee7c30171abda07c6a34ec96d5b49e34dcc22a6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): engine/crates/render/src/inspect.rs:673-684 | engine/crates/render/src/inspect.rs:697-708 \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 \u0060engine/crates/render/src/inspect.rs:673\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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee9f869865d52d0f240950592a15435470dd68a3e0a137cc858fd19ae108e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/crates/engine/src/lib.rs:4182-4192 | engine/crates/engine/src/lib.rs:4211-4221 \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 \u0060engine/crates/engine/src/lib.rs:4182\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":4182}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08a30c23521705697951a42af3b5074abf98f4e542bd695d400a313fcf11ad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): engine/crates/sign/src/der.rs:447-457 | engine/crates/sign/src/der.rs:474-484 \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":"engine/crates/sign/src/der.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4bb26d618172476f62fb9f1517eee3bb6039f927868dc22f7ac96f45d17411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): engine/crates/a11y/src/headings.rs:215-224 | engine/crates/edit/src/inline_forms.rs:668-677 | engine/crates/edit/src/text.rs:1280-1289 | engine/crates/redact/src/interp.rs:928-937 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/a11y/src/headings.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbc0408f29eb18f6a8a054c770135effae6f93ce389d18f9482052a3cadd5ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): engine/crates/forms/src/lib.rs:507-516 | engine/crates/model/src/lib.rs:169-178 | engine/crates/organize/src/lib.rs:112-121 \u2014 before extracting anything, compare \u0060engine/crates/forms/src/lib.rs\u0060 and \u0060engine/crates/organize/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffaa48a5fa5abe785f0cf59290ec63e96cda594222edc61cf0b2b957f6a5271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/crates/automation/src/tools.rs:1064-1073 | engine/crates/automation/src/tools.rs:1081-1090 \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 \u0060engine/crates/automation/src/tools.rs:1064\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":"engine/crates/automation/src/tools.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"130bf3a3f6729f216c2ed7407a5803db0dbaf5cdeda43ca4520730d88691b99b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/crates/forms/src/author.rs:1346-1355 | engine/crates/xfa/src/pdf.rs:415-424 \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 \u0060engine/crates/forms/src/author.rs:1346\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":"engine/crates/forms/src/author.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbde142af15470458e4cb2dbffe1d0c5f945a319ac0495ac0f869defa338e21c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/crates/redact/src/tags.rs:215-224 | engine/crates/redact/src/tags.rs:490-499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/crates/redact/src/tags.rs:215\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":"engine/crates/redact/src/tags.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4c796785275eb31d9263f7ffcc0f5114197331220ff4bc35d0882f5b3b6825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/crates/annot/src/lib.rs:2350-2358 | engine/crates/sign/src/pdf.rs:481-489 \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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fef3a419b22ae49940878c20444f4f66e17141f861eb5b189d1ec52aa44fcb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/crates/create/src/office/draw.rs:476-484 | engine/crates/create/src/office/draw.rs:500-508 \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 \u0060engine/crates/create/src/office/draw.rs:476\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":"engine/crates/create/src/office/draw.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"80aa3460610c1c824b22dc3bde3bdc50a2c6f0110d378bc9fb5d336ddf2d3ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): engine/crates/edit/src/text.rs:1638-1646 | engine/crates/edit/src/text.rs:1763-1770 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/text.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bab46b8c7dbaa1e917814fe15804b44e6aaa3b740bdc173255467d26dc6cea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/crates/edit/src/text.rs:1700-1708 | engine/crates/edit/src/text.rs:1821-1829 \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 \u0060engine/crates/edit/src/text.rs:1700\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":"engine/crates/edit/src/text.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"380b8f10fc3cef0d18f39f51b8a26ab2e9b78bdd5229ac16c24a0645d1a32d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/crates/organize/src/import.rs:1146-1154 | engine/crates/organize/src/import.rs:1229-1237 \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":"engine/crates/organize/src/import.rs"},"region":{"startLine":1146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d239cf5425ad4d390447c863cf1e1737d6f6cf6f051e3d822b672f2de6de0601"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/crates/annot/src/lib.rs:745-752 | engine/crates/forms/src/lib.rs:509-516 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/crates/annot/src/lib.rs:745\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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"b561d20c9e85ba1e0ab4ba58003ede2b4eb1b7dfffa4d4883f5f7b31f574c9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/crates/create/src/lib.rs:333-340 | engine/crates/xfa/src/image.rs:150-157 \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":"engine/crates/create/src/lib.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b73160f899978f20c40e9fb2c0dc16a90f3221a4c68b57665deb9805dcb2af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20138 lines \u00D7 3): engine/crates/edit/src/images.rs:660-662 | engine/crates/edit/src/images.rs:678-685 | engine/crates/edit/src/images.rs:748-755 \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 \u0060engine/crates/edit/src/images.rs:660\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/images.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbc3436f72999a1e711ba00eb24caca12d8cf5b142a54ee3bf8edb1e9429e87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/crates/edit/src/inline_forms.rs:897-904 | engine/crates/edit/src/text.rs:827-834 \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":"engine/crates/edit/src/inline_forms.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5f53df51a09b951f6117044c6d4f3d14030844d732a9e1bf85b5b1f6964d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20138 lines \u00D7 3): engine/crates/optimize/src/links.rs:44-51 | engine/crates/organize/src/import.rs:599-600 | engine/crates/organize/src/import.rs:622-629 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/crates/optimize/src/links.rs:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/optimize/src/links.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ececaed7a234e689c7b0a649c6953be21312d041182e0d7a7368a34d18600df4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/crates/xfa/src/layout.rs:1082-1089 | engine/crates/xfa/src/layout.rs:1626-1633 \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 \u0060engine/crates/xfa/src/layout.rs:1082\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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ae0daa76052f80ac3a6c02bba9ecb554a6390aca4970f90f8873022c6fccd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/crates/annot/src/lib.rs:1862-1868 | engine/crates/annot/src/lib.rs:1904-1910 \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 \u0060engine/crates/annot/src/lib.rs:1862\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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1862}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ad0b01bacb89d561752093e3e530853860cb45d68a611cd6d8e0305a0df6a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/crates/annot/src/lib.rs:2030-2036 | engine/crates/annot/src/lib.rs:2663-2669 \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 \u0060engine/crates/annot/src/lib.rs:2030\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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9017112e81d79d7839287fb1798ffc27000391d1ae60df876b051cb09cda0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): engine/crates/cos/src/document.rs:1729-1742 | engine/crates/cos/src/document.rs:2000-2013 \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. 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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb941cbe9f1843b1e29240098586e912cc89e74bb018f954241b4c4bc8e0fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/crates/create/src/office/docx.rs:1232-1239 | engine/crates/create/src/office/docx.rs:1274-1281 \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 \u0060engine/crates/create/src/office/docx.rs:1232\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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5574571bfa14299e5002e3a0c8cf3512a35ce415e421a8c847fa2a73c6dd12a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/crates/engine/src/lib.rs:4909-4918 | engine/crates/engine/src/lib.rs:4961-4970 \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 \u0060engine/crates/engine/src/lib.rs:4909\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/crates/engine/src/lib.rs:4960\u0060 calls \u0060Some\u0060, \u0060get\u0060, \u0060Err\u0060 and \u0060engine/crates/engine/src/lib.rs:4908\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":4909}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17a02b6a94870fea010678bb322b5afc153cd1d9c1f75a52ef4c1c0d7829468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/crates/export/src/lib.rs:950-956 | engine/crates/export/src/lib.rs:976-982 \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 before the matched lines, \u0060engine/crates/export/src/lib.rs:948\u0060 calls \u0060Para\u0060 and \u0060engine/crates/export/src/lib.rs:974\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":"engine/crates/export/src/lib.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f56ea532c32b30c604ca4ebfea7ed9071317f8bc4be9cae037fb7cb0a91c57a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): engine/crates/forms/src/author.rs:554-560 | engine/crates/forms/src/author.rs:1691-1697 | engine/crates/sign/src/pdf.rs:2163-2165 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/crates/forms/src/author.rs:554\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":"engine/crates/forms/src/author.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49a81846a774b92b32cd00ce35d9c862b53c7b0cf0d2c880ad03356ac659264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): engine/crates/js/src/formcalc.rs:1751-1757 | engine/crates/js/src/formcalc.rs:1782-1784 | engine/crates/js/src/formcalc.rs:1800-1806 \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 \u0060engine/crates/js/src/formcalc.rs:1751\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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1751}}}],"partialFingerprints":{"codehealthFindingId/v1":"01df05c0924fc045fb2be3c6f1b88f45b5416961b23a1b1fb721ba03ee0f369a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/crates/js/src/formcalc.rs:1902-1909 | engine/crates/js/src/formcalc.rs:1971-1978 \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 \u0060engine/crates/js/src/formcalc.rs:1902\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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1902}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd8e2485950fe97761edef19d4d98474e1d13515dc6f53ea04001ad9013223e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): engine/crates/audit/src/cover.rs:319-324 | engine/crates/edit/src/text.rs:774-779 | engine/crates/edit/src/text.rs:2082-2087 | engine/crates/redact/src/lib.rs:252-257 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. 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":"engine/crates/audit/src/cover.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1f04367934440b87799b7aff620263f187185b6b02b4b1e1764263cbd36466"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/crates/annot/src/lib.rs:736-741 | engine/crates/forms/src/lib.rs:501-506 | engine/crates/organize/src/lib.rs:106-111 \u2014 before extracting anything, compare \u0060engine/crates/forms/src/lib.rs\u0060 and \u0060engine/crates/organize/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/annot/src/lib.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac7b037515fbd52779119f1cc23d85fe53ee2856871035cf306cdaedbf2910a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): engine/crates/preflight/src/xmp.rs:54-74 | engine/crates/xfa/src/lib.rs:41-61 | engine/crates/xfdf/src/lib.rs:98-118 \u2014 before extracting anything, compare \u0060engine/crates/xfa/src/lib.rs\u0060 and \u0060engine/crates/xfdf/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/crates/preflight/src/xmp.rs:54\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":"engine/crates/preflight/src/xmp.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ed6201bd3859ddceca1011ecb7e1e1248d0cc6d538b33311944e2f981b2bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/crates/annot/src/lib.rs:2414-2421 | engine/crates/render/src/inspect.rs:1501-1508 \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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fad23bffcd8f41c807f045bcff9f0c7c738c359d63914db7317ed3d7e06a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/crates/cos/src/document.rs:1610-1618 | engine/crates/cos/src/document.rs:1926-1934 \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 \u0060engine/crates/cos/src/document.rs:1610\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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc358736904270a35cda11498189a916f6cdf556a468160e90fce62f2097e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/crates/cos/src/document.rs:1687-1693 | engine/crates/cos/src/document.rs:1972-1978 \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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"3144f5ed883c3bff9ce008e7f1381460126af3373aed6d0915fa210ba079338d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/crates/create/src/office/docx.rs:633-641 | engine/crates/create/src/office/pptx.rs:59-67 \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 \u0060engine/crates/create/src/office/docx.rs:633\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":"engine/crates/create/src/office/docx.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88f5a535f8f63d25bd4cdba125bcf55576bb69d9ea18bbe53fb139972dde236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/edit/src/flatten.rs:401-406 | engine/crates/xfa/src/script.rs:157-162 \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 \u0060engine/crates/edit/src/flatten.rs:401\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":"engine/crates/edit/src/flatten.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3304faf0a45ef2b96056059a8a1d8bab37f5a8249974762d07acee3bba64ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/crates/edit/src/text.rs:1440-1446 | engine/crates/edit/src/text.rs:1454-1460 \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 \u0060engine/crates/edit/src/text.rs:1440\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":"engine/crates/edit/src/text.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"34db758055ea9b796e9dd4aae0e7539bc5a65488dffd02d1866348ef8d64e1ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/crates/edit/src/text.rs:3295-3301 | engine/crates/edit/src/text_regions.rs:950-956 \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":"engine/crates/edit/src/text.rs"},"region":{"startLine":3295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6cb3767b7fc9158790e679f72eae6d4fb155cf0f4e913de9402bf50e3cba5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/export/src/pptx.rs:422-427 | engine/crates/export/src/xlsx.rs:465-470 \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 \u0060engine/crates/export/src/pptx.rs:422\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":"engine/crates/export/src/pptx.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea6b715dde12bbe3a14a76ad59a24a85a6829bf5b6529557273e96db9418c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/js/src/formcalc.rs:1268-1273 | engine/crates/js/src/formcalc.rs:1576-1581 \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 \u0060engine/crates/js/src/formcalc.rs:1268\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":"engine/crates/js/src/formcalc.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"667d00166b752850629d5811fe80d1781b2953b4476006640acad114a4b41cac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/crates/organize/src/prune.rs:274-280 | engine/crates/organize/src/prune.rs:292-298 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060engine/crates/organize/src/prune.rs:274\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/crates/organize/src/prune.rs:299\u0060 calls \u0060set\u0060, \u0060to_vec\u0060, \u0060Dict\u0060 and \u0060engine/crates/organize/src/prune.rs:281\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":"engine/crates/organize/src/prune.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b386059eecfc58a4841c2fd17e55c5e25924fd6794a6d25f4fb12ab1807b98fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/sign/src/pdf.rs:2463-2468 | engine/crates/sign/src/pdf.rs:2480-2485 \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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":2463}}}],"partialFingerprints":{"codehealthFindingId/v1":"86184ca2bfa215e0b557d05af50e5bc6dd95e1b6b69096e2bb6d38c3abfc763a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/xfa/src/layout.rs:1035-1040 | engine/crates/xfa/src/layout.rs:1081-1086 \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 \u0060engine/crates/xfa/src/layout.rs:1035\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":"engine/crates/xfa/src/layout.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda54d37c99fa10ffec2b746bb92e8b539e388a0af1afcdee43ea72382636cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/xfa/src/lib.rs:168-173 | engine/crates/xfa/src/script.rs:634-639 \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":"engine/crates/xfa/src/lib.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"227d0691958937736083a1fa344457232caa90493d62e80ef50a45ebc6ad9fe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/crates/automation/src/forms.rs:589-593 | engine/crates/automation/src/lib.rs:1403-1407 | engine/crates/automation/src/lib.rs:1612-1616 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn form_tab_order(\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":"engine/crates/automation/src/forms.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b9470eb6e0a783e7fb92ff273d68a5b73cec30d5b3d5e87340bc400730ebd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/automation/src/a11y.rs:525-530 | engine/crates/automation/src/a11y.rs:543-548 \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":"engine/crates/automation/src/a11y.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"174eb89121553fdf782863ce1c76260d4fac34a1d60627151aed49b5bdcda35f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/automation/src/lib.rs:1487-1491 | engine/crates/automation/src/lib.rs:2186-2190 \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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e0808215a5a094fb02702e28ae2ce7a1714f841e2608d822c97c4a0cd84c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/crates/cos/src/document.rs:118-124 | engine/crates/cos/src/document.rs:184-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/document.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"defea6b64cbc464d3b1a7df71d595447afb000d2f7007855280ad99db9775aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/cos/src/document.rs:1654-1659 | engine/crates/cos/src/document.rs:1960-1965 \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 \u0060engine/crates/cos/src/document.rs:1654\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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a72c763fb7456d4c11dd23d778f84a86bedcb861505467379e2f365877f2c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/create/src/office/flow.rs:466-470 | engine/crates/create/src/office/flow.rs:477-481 \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":"engine/crates/create/src/office/flow.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c59998bf6868201a944bc04dac058649bf0610c8aeaf97a744c7f9a90aa6262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/create/src/office/pptx.rs:728-733 | engine/crates/create/src/office/pptx.rs:735-740 \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":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"60283b187c4e332bc211a9b75416aa0a47eff5eab1868f9e5d772131edbc9392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/edit/src/images.rs:638-642 | engine/crates/edit/src/images.rs:706-710 \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. 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":"engine/crates/edit/src/images.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcbe0b411f46ee7985e2e6637dfc70af4314abe32c600fec52eab9de9fcc1f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/edit/src/text_regions.rs:803-808 | engine/crates/edit/src/text_regions.rs:972-977 \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 \u0060engine/crates/edit/src/text_regions.rs:803\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":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"525ff727a62fd5582ae715cda6c58ddc0c9f9b807c1e1cf6708e8025769610dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/edit/src/text_regions.rs:805-810 | engine/crates/edit/src/text_regions.rs:1042-1047 \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":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3bad6c1a314f226192c9974591fe194322ba80fd9bd3cd495e4fe5d5ae42a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/engine/src/camera.rs:161-166 | engine/crates/engine/src/ocr.rs:185-190 \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 \u0060engine/crates/engine/src/camera.rs:161\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":"engine/crates/engine/src/camera.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbd4a949fa7345456418369cfd0019e99315738772a13efb6a5af1e554ad06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): engine/crates/engine/src/lib.rs:4322-4326 | engine/crates/engine/src/lib.rs:4378-4380 | engine/crates/engine/src/lib.rs:4463-4467 \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 \u0060engine/crates/engine/src/lib.rs:4322\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":4322}}}],"partialFingerprints":{"codehealthFindingId/v1":"204ffb3972182c5ee9576acbcd39b97ce5b71894edceb67eb2354dc32f0939a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/engine/src/lib.rs:4744-4748 | engine/crates/engine/src/lib.rs:4798-4802 \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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":4744}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18a31f4d889f2f59d99f95aa13f5da5b50dce94411decafc9fe6b9bd1882c24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/engine/src/signature_scan.rs:320-325 | engine/crates/engine/src/signature_scan.rs:378-383 \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 \u0060engine/crates/engine/src/signature_scan.rs:320\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":"engine/crates/engine/src/signature_scan.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"20216a29ccffc9edb4b037f4880e7972d63ced033e53df34abfc70cbfdbd5c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): engine/crates/forms/src/appearance.rs:917-920 | engine/crates/forms/src/appearance.rs:1099-1103 | engine/crates/forms/src/appearance.rs:1135-1139 \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 \u0060engine/crates/forms/src/appearance.rs:1099\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/crates/forms/src/appearance.rs:1098\u0060 calls \u0060set\u0060, \u0060to_vec\u0060, \u0060name\u0060 and \u0060engine/crates/forms/src/appearance.rs:917\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":"engine/crates/forms/src/appearance.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea4a81fadc657d9f7a512b24cb7c21a1f71a1000929138cf85d95a11d7a363d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/organize/src/import.rs:1187-1192 | engine/crates/organize/src/import.rs:1274-1279 \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 \u0060engine/crates/organize/src/import.rs:1187\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":"engine/crates/organize/src/import.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e11c252dd31577b5d52c9e7cf24e863e5081f6c943d612099b66f9193e5207"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/redact/src/lib.rs:481-485 | engine/crates/redact/src/sanitize.rs:421-425 \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 \u0060engine/crates/redact/src/lib.rs:481\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":"engine/crates/redact/src/lib.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8840906f04fb10c4dc8dc122adbec1c5d22509f9be0351d968422892a59070"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/redact/src/tags.rs:173-177 | engine/crates/redact/src/tags.rs:459-463 \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 \u0060engine/crates/redact/src/tags.rs:173\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":"engine/crates/redact/src/tags.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"522f30fcf5f9b21183031ae9ff5e5f65c6d310b65db70b67302820172f598539"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/render/src/inspect.rs:2234-2239 | engine/crates/xfa/src/packets.rs:90-95 \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 \u0060engine/crates/render/src/inspect.rs:2234\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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":2234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f8caba18399162d663f80be3bada21756949004c2f08bd2fcd549f989fb0c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): engine/crates/cos/src/parser.rs:401-408 | engine/crates/create/src/office/rtf.rs:310-317 | engine/crates/filters/src/asciihex.rs:8-15 \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":"engine/crates/cos/src/parser.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2516842d932c0ddf9eaf2a6d0525df1bb90be4ee56b2adc85950811f761d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): engine/crates/edit/src/added.rs:422-436 | engine/crates/edit/src/bidi.rs:60-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/edit/src/added.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"919d7c2518abdc19c55ba8fc2c64dcc093ded3697ef5e981c7d443c0b647170f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/edit/src/lib.rs:252-256 | engine/crates/print/src/lib.rs:711-715 \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":"engine/crates/edit/src/lib.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a3818731489b6505d3a26c59ba1404c973bc4d60ec75baf01cb959a1f949f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/print/src/lib.rs:717-721 | engine/crates/xfdf/src/lib.rs:215-219 \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":"engine/crates/print/src/lib.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79ae8a81794552dd305bce9b5a4ee8068bc3f9345e061c5837f6f713878a546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/edit/src/images.rs:759-764 | engine/crates/edit/src/text.rs:3591-3596 \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":"engine/crates/edit/src/images.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad585ed4848ea4439762ebcd9ba1c9e7a014629afcaeffd36a58b6e625fa594"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/engine/src/signature_image.rs:160-164 | engine/crates/engine/src/signature_scan.rs:137-141 \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":"engine/crates/engine/src/signature_image.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd71c14f47ae57b081af463d96cf1d015afaefcde395672fa88c086a75dd4f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): engine/crates/create/src/office/pptx.rs:489-501 | engine/crates/create/src/office/pptx.rs:502-514 \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 \u0060engine/crates/create/src/office/pptx.rs:489\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":"engine/crates/create/src/office/pptx.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d79a09453ee29735d7cf395d5bab027f76180b6bf9eae386c71682fed0666d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): engine/crates/sign/src/pdf.rs:1092-1101 | engine/crates/sign/src/pdf.rs:1107-1116 \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 \u0060engine/crates/sign/src/pdf.rs:1092\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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc0bec2646bd2f29e83ca85992dfd6fdb9ff89cd7e18fcffa67ac1c4306a4f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/sign/src/pdf.rs:863-868 | engine/crates/sign/src/pdf.rs:1310-1317 \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 \u0060engine/crates/sign/src/pdf.rs:863\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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed80a649d1ed128fee62fc4884dcf379bc11fcea69d8ccf33436dbfe75188bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): engine/crates/engine/src/lib.rs:3493-3499 | engine/crates/engine/src/lib.rs:4074-4080 \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 \u0060engine/crates/engine/src/lib.rs:3493\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3493}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6685b617e9fe207dc908bd203661d477d00e2cb3c449c5a199a4532b897a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/annot/src/appearance.rs:503-508 | engine/crates/annot/src/appearance.rs:577-582 \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":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c9d32e03572a7a43058367cb07d9209123c1d381736378a288afb3ad324762"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): engine/crates/edit/src/flatten.rs:401-406 | engine/crates/organize/src/import.rs:674-679 | engine/crates/xfa/src/script.rs:157-162 \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 \u0060engine/crates/edit/src/flatten.rs:401\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":"engine/crates/edit/src/flatten.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbc1f56f67628d5a94bce4c36bfd9b9f75208f9b6250dfa1234b4aa13fecbea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/crates/sign/src/pdf.rs:2215-2223 | engine/crates/sign/src/pdf.rs:2281-2289 \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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":2215}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b7a1633c3232252660113b3678b55668bdf920db18d0f25def52371aec2723"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/automation/src/lib.rs:1613-1617 | engine/crates/automation/src/lib.rs:1666-1670 \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 \u0060engine/crates/automation/src/lib.rs:1613\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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a961e237d2a39205047d069191239a2e0cff73538ac7eb7725699302f0754c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/crates/render/src/inspect.rs:1738-1742 | engine/crates/xfa/src/data.rs:1858-1862 | engine/crates/xfa/src/script.rs:553-557 \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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1186f14cf29eee1febec55fca5666dd44ea69f91b5d7515216f0d4c0d15a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/annot/src/lib.rs:1834-1838 | engine/crates/annot/src/lib.rs:1891-1895 \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. 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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d739e3548b5c821e7cf4e5583c9a86b5465d6d68ae8cc529b552b1125dc4d9fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/edit/src/text_regions.rs:648-652 | engine/crates/edit/src/text_regions.rs:670-674 \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 \u0060engine/crates/edit/src/text_regions.rs:648\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":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa714a60c3593e86151062bb98a6f667e587b6520498c2cbea9cc90658dcff48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/a11y/src/headings.rs:113-117 | engine/crates/a11y/src/tags.rs:213-217 \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":"engine/crates/a11y/src/headings.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d40fc84192a0a8a5c3f250b4c72853f2c0473abe948e41fc58ae0fe8c56bee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/annot/src/lib.rs:1222-1226 | engine/crates/annot/src/lib.rs:1237-1241 \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 \u0060engine/crates/annot/src/lib.rs:1222\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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f706301e57204a252c629e366aa5fa21dadbbb66701e873bcaeba138cec2434c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/annot/src/lib.rs:2064-2068 | engine/crates/annot/src/lib.rs:2727-2731 \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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01039d39c3ff21e5f94c8dac6fa835d6b6a2bd0b6cffe06448c3dafaf7bf698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/cos/src/document.rs:484-488 | engine/crates/cos/src/document.rs:1157-1161 \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":"engine/crates/cos/src/document.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d83ca034963db8e2f6ed75a6f858f28740acccef702221bfeeabf0a9f4524e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/crates/cos/src/document.rs:1530-1537 | engine/crates/cos/src/document.rs:1832-1839 \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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"821dda5e767596ddf89c78d195f3b58190118a5a70d21fa50272ce7ccddfba0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/cos/src/document.rs:1643-1647 | engine/crates/cos/src/document.rs:1952-1956 \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 \u0060engine/crates/cos/src/document.rs:1643\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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"02538bd6d711700a6292845f52a735d4e55ba10bb60a7de3337ecf2f4c882bf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/cos/src/document.rs:1748-1752 | engine/crates/cos/src/document.rs:2014-2018 \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":"engine/crates/cos/src/document.rs"},"region":{"startLine":1748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccff897bbfd7218f810105eb367708bac09d8ccaf08dcfa7f547ac132a7c7c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/create/src/extract.rs:76-80 | engine/crates/engine/src/copy_image.rs:133-137 \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 \u0060engine/crates/create/src/extract.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060engine/crates/engine/src/copy_image.rs:138\u0060 calls \u0060insert\u0060 and \u0060engine/crates/create/src/extract.rs:81\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":"engine/crates/create/src/extract.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbeca0a65923caefbe0c2b49e8b6177c3de741f0ed1c7cb82f7126f0b2e5c4fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/create/src/lib.rs:469-473 | engine/crates/create/src/lib.rs:475-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"engine/crates/create/src/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd784d213a95048964724a4d04598d606d70bb0eb4b5bc2c2b5639fd030d76b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/crates/create/src/office/xlsx.rs:1073-1080 | engine/crates/create/src/office/xlsx.rs:1081-1088 \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":"engine/crates/create/src/office/xlsx.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e250f1ea38aae250a71dda56ae08fd15ad4b3b590279216be0b3faac2ab6346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): engine/crates/edit/src/added.rs:85-92 | engine/crates/xfa/src/text.rs:40-47 \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":"engine/crates/edit/src/added.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76d503af70722b0f42436e7e08f0b56ea19b418bfffe2204ff4c86e6779b5c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/edit/src/added.rs:839-844 | engine/crates/edit/src/text.rs:2461-2466 \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":"engine/crates/edit/src/added.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6fcbb417a3b440eda8c568790bf0d3b7d06f451569605dd496e1f5cefb2215"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/edit/src/text.rs:2884-2888 | engine/crates/edit/src/text.rs:3684-3688 \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 \u0060engine/crates/edit/src/text.rs:2884\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":"engine/crates/edit/src/text.rs"},"region":{"startLine":2884}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed34379587cf86739eb3d8787d7bbd5478d8e5eb6ac492f09a81b1f0e06cfcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/edit/src/text.rs:3258-3262 | engine/crates/forms/src/author.rs:144-148 \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":"engine/crates/edit/src/text.rs"},"region":{"startLine":3258}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a3c4a72feac3d55f613d513bcc2a09a8e1cb4b0b684a74700c58d235a3aa3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/edit/src/text.rs:3439-3444 | engine/crates/edit/src/text_regions.rs:1172-1177 \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":"engine/crates/edit/src/text.rs"},"region":{"startLine":3439}}}],"partialFingerprints":{"codehealthFindingId/v1":"2636559d40ad4740f7685059e9fa1a11a421151cde07a5f3c0fa86859b186093"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): engine/crates/engine/src/lib.rs:4262-4266 | engine/crates/engine/src/lib.rs:4365-4369 | engine/crates/engine/src/lib.rs:4429-4433 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/crates/engine/src/lib.rs:4426\u0060 calls \u0060release_working\u0060, \u0060sync_xfa_state\u0060, \u0060Some\u0060 and \u0060engine/crates/engine/src/lib.rs:4261\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":4262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab1700bd11b445043215009a97e46ba0f47ada2fc9dfa56049c0665d4c8b470"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/engine/src/lib.rs:4506-4510 | engine/crates/engine/src/optimizer.rs:62-66 \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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":4506}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bf5ca0aae147cce9da0a5bf6cf5e29ec4dbd95840bc14e1060ff69f83304b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): engine/crates/engine/src/lib.rs:5052-5060 | engine/crates/redact/src/lib.rs:210-218 \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 \u0060engine/crates/engine/src/lib.rs:5052\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":5052}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91eda34635dcbca654b9362dd01a1eb837f5b4bc10b634c3742394492ec7acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/forms/src/author.rs:864-868 | engine/crates/forms/src/author.rs:1450-1454 \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":"engine/crates/forms/src/author.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0bc1579d14855df662f281ebfb26405679cc571908fd82d5b71ffcd863be88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/js/src/lib.rs:1426-1430 | engine/crates/js/src/xfa.rs:1350-1354 \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 \u0060engine/crates/js/src/lib.rs:1426\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060engine/crates/js/src/lib.rs:1424\u0060 calls \u0060property\u0060, \u0060from\u0060 and \u0060engine/crates/js/src/xfa.rs:1348\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":"engine/crates/js/src/lib.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06365637a841a1ec446193f4749d156359b9ad6353f1c6e7371d108bbab8792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/organize/src/attachments.rs:87-92 | engine/crates/organize/src/import.rs:1283-1288 \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 \u0060engine/crates/organize/src/attachments.rs:87\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":"engine/crates/organize/src/attachments.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22c9ecc02532a04eaae13f469733c65660c8d412c8393a85f85d0e12aa35eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/redact/src/interp.rs:1255-1259 | engine/crates/redact/src/interp.rs:1396-1400 \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":"engine/crates/redact/src/interp.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4638ddc2aff130f9b00588ca4852896a34351ea54a5948bc6e0ed511c12003f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/redact/src/tags.rs:204-208 | engine/crates/redact/src/tags.rs:234-238 \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":"engine/crates/redact/src/tags.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0513dd95886baf19909622f67603d89b0675f623342189e687f8eb9e41697f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/sign/src/cms.rs:85-90 | engine/crates/sign/src/cms.rs:130-135 \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. 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":"engine/crates/sign/src/cms.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3596cef16d8dd5673338b933fcb6a99cb77e429f6ec310dc7969c02913ac217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/sign/src/pdf.rs:1813-1818 | engine/crates/sign/src/pdf.rs:1876-1881 \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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1813}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7737e3be5cf4f652a6456c67c24eacdd5c944d4968680d72744e8a9d1f251a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): engine/crates/sign/src/pdf.rs:2081-2085 | engine/crates/sign/src/pdf.rs:2272-2276 \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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":2081}}}],"partialFingerprints":{"codehealthFindingId/v1":"d253371fa519bd4c919c3144c278c25d63657afde311bc35b3f08573a5fad78d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): engine/crates/xfa/src/pdf.rs:484-489 | engine/crates/xfa/src/pdf.rs:524-529 \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":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"665c18f68dc2d2501060474ae60b0f39567cef47c2ec6d675b44ece36f72d59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt:604-622 | android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt:630-648 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt:604\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f231ce5b9f4a11b4d6affee4af19ffcb69e9dff5502fce9fd58f4148e0cc689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Buttons.kt:110-123 | android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Buttons.kt:190-203 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Buttons.kt:110\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Buttons.kt"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"338bf08b8bf0aa02bbda3f0cbf6afe6df89f103b58c6421b5b1393ef5f5acaa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt:214-226 | android/app/src/main/java/com/chethan616/clearpdf/ui/glass/MorphButton.kt:206-218 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt:214\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/glass/MorphButton.kt:204\u0060 calls \u0060Animatable\u0060 and \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt:204\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"219e57885b357af749ea649139e2f103e0e9d529979d9012968df825e4ce55af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoMarks.kt:434-446 | android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoMarks.kt:471-483 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoMarks.kt:434\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoMarks.kt"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4fc7fe4a2974305c72d2834eadc9979765d305e32daae718c64c0d57e049f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PageMenu.kt:77-88 | android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerOverlays.kt:224-234 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PageMenu.kt:77\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PageMenu.kt"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"f732854d8e2c65434c5e14dd3b9ae7148d63652b459fed7391e77852b84a54b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): android/backdrop/src/main/java/com/kyant/backdrop/shadow/InnerShadowModifier.kt:91-99 | android/backdrop/src/main/java/com/kyant/backdrop/shadow/ShadowModifier.kt:82-90 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/backdrop/src/main/java/com/kyant/backdrop/shadow/InnerShadowModifier.kt:91\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":"android/backdrop/src/main/java/com/kyant/backdrop/shadow/InnerShadowModifier.kt"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"726ad6c5210aceb1120ea6f6ce4e56a90aea6387558dcb4fec24faf5d0761bd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt:440-453 | android/app/src/main/java/com/chethan616/clearpdf/ui/glass/MorphButton.kt:309-321 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt:440\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bac468fbbe99ad41269a1f8b0b147d4b908b545da0a99757c90c37844966f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt:1013-1020 | android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt:1324-1331 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt:1013\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/MindMap.kt"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83de2854fb3487994222f5b89f08e6f2daf8c9c934d6cf38ab993d32c16839b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt:418-424 | android/app/src/main/java/com/chethan616/clearpdf/ui/glass/MorphButton.kt:301-305 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt:418\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/LiquidMorph.kt"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc093e01a8c1ab492c346005423d7a37b3f959bcf2323acb8cb68e27a4c1455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/MainActivity.kt:82-87 | android/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreviewActivity.kt:67-72 \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":"android/app/src/main/java/com/chethan616/clearpdf/MainActivity.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5e3008570bf2144972355091c7d034e5cc4a932b148f419fdf957af672c598"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt:388-393 | android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt:443-448 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt:388\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0a56e76e8e0be54135f504cacacb06ae7b77d601bbc3c94ddb006e2bc41f1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt:417-422 | android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt:484-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt:417\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e3d33542c3cb972ee152c4c72675e934e9da07b334e5c66b7f2a647bfc53b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt:419-426 | android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt:643-649 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt:419\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 after the matched lines, \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt:428\u0060 calls \u0060pointerInput\u0060, \u0060startInlineEdit\u0060 and \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt:651\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7366e61ea15ccb9c7e40eac936d74e66962fc8c7fdbb413bd9d7e1a82b01c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt:542-547 | android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt:561-565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt:542\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/desk/SettingsScreen.kt"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c03c5848d8b807794dcb9265b7fd66dd67e2e58c1c404a86ea647f17fe5a7cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt:976-982 | android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt:1111-1117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt:976\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt:983\u0060 calls \u0060feel\u0060 and \u0060android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt:1118\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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c93851a15a88cbe09145cebec5f445b96563d564a50d1201725b412b1a52090"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): android/backdrop/src/main/java/com/kyant/backdrop/highlight/HighlightModifier.kt:58-66 | android/backdrop/src/main/java/com/kyant/backdrop/shadow/ShadowModifier.kt:51-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"android/backdrop/src/main/java/com/kyant/backdrop/highlight/HighlightModifier.kt"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b93490bde7c29a7613e682ee018344f8edef3ed190d8923b30b3f84f9c356e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/glass/MorphButton.kt:325-330 | android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Overlays.kt:449-454 \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":"android/app/src/main/java/com/chethan616/clearpdf/ui/glass/MorphButton.kt"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78cd520c403c28511aeaf13ff19f5598d7399698ef4a97c181458f6debc33aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt:598-602 | android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt:624-628 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d39a61c615a412f3d904c105b613409ddeffff86a97d74551486e15aed6689f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): android/app/src/main/java/com/chethan616/clearpdf/widget/WidgetCards.kt:180-184 | android/app/src/main/java/com/chethan616/clearpdf/widget/WidgetCards.kt:193-197 \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 \u0060android/app/src/main/java/com/chethan616/clearpdf/widget/WidgetCards.kt:193\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":"android/app/src/main/java/com/chethan616/clearpdf/widget/WidgetCards.kt"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"597b86bbcdf60cf29baa1368e94eab89e06962450a34b03bd79a5fe6218d8b6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): engine/crates/xfa/src/fixtures.rs:128-145 | engine/crates/xfa/src/fixtures.rs:647-675 \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":"engine/crates/xfa/src/fixtures.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ec7c9c356f68663decb4b5de10735070530cb82db5b1844890813c5ae90a4d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pdfcraft-a11y: pdfcraft-a11y has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"133f4469e82480c72fcbad9a47163df7cd99d5061927475c982615074f40e2af"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pdfcraft-automation: pdfcraft-automation has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fb746eb3f608a88a032243f11f64e124a3d042acc5d785b2801aff4ea76cd985"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pdfcraft-engine: pdfcraft-engine has instability 0.92 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0916fd978d71d33294d8f45feadcc0d09bcc2b9bcfbab97ab952769c82a11b56"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pdfcraft-optimize: pdfcraft-optimize has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e16379b7ecef485b08bc803b46c33ed5829f1c2c4b68dedfd96a17fcef591b63"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project pdfcraft-redact: pdfcraft-redact has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b9aa1054506da1a3b9cf989cc74d38f5cf6945448da8170e8b710ca5e156218c"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-compare: pdfcraft-compare: 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":"f98031096522540430eb888b9095159e6087c23f922bb52ee1e0b54a1063c556"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-crypt: pdfcraft-crypt: 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":"eeeb03ff7d240514f8353bf6df875d345a561b5e7034da4cc1b7b74475198a03"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-export: pdfcraft-export: 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":"4bfb02a2e855cf4de6e8e87d078509399cdfc0f58f12907c366fd84602649075"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-filters: pdfcraft-filters: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c4d271afbfc4d85a6e0eeec7f3aa244653b2fc6d8aafe3bfc4431837d8eb7b28"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-geom: pdfcraft-geom: 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":"2cdaf38366a4a7ec3fa4b8fde68b0dfa8a46f8d2d60af212beb4ff4ab165f466"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-js: pdfcraft-js: 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":"7e49bb9a4c5643667d11dc8e6d81c19d5a7e87804fc051b7ecf3a9eae2e3bfff"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-platform: pdfcraft-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":"25d88cab565cde4e41e6531d60804b654791bb67313acc9daab4653aaf9d48c4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-model: pdfcraft-model: abstractness 0.00, instability 0.07, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 14 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f968c9b957f63dcc31ce4a6e067986ad91b483c6a2ae2e204d0b905fee2221e6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: :backdrop: :backdrop: abstractness 0.08, instability 0.00, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9118928537554f859203fd5adf883fd57ae15c99a13c29c30c0261409959ce10"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-fonts: pdfcraft-fonts: abstractness 0.00, instability 0.08, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 11 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7e41f1bcebc4ffa3126868d3bb68671321f98c1f0539c3a8d1138c6b3690927f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-cos: pdfcraft-cos: abstractness 0.00, instability 0.09, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 21 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7a54267989eef07559e895d48542f60e09397212b18c9e5284058c5cee2f0d0f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdfcraft-content: pdfcraft-content: abstractness 0.00, instability 0.09, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0d8bcc5a9a6fcc4afaedf06b4f7e8781a85d06b5b0e84ad46674f9e227704766"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: u32x8 (LCOM4 5): u32x8\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/vendor/hayro-jbig2/src/simd.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e8bb2dffb656b0d93652f49ea29bee2b40d6ad93823ce87f41b8351439697e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerScreen.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerScreen.kt changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 116 in ViewerScreenKt.ViewerScreen at line 95. 1 of those changes was a fix/bug commit, and the other 26 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerScreen.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerScreen.kt"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0239d182e7da73309935ad8d31f0c4173759b2d0787e1abf96df77b799b53e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 146 in PhotoEditorKt.PhotoEditScreen at line 274. 3 of those changes were fix/bug commits, and the other 9 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/notes/PhotoEditor.kt"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44f0bfb2d399cce2a6d89eba11f2689c70e86a67ceed4b6c69cb0ddea7daee4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 105 in SheetViewerKt.drawSheet at line 1105. 2 of those changes were fix/bug commits, and the other 11 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/sheets/SheetViewer.kt"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"361c19d63fd61b62b51cb2484468717c3c8c6d32629ac8d5f2272701c66172ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/automation/src/lib.rs: engine/crates/automation/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 256 in Automation::call at line 204. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/automation/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":"engine/crates/automation/src/lib.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5fb1a680f365e76eb6938320e2831a6856053858de24c584afc3d60dbd6222"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in AppViewModel.viewerKey at line 619. 1 of those changes was a fix/bug commit, and the other 37 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"647ec21d387e2dc1099af5f6b86e9552769d2ca5d17afee8d2f35ca1520c3d77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/engine/src/lib.rs: engine/crates/engine/src/lib.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 144 in pdfcraft_engine::run_edit at line 2548. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/engine/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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"001d716a25445988f7ef15e775c3abacac2119e3131068827240dce0776c536a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/ClearApp.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/ClearApp.kt changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in ClearAppKt.Shell at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/ClearApp.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/ClearApp.kt"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5467046351b3b24ed17fe749f499d034c17fe6be5fd536fc78c8a13b509909"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in ToolScreensKt.CropScreen at line 632. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/ToolScreens.kt"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e131976f6d8b6380c6ee54ee01766dd052e7ce1040eb936b9051a8fd1c930b40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/annot/src/appearance.rs: engine/crates/annot/src/appearance.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 123 in pdfcraft_annot::appearance::build at line 382. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/annot/src/appearance.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":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f483966e008700574070cbd387c431cd2f072221b0af624e8a3599ad0dda3663"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/MainActivity.kt: android/app/src/main/java/com/chethan616/clearpdf/MainActivity.kt changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MainActivity.collectRequests at line 104. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/MainActivity.kt\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/app/src/main/java/com/chethan616/clearpdf/MainActivity.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3978cc26752b20ab89b40d64463c33ab98bdabc5396822ea0e09f6d310e4ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PageCanvas.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PageCanvas.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in PageCanvasKt.PageCanvas at line 80. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PageCanvas.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PageCanvas.kt"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cefab129646055ce38aed9130c6f660cadd51797f8264ac2a9cbe1b9d54ffe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/edit/src/text.rs: engine/crates/edit/src/text.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in pdfcraft_edit::text::rewrite_block_from at line 3035. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/edit/src/text.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":"engine/crates/edit/src/text.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"505c4e044af8f3484d6961b6fc74c8144ce49b4dd15bcea0c6e857db6a06a2d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerBars.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerBars.kt changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ViewerBarsKt.ViewerTopBar at line 108. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerBars.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ViewerBars.kt"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f284d40ad23dfb8a5e6ff6bfb3df42e53c788f68db9fb2270d910ec7dd38494"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/edit/src/text_regions.rs: engine/crates/edit/src/text_regions.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 142 in pdfcraft_edit::text_regions::rewrite_styled_block at line 437. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/edit/src/text_regions.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":"engine/crates/edit/src/text_regions.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b4631c9763aaad9f986cb140a058559b432dd58410e3a75f877a649f047379"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/desk/FilesScreen.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/desk/FilesScreen.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in FilesScreenKt.FilesScreen at line 82. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/desk/FilesScreen.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/desk/FilesScreen.kt"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc05b112a2171f403fef39d8155bb63f7c5a475061d540a6ea70658f45e73ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PagesScreen.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PagesScreen.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in PagesScreenKt.PagesScreen at line 83. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PagesScreen.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/PagesScreen.kt"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0b2d3d9f8b31f17dae6d34843bb0f6854aef277501d20d99ca1dade5a84e44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/mobile/src/sheets.rs: engine/mobile/src/sheets.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in SheetBook::cells at line 326. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/mobile/src/sheets.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":"engine/mobile/src/sheets.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7037fa06ec9eb553c1d61392c29359732ea924e521509ee56efe92b5f05761bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/annot/src/lib.rs: engine/crates/annot/src/lib.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in pdfcraft_annot::add_annotation at line 1152. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/annot/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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"b433c8d4d4cf1dde82e8c8d6085975c64f88557a4e9aa4143a8ea27323365dea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/forms/src/author.rs: engine/crates/forms/src/author.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 103 in pdfcraft_forms::author::set_props at line 1160. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/forms/src/author.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":"engine/crates/forms/src/author.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afa950d68860418fc07a78b4c8069126e5d318173f8ba5507a7679447b68b7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/home/HomeScreen.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/home/HomeScreen.kt changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in HomeScreenKt.HomeScreen at line 164. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/home/HomeScreen.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/home/HomeScreen.kt"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"0849b61eea19cde5ce6ba0a4b5a253e845dc6e3b04b4c8756362a47f689ed45a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreview.kt: android/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreview.kt changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in QuickPreviewKt.Preview at line 138. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreview.kt\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/app/src/main/java/com/chethan616/clearpdf/preview/QuickPreview.kt"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c74980d82941377e244464ba3d1a6c0725ce82e72475b69fb9b111245b236b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/mobile/src/office.rs: engine/mobile/src/office.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in artefact_mobile::office::sniff at line 90. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/mobile/src/office.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":"engine/mobile/src/office.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde8e1fde9c1ee243d064a0e5d6534745262ed1418f7fc10d589cc3dfc20505d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/sign/src/pdf.rs: engine/crates/sign/src/pdf.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in pdfcraft_sign::pdf::classify_changes at line 1335. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/sign/src/pdf.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":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecd926848ca30109741a17e861423fe4d26cd7ba94a7a09c9c1f5bda5d17232"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/render/src/inspect.rs: engine/crates/render/src/inspect.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Inspector::annotations at line 1430. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/render/src/inspect.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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a489facdac3eb2ce5bab27d4b60dd1f2f1d48d094e944c160e6913a8e1284ced"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Buttons.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Buttons.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ButtonsKt.glassControl at line 64. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Buttons.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/glass/Buttons.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46891f25896f087f0bfe2ef72603f288bc522969a91ca3bc780aeb71930737b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DigitalSign.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DigitalSign.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DigitalSignKt.SignatureDetails at line 571. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DigitalSign.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/DigitalSign.kt"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6dcff83730bc164bf63534ae487c8ed6a522d134b35c6850b5f29f8c380453b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/engine/LocalFiles.kt: android/app/src/main/java/com/chethan616/clearpdf/engine/LocalFiles.kt changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Thumbnails.ofContent at line 210. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/engine/LocalFiles.kt\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/app/src/main/java/com/chethan616/clearpdf/engine/LocalFiles.kt"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdce00b6f1b6d665857e39be810816c9089716da67d3edb2b0b608a7977b5ec2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentPanel.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentPanel.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in CommentPanelKt.CommentPanel at line 62. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentPanel.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentPanel.kt"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4176312337b3e5aa650eb6b0dee418348d346e0ef537310568a1f22e46ee8de7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in EditKt.InlineEditor at line 518. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Edit.kt"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bf72bf82ffef4acd0dc53be6d7356d730ea9f06a837f9c1bdef8b6a03c1c69"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/redact/src/lib.rs: engine/crates/redact/src/lib.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in pdfcraft_redact::apply_to at line 377. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/redact/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":"engine/crates/redact/src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"21de833e0804194598c6bb2bb83eb6f8d09a87bfb8f99c01f8ece879f75db434"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/home/CreateDock.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/home/CreateDock.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in CreateDockKt.CreateDock at line 177. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/home/CreateDock.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/home/CreateDock.kt"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ff454026a5ce804c04db601a1d659b66421807f25f58df275c5d7394be762b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/xfa/src/pdf.rs: engine/crates/xfa/src/pdf.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in Emitter::widget at line 331. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/xfa/src/pdf.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":"engine/crates/xfa/src/pdf.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1e235d34ba05f33ddda8d09c46649405abb06f2ea992386815a4b4814dae06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app/src/main/java/com/chethan616/clearpdf/MainActivity.kt: app/src/main/java/com/chethan616/clearpdf/MainActivity.kt changed 5 times in last 90 days, max cyclomatic complexity 23 in MainActivity.collectRequests at line 104. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- app/src/main/java/com/chethan616/clearpdf/MainActivity.kt\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":"app/src/main/java/com/chethan616/clearpdf/MainActivity.kt"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbcc959c600f5d290423425c7886044cac93a5fc547a597d500a3453fe782ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/forms/src/appearance.rs: engine/crates/forms/src/appearance.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in pdfcraft_forms::appearance::field_appearance_fit at line 738. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/forms/src/appearance.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":"engine/crates/forms/src/appearance.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1996507ced1f9558fffb067a7e9ce58cfcf0b7cf48e977246dd7924cee519f00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/render/src/text.rs: engine/crates/render/src/text.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in pdfcraft_render::text::arrange at line 1491. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/render/src/text.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":"engine/crates/render/src/text.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdfc6318dbee20be57af46e5fdcae68ad253d637b5edc2ac30a2abea8a30b4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/notes/NoteEditor.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/notes/NoteEditor.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in NoteEditorKt.NoteEditor at line 107. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/notes/NoteEditor.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/notes/NoteEditor.kt"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c468abe6fd7f5ca4cfef6a239ee37b5084bdcff221c595350b446f0e4a2eb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/redact/src/sanitize.rs: engine/crates/redact/src/sanitize.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in pdfcraft_redact::sanitize::remove_hidden at line 514. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/redact/src/sanitize.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":"engine/crates/redact/src/sanitize.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee6baea4d86f65040a510d7c76eedac21552599511a8ad98d2c0ae9cd9f3517"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/forms/src/lib.rs: engine/crates/forms/src/lib.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in pdfcraft_forms::write_value at line 1048. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/forms/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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f50d3e59a0800df46d224a35fe4d87a02100e7ffea491e9c4cc7e704cdcbb3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Forms.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Forms.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in FormsKt.FieldEditor at line 72. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Forms.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Forms.kt"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c200ad043fae831a2ff5caed3f0ec3260bd7bf81e72d7cf24bc50e2ec6f0332e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/edit/src/flatten.rs: engine/crates/edit/src/flatten.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in pdfcraft_edit::flatten::flatten_in at line 163. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/edit/src/flatten.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":"engine/crates/edit/src/flatten.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffd4dcbac73a0824024ccfe917a75db566182cd9ec57e3b2c1e90e3ef2f1a3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/export/src/lib.rs: engine/crates/export/src/lib.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in pdfcraft_export::tables at line 196. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/export/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":"engine/crates/export/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"44be144cff9a3608195892c973066a6c5add1b093cf1e490ba6c99d2eacb0cc1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/edit/src/added.rs: engine/crates/edit/src/added.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in pdfcraft_edit::added::draw_laid_shaped at line 649. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/edit/src/added.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":"engine/crates/edit/src/added.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc57fd68f486196c3c465a3ff2c85a2c3c414fa455b5785d388c859dde45243"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/optimize/src/lib.rs: engine/crates/optimize/src/lib.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in pdfcraft_optimize::optimize_with_progress at line 283. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/optimize/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":"engine/crates/optimize/src/lib.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"96afba96558abf3104a4e0cd11d1b58879e511659bf1f2b67b9e65ecba0441d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/automation/src/comments.rs: engine/crates/automation/src/comments.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Automation::fill_sign_add at line 496. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/automation/src/comments.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":"engine/crates/automation/src/comments.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a08dbecfd42e8d33e687e3d45a64c884f770b7bba19635c5b6efe7b2def145"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/redact/src/interp.rs: engine/crates/redact/src/interp.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in pdfcraft_redact::interp::xobject at line 1215. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/redact/src/interp.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":"engine/crates/redact/src/interp.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d978d38caacea75cca131dfd136d5f116d4cdd4a0a14b0ffe8c3a07ab7ebc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadingMode.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadingMode.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ReadingModeKt.ReadingModeContent at line 56. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadingMode.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadingMode.kt"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3c00372a0a578a4f33feba21b2976d9a0364458297b7da03102ec0dffa3860"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/automation/src/printing.rs: engine/crates/automation/src/printing.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Automation::doc_print at line 119. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/automation/src/printing.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":"engine/crates/automation/src/printing.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9c949643d601ef7e90fba14649a65adf1afbb1581c7c7352b8e2a0e54a65bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/xfa/src/parse.rs: engine/crates/xfa/src/parse.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in pdfcraft_xfa::parse::parse_rich 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/xfa/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":"engine/crates/xfa/src/parse.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f851a3f9817ca74861751a684cf2f9320dd121bf3e17e1b4ea195cf9a6a0758"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/VoiceSheet.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/VoiceSheet.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in VoiceSheetKt.VoiceSheet at line 64. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/VoiceSheet.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/VoiceSheet.kt"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fea8e1f3c1f8dd334ac8081da1f9146deb5c8c8976c6bc578d1b9f33ebf99be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentList.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentList.kt changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in CommentListKt.CommentListScreen at line 126. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentList.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentList.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf709b5bab8a0d5626c362d8606e56f28a0b85a05f3f8e8c1ce7dc59cbf2725"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/organize/src/view.rs: engine/crates/organize/src/view.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in pdfcraft_organize::view::initial_view 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/organize/src/view.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/view.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"951c57683d88be88ebb0c70d0f74b631d2ce06eb6d8a505bb24b739eeb3ce591"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/xfa/src/text.rs: engine/crates/xfa/src/text.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in pdfcraft_xfa::text::layout at line 248. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/xfa/src/text.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":"engine/crates/xfa/src/text.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e4dab95944ded52632491778262f022b6c4b5e31a7a378455c68d16947e510"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/organize/src/import.rs: engine/crates/organize/src/import.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in pdfcraft_organize::import::import_pages_mapped at line 377. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/organize/src/import.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":"engine/crates/organize/src/import.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"3536d56181de650b5ccc344b91cbf11205621837d67dde453efd5d8c8e67f564"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/engine/src/xfa.rs: engine/crates/engine/src/xfa.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Runner::apply_effects at line 562. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/engine/src/xfa.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":"engine/crates/engine/src/xfa.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a91114ba537c513735daf1e50abf1bf5e32735bfae23269c67bcc313f74ed2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Tabs.kt: android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Tabs.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in TabsKt.GlassTabs at line 84. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- android/app/src/main/java/com/chethan616/clearpdf/ui/glass/Tabs.kt\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/app/src/main/java/com/chethan616/clearpdf/ui/glass/Tabs.kt"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be4e6e5e58dcbdc6cf09d1a9c644ba87e7e8456e7e2d5688f0bca2a2351f7cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/a11y/src/alt.rs: engine/crates/a11y/src/alt.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in pdfcraft_a11y::alt::content_bboxes at line 235. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/a11y/src/alt.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":"engine/crates/a11y/src/alt.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db79e0abf239d2aa3bb553de582ce053aa8ed245be0afebdf56bfe142a3db93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/a11y/src/content.rs: engine/crates/a11y/src/content.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Walk::content 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/a11y/src/content.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":"engine/crates/a11y/src/content.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a55b12b486fb861eb34e75d32e4cf485ce1b27ddcfd1f256df07adf5beec63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/redact/src/patterns.rs: engine/crates/redact/src/patterns.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in pdfcraft_redact::patterns::phone at line 138. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/redact/src/patterns.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":"engine/crates/redact/src/patterns.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e043f7be98a5e86fe91c4650e47a6aa48f8e4c2f81ca881bd50ec31c80347a91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/optimize/src/images.rs: engine/crates/optimize/src/images.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in pdfcraft_optimize::images::process at line 476. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/optimize/src/images.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":"engine/crates/optimize/src/images.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b557235589714005727dee7d59497988eb6b97a05c166f82219daf38679a0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/sign/src/cms.rs: engine/crates/sign/src/cms.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in pdfcraft_sign::cms::parse_signer at line 240. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/sign/src/cms.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":"engine/crates/sign/src/cms.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5078b5dfd1dd93568a5b1d882daecf98e7788188ff69a65ff9f5c61a6c14d63b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/xfa/src/data.rs: engine/crates/xfa/src/data.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in pdfcraft_xfa::data::pattern_to_iso at line 433. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/xfa/src/data.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/data.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd615f5681e1e1034686e06dd7a4fed37ee5a5a642a82e666b2605e4bdc3cfa7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: engine/crates/cos/src/security.rs: engine/crates/cos/src/security.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pdfcraft_cos::security::walk at line 164. 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 23:50:57 \u002B05:30\u0027 --until=\u00272026-11-15 23:50:57 \u002B05:30\u0027 --full-history --no-merges -- engine/crates/cos/src/security.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":"engine/crates/cos/src/security.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"30aabb391529d5300f22062998c7c1403c6e4b1e1328f1da07808f8fca132055"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: outer transformations lead to wrong position calculation \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":"android/backdrop/src/main/java/com/kyant/backdrop/backdrops/LayerBackdrop.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf4a92a17f51091cccced5f80fcd707c611627e0b82d8df71f5b4fee83ca018"}},{"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 \u0060engine/mobile/bindgen/Cargo.toml\u0060 makes this repository a deployable product (line 9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/mobile/bindgen/Cargo.toml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6387ac82da8f212e94749ae4657e60768e8ba035e2a5669fc5e509ba83fc109f"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060android/app\u0060 (33930 LoC, 475 module-visible types across 16 directories) overshoots its size bounds. 1 of 38 build unit(s) (Cargo, Gradle, checkout) overshoot their size bounds, lowering Project Cohesion to 9.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":"android/app/build.gradle.kts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ded88f0fae228fc99fab396cecc45e2ee23bf5fad755a3976ca1fd14e903a1"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e82cb9aae0b8619196a624a401a9aed37379af8007ab9b46d60af973c9c1a40a"},"properties":{"commitSha":"c25851996cdbf4a60ad3302406305615016d6a68"}},{"ruleId":"D28","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":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security 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":"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":"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":"7c30eadcccbceed0e0d7a888424133243f0a80f7e1c7cb21212f7f3b62f298cd"},"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":"dcfa4da9215284db6a6355a359d46e54ece6d33a8e6548e02570fa88e565fa20"},"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":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"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":"3bfe1342b2b2ff7ec30198c5be7e878786f57df0b5165ac1d200ed7af2efb121"},"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":"8018fa76f9798f58c2d54888e01f82e01d93750f0c34580eea02821510c2b5a4"},"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":"194a1865ac28c4ae38c004b2601f2b28923cef7e57a09e701d1f0c62e1a4f16b"},"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":"49c16b6fbc91670e61b639ab9c9270b4df42b6b11889eae216a02e4dd9c52b80"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73514371790ad2b3777325d1d0559e4889a165db07f5b9e44fee9adb557ef0f7"},"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":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4884017b5bdc4b7b610e77fb445b9c1ba8498455b2f0b7c88c8883e2314e5ba9"},"properties":{"dependency":{"package":"zip","version":"3.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"severity":"critical","fixedVersion":"9.0.5","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":"802cd679da6b94e51ac32ef37c8a88b5113961c0b508dc352ddbb225db454fc8"},"properties":{"dependency":{"package":"basic-toml","version":"0.1.10","advisory":"RUSTSEC-2026-0374","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":"bab789bc328978c69eca4c7902fb646c39d6e2d9c5c93bdeb7782609da9e5e87"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-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":"b01e70911a081e2d3b5958ac7a559ef83b30af02a87185922492a514ba594ea7"},"properties":{"dependency":{"package":"rsa","version":"0.10.0-rc.18","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"0.10.0","relation":"separate-copy","declaredRange":"=0.10.0-rc.18","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":"fa46d1de8541ae124b6e218fc3c6149dc24a7db55973e64fcce064121aed5786"},"properties":{"dependency":{"package":"rustix","version":"1.1.5","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"direct","declaredRange":"1","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47212958ebbfc6c7b98e434d5890ff62b9cd79ac6bd37a1b16fc1db1c2b86442"},"properties":{"dependency":{"package":"rustybuzz","version":"0.20.1","advisory":"RUSTSEC-2026-0206","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":"9e6fb448dde6fefe8f6f4c556b74367d95811805137ef86190675b31389024a0"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.53.3","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":"e6ce08d0661865b4ee0d6183a1f3fc61a89c1dff04b1f43957c8c7d111f0b851"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","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":"6190cbd4a5b75e34cbbe23a2a517265a20fc5e1216b17e84ea482ff2b8488489"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","advisory":"RUSTSEC-2026-0371","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51479b741493ff8e9131186c66108af4eb0d6bf1facb5a38ed3b09a1ec7c5e90"},"properties":{"dependency":{"package":"zvariant","version":"5.15.0","advisory":"RUSTSEC-2026-0370","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15b29f8bb9f800a30abda005216af9d785a5db3a3f990a9267ad8ab5f4cac8ea"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.15.0","advisory":"RUSTSEC-2026-0372","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"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":"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":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060read\u0060 does real work, but one of its branches is \u0060Err\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/measure/src/lib.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"103cde9e2717118eb32036e9711dd8cc329af080caa8e2688bc85194e50b9b7b"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060read\u0060 does real work, but one of its branches is \u0060Err\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/measure/src/lib.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e55c127f263b3f2cfe1b2c6292c1f8df7992a25145ebc904569c62b6f24637"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060read\u0060 does real work, but one of its branches is \u0060Err\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/measure/src/lib.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac61a016ea0ce033c8949c02102f2fdfa898bcae45ec0147e9e746fca6a03d1e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060sign_inner\u0060 does real work, but one of its branches is \u0060Err\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de1a5ce7d149be1f62ebd8a09c338d0fe72b8882749c665366c7a8ee79cf1fc"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060timestamp_document\u0060 does real work, but one of its branches is \u0060Err\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6a1b8de1e6b6ecb9d42a1bb32e717fd5b8a4a2d558f88bfd63d4f555d55972"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060locate\u0060 does real work, but one of its branches is \u0060Err\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/pdf.rs"},"region":{"startLine":2307}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfcf097bc724e4e0d8f626d2b47756d2a2f65ba4753d5a9a553f643950f4b25"}},{"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":"M4","level":"note","message":{"text":"README/code drift: engine/crates/automation/README.md links to \u0060../../docs/word-count.md\u0060, but \u0060engine/docs/word-count.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/README.md"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6b76db9885091f2ab121c3424f1472636ed4fa8c407a97031334528f1f9f0a"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: engine/crates/automation/README.md links to \u0060../../docs/mcp.md\u0060, but \u0060engine/docs/mcp.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/README.md"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"917b5f0f4cfc09063f020b08f10759b4847a6f31a7a4ca46d00c16376a47a972"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: engine/crates/automation/README.md links to \u0060../../docs/editing-existing-text.md\u0060, but \u0060engine/docs/editing-existing-text.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/README.md"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"756dde485def6ea931590fb0c6eb3b426ef4726c42f0817155294cd87a93234e"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: engine/crates/automation/README.md links to \u0060../../docs/editing-images.md\u0060, but \u0060engine/docs/editing-images.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/README.md"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeedf713362f84eb86afbd4d46a93e496b80b7bd43f97e98e9abca1a02adcc8b"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: engine/crates/engine/README.md links to \u0060../../docs/word-count.md\u0060, but \u0060engine/docs/word-count.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/README.md"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"648d43999bfc48dd1243466258b2e64156d0e79fd8094cf28dba35f21be6d861"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: engine/crates/fonts/README.md links to \u0060../../docs/editing-existing-text.md\u0060, but \u0060engine/docs/editing-existing-text.md\u0060 does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/README.md"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34c1a0c409bac67b04f22e265c3698b6668f731490d3872b0518c2a64535a8e"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 2/3 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060engine/mobile/bindgen\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060engine/Cargo.toml\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":"engine/Cargo.toml"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0069e688190d73915a38b3df45ef608d961916dd460ede4e5c86a04f7adb8b88"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!it.readOnly \u0026\u0026 (it.kind == \u0022text\u0022 || it.kind == \u0022combo\u0022 || it.kind == \u0022list\u0022)\u0060 appears character-identically in 2 files \u2014 android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt, android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/Forms.kt. 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fa48c22719927cb9a1e804a9ce6c3a02332f6592cfb609808193fc2f3c1ba1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060it.page == c.page \u0026\u0026 it.index == c.index\u0060 appears character-identically in 2 files \u2014 android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt, android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/CommentPanel.kt. 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":"android/app/src/main/java/com/chethan616/clearpdf/ui/AppViewModel.kt"},"region":{"startLine":3453}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f2241f366b9bba84afb17a61b717da485c9d146b69d8da77afcb570e4b96ad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!doc.encryption_changed() \u0026\u0026 !doc.full_save_required()\u0060 appears character-identically in 2 files \u2014 engine/crates/annot/src/tests.rs, engine/crates/forms/src/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":"engine/crates/annot/src/tests.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d556988f96926c8f06b57eddee153a73051aa04974c5176ee00d3e20f69339"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!kids.is_empty() \u0026\u0026 depth == MAX_LABEL_TREE_DEPTH\u0060 appears character-identically in 2 files \u2014 engine/crates/organize/src/labels.rs, engine/crates/render/src/inspect.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":"engine/crates/organize/src/labels.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45d2c9c416e9d25fdcc805e7eb7b64aecbfceafabba4d134403feaddafb155a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!out.xobjects.is_empty() || !out.replaced.is_empty()\u0060 appears character-identically in 2 files \u2014 engine/crates/redact/src/lib.rs, engine/crates/redact/src/sanitize.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":"engine/crates/redact/src/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4adf8f9c6aac7bd144bb796b87773e8a62e6c885d32a0ac50f554784426df1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!visited.insert(p) || visited.len() \u003E 64\u0060 appears character-identically in 2 files \u2014 engine/crates/forms/src/lib.rs, engine/crates/render/src/inspect.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":"engine/crates/forms/src/lib.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa569b551e89c0988c46517faa505b26092f674d6c790ffe9a198f4e2f58532"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060changed || !out.xobjects.is_empty() || !out.replaced.is_empty()\u0060 appears character-identically in 2 files \u2014 engine/crates/redact/src/lib.rs, engine/crates/redact/src/sanitize.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":"engine/crates/redact/src/lib.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa06b965045d9a337d191a2eed24a353798d0869c98849487f216ccbbe6fb09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060d.name(b\u0022Type\u0022) == Some(b\u0022Pages\u0022) || (d.contains(b\u0022Kids\u0022) \u0026\u0026 d.name(b\u0022Type\u0022) != Some(b\u0022Page\u0022))\u0060 appears character-identically in 3 files \u2014 engine/crates/model/src/lib.rs, engine/crates/organize/src/lib.rs, engine/crates/redact/src/interp.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":"engine/crates/model/src/lib.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1e5e77fbb5468e245453ea55e6cc66135f5c5dcc1a46ad7e70cf7a1cc6c4a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060long.len() \u003E 3 \u0026\u0026 long.concat() == \u0022Supercalifragilisticexpialidocious\u0022\u0060 appears character-identically in 2 files \u2014 engine/crates/annot/src/tests.rs, engine/crates/fonts/src/lib.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":"engine/crates/annot/src/tests.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1232d8056ee90c811cb4ce4904790563b0fc15d34a5b0dc3ad3a4e4976bf5832"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rect[2] - rect[0] \u003C 1.0 || rect[3] - rect[1] \u003C 1.0\u0060 appears character-identically in 2 files \u2014 engine/crates/annot/src/appearance.rs, engine/crates/automation/src/forms.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":"engine/crates/annot/src/appearance.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"da58ec0265a73368a2d0dd9d2b17bf075b8259b10cba7759f9bf4b7c95f7a51f"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060let r = parse_uri(uri).ok_or(( INVALID_PARAMS, format !(\u0022unknown resource {ur\u2026\u0060 follows \u0060{ let content = self.automation.call(tool, \u0026 json !({ })).map_err(| e |(INVAL\u2026\u0060 (line 497) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/automation/src/mcp.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a97e570e3b9f44454bd02efcc901bb8e2f2fe61fc2a3f81ba5077118e93598f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060count\u0060 is public and takes a \u0060DataNode\u0060 as its receiver from its caller, and it calls itself at line 46 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 \u0060count\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/xfa/src/data.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d25086b84b74d8e5f9a1c3d07167ce065cbe2774c10c339399a3b5b8600ac00"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060apply\u0060 is public, takes a document from its caller (line 3960) and hands it to \u0060uses_scripts\u0060, which calls itself at line 275 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 \u0060uses_scripts\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c092c73abd8754bc1c621d810f96f6e993c5e7ade33f170765d5d42a53c4529c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060apply\u0060 is public, takes a document from its caller (line 3960) and hands it to \u0060scope_of\u0060, which calls itself at line 324 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 \u0060scope_of\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c6374fd9cc58a1f8fa0bbe8a70285ffb6543206d249ccb395b9fe68bfb1145"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060permissions\u0060 is public and takes a \u0060Document\u0060 as its receiver from its caller, and it calls itself at line 714 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 \u0060permissions\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bbd49524a3f5f1e3af1d1f7a1aff683c638144fe20782fad263e5c4944eea1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060text_blocks\u0060 is public and takes a \u0060Document\u0060 as its receiver from its caller, and it calls itself at line 585 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 \u0060text_blocks\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb946b90ce65bb99a03248804b523878dc8d6371a7fdc2a4dbdb315581fef686"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060revision_ends\u0060 is public and takes a \u0060Document\u0060 as its receiver from its caller, and it calls itself at line 924 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 \u0060revision_ends\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b915344357b0b57806bb9ae9d82b1640fd6cccf66ff7ba3165bcc87b7d2d6ab"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060repair_log\u0060 is public and takes a \u0060Document\u0060 as its receiver from its caller, and it calls itself at line 935 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 \u0060repair_log\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0472debbd812eb2519c11e7d223a5b3e947a33aa4181803c342d687e20e2aee"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060label\u0060 is public and takes a \u0060Edit\u0060 as its receiver from its caller, and it calls itself at line 2221 with a piece of the document (and at line 2222) \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 \u0060label\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":2221}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f279a6059db2057d6f912db56fd4cdc49927e64e82c5edee3053aeb94b5d7b3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060apply\u0060 is public, takes a document from its caller (line 3960) and hands it to \u0060check_permission\u0060, which calls itself at line 2449 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 \u0060check_permission\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"1778d9914e666f42ba25d592f09f65afc6d11b3c3a480903e20672abb76cc2b2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060apply\u0060 is public, takes a document from its caller (line 3960) and hands it to \u0060run_edit\u0060, which calls itself at line 3003 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 \u0060run_edit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3003}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7bbb4d24f0deb2fe63297c12cf3ced4f344ccb5a7223ea5f5fbab54279ecd6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060apply\u0060 is public, takes a document from its caller (line 3960) and hands it to \u0060keys_after\u0060, which calls itself at line 3064 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 \u0060keys_after\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/engine/src/lib.rs"},"region":{"startLine":3064}}}],"partialFingerprints":{"codehealthFindingId/v1":"feebaf8eb7bf15539b4d412fab5c6b8d52f955af56c2e69e5a431fd385d61fda"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060iter\u0060 is public and takes a \u0060Dict\u0060 as its receiver from its caller, and it calls itself at line 172 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\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/object.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f768c0d29c88d18acc4245d4537d1239243e888a84cf093f3c690fe00b1013"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get\u0060 is public and takes a \u0060Dict\u0060 as its receiver from its caller, and it recurses at line 131 through \u0060position\u0060 and back with a piece of the document (and at line 121, line 123) \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 \u0060get\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/object.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"101f7105a1026bc0481f5e1d743f8e872c141e2500796cfe6571192c24852b24"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get_mut\u0060 is public and takes a \u0060Dict\u0060 as its receiver from its caller, and it calls itself at line 136 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 \u0060get_mut\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/object.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3ec8738b71230d89770bb20a5f9635654db59f6ca96fd0089d50d68bb88d6b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060len\u0060 is public and takes a \u0060Dict\u0060 as its receiver from its caller, and it calls itself at line 176 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060len\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/object.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e71e94347a555db940dbbf7540baf55eb8958275b40d6cc224637f2fae34248"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060remove\u0060 is public and takes a \u0060Dict\u0060 as its receiver from its caller, and it calls itself at line 161 with a piece of the document (and at line 164) \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":"engine/crates/cos/src/object.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19fae63ef7b6ac32c94f9ff84532577817259ab9fb6e0899f8a8cf57db41977"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_empty\u0060 is public and takes a \u0060Dict\u0060 as its receiver from its caller, and it calls itself at line 180 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_empty\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/object.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9562aefec56e6c2e8b73fdf5c2256c1eb1aa69c1270977a1c3c24f7d1705ed58"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060transform\u0060 is public, takes a document from its caller (line 155) and hands it to \u0060walk\u0060, which calls itself at line 168 with a piece of the document (and at line 173, line 177, line 179) \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":"engine/crates/cos/src/security.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca3e96ad3ab41a90561b797dbcab50c5f6103de4549410fb850e9b35b8c77183"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060serialize\u0060 is public and takes \u0060o: \u0026Object\u0060 from its caller, and it recurses at line 38 through \u0060write_stream\u0060, \u0060write_dict\u0060 and back with a piece of the document (and at line 42, line 43, line 120, line 128) \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 \u0060serialize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/cos/src/writer.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b24b394c775979772a2d95659535d53410c3d8ff01e8a08baf6e7c0639d2f0"}},{"ruleId":"X18","level":"warning","message":{"text":"Raw handle taken from an owned value and never reclaimed: \u0060rgba.into_raw()\u0060 (line 60) 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":"engine/crates/engine/src/copy_image.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4112b9d0c6e72c897d128901bf8b09bcf7623b900e886a4a81a1542bb4a0d38"}},{"ruleId":"X18","level":"warning","message":{"text":"Raw handle taken from an owned value and never reclaimed: \u0060img.into_raw()\u0060 (line 477) 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":"engine/crates/create/src/extract.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd393415fcf9754d7d9399e6bcdd8fd7eda1ef0f2eccf31a82ad4ce4accfa32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060oid\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/sign/src/der.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d65abce39ab16fd67089b17f90df0ed3ca1e34ad2ccda20bc3a28e84054e169"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.write_all(data)\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 \u0060encode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/filters/src/flate.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5661e3606df2252ce15c36c4c463def898d1071ebb9c9189f37c405c278f985d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.finish()\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 \u0060encode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/filters/src/flate.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34f941eacae8b0f97b7a26e2c613cbda769fd5dc984e2bfd62603b6fbe71c10"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060load\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/engine/DigitalIds.kt"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8277eaf393d91628f70030e9bedb80d92f64abf14268752c606b8ca4187e2bd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060read\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/engine/RecentFiles.kt"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ac8f8502fdf61ef17de0b0667fa61e6b61510f594386e2eb0bc494ff4419ab"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060read\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/notes/Notes.kt"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a53c17516eaab50148f45e19593970de08e646949cf65b6d37e714e9f2006c8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060languages\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadAloud.kt"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"484bf10cf8a4d6529975d1153dca7744a5cd0e7ba9a8838447203ad3c4ddfeab"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadPage\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadAloud.kt"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf57a5fd5bc8420bacb8057e9490cdeb0f817621a080a08be3fff3103784f7d3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060speakCurrent\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadAloud.kt"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22a035af9cbf0067694d78221595ca0b7aa413adf58a9afd9901cf5cf25f8e8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060markWord\u0060 swallows every exception into \u0060emptyList()\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it propagate. 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 in the catch or in the KDoc, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"android/app/src/main/java/com/chethan616/clearpdf/ui/viewer/ReadAloud.kt"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2267d5ac55506f4f5f727ee75f2611cdad8925393e6924b557178a1c39f66cf4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060summaries\u0060 turns every \u0060Err\u0060 into \u00600.0\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":"engine/crates/annot/src/lib.rs"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e35d683f2595446fbd27746fc5f45a1d305694887af866f9b34e10be23fa49d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list\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":"engine/crates/annot/src/links.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c5c58572b16ec40cf5708d9ab309a9739234c67cf605f8e3da62bbe88a8354"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060relationships\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":"engine/crates/create/src/office/xml.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"34df128b8b517dc1565c4dc387ad0c3682c17a11c614158b909fed8ce05e3e89"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060own_fonts\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":"engine/crates/edit/src/added.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0ed311a382d653e5dbe23c73bc0b0d22d8385edcbbd24199a7f453cd555826"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060print_text_up\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":4820}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e32f1156ced98e1174a3f53d65a59bada6d3dd95fc299d249cd5cb269ced7c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060undrawn_notices\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":"engine/crates/engine/src/lib.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"5460063f1b8527ee55631e6ebeb89a567e6067572334f6f47b10fccadb47f662"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cids_with_outlines\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":"engine/crates/fonts/src/pdf.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a5a31ab467597a2a36150bc6b07c9bc508ccc4a05804191b7c3ebde3bd83fe"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060script_outline\u0060 turns every \u0060Err\u0060 into \u0060ScriptOutline::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/fonts/src/script.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e59f91ed855bb470582ad503181e941a514ca7801c1158990f7d499f5b2b90"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060field_name_conflicts\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":"engine/crates/organize/src/import.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"f735b0b65608cd5f2c8a58253d28bdeb9061134f1a900d2e7d71608bdd6d927b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060combine_field_conflicts\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":"engine/crates/organize/src/import.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"1872e3891e7ced0b20058673e2041b236eddf430c5503de24b36ab793c34034b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060initial_view\u0060 turns every \u0060Err\u0060 into \u0060InitialView::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"engine/crates/organize/src/view.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eded76afff1d2dfc612966c7897840c8cdb454a57defd3f1170d351ce2d4bba"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060annotations\u0060 turns every \u0060Err\u0060 into \u00600.0\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":"engine/crates/render/src/inspect.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33a55c06eac61bb7b584d826a3673479fb8bab0ddce149b35c1211d3aa675b4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060issuers\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":"engine/crates/sign/src/keychain.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdb1a9f1c592b58461214da0c1736c374214ddde8a9dc840262fe2f878f3b59"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060issuers\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":"engine/crates/sign/src/windows.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4b14674fc476d08cdf24b82295bcec722f9132a23cc5ce7d30cf047acd267d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060values_at\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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee1920d0f5f5efa995511b92866a6fc09c376d8bffd49dd1bd4a85ecfc97d6c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060password_dataset_wants\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":"engine/crates/xfa/src/data.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a782bbeea2ba912d914a2dbb72a38efb3c54e645f3ba1056ebac800d104ece1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060ligature_carets\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":"engine/vendor/deckcraft-fonts/src/fallback.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b0f0ab51be58b3195b1e2693837de7bcdf90db16654b78befb0e4875736073"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060file_face_names\u0060 turns every \u0060Err\u0060 into \u0060vec![]\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":"engine/vendor/deckcraft-fonts/src/fontdb.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1f99af8a55ef7fd2b95e0919d46f76667215e274bc14e4f96f90c617b8d433"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_page_annotations\u0060 turns every \u0060Err\u0060 into \u0060Ok(vec![])\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":"engine/vendor/lopdf/src/document.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"63824402dc1823c208a4e8869e0b60a9c4af6336ce5d9bd179ae89a4d58eca4a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060size_hint\u0060 turns every \u0060Err\u0060 into \u00601\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":"engine/vendor/lopdf/src/document.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46ee6133c9fe442f6846a9ed9a81c81335ff40d44a76beac1e1447267e4c333"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060extract_page_count\u0060 turns every \u0060Err\u0060 into \u0060Ok(0)\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":"engine/vendor/lopdf/src/reader.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9002271230d1b2a1a5dec41c05616105826a3d6122c072b4cbcb62e4eb81b7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060differences\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":"engine/vendor/wordcraft-engine/src/cmd/inspector.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcc87e149d5f9f8fb744910c6d2f9901610c6c5a42b20bee9b09a0eab55bac4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060split_targets\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":"engine/vendor/wordcraft-engine/src/cmd/table/structure.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17d015cc0a4b7aa8c58eac8627d444ed832effb3c9bf39d2d1d106124fbf132"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060file_face_names\u0060 turns every \u0060Err\u0060 into \u0060vec![]\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":"engine/vendor/wordcraft-fonts/src/fontdb/names.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"788f136b58afe4319bb36a881981bf827f3b2a3cb53f58c82d5d054fe2b2b433"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-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":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-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-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":29,"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."]}]}