{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"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":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB1","name":"Runtime evidence locked \u2014 no reproducible boot","shortDescription":{"text":"Runtime evidence locked \u2014 no reproducible boot"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"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":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"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":"pdf_inspector::extractor::content_stream::extract_page_text_items_with_options (cyclomatic 272): pdf_inspector::extractor::content_stream::extract_page_text_items_with_options has cyclomatic complexity 272 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c4d22f1c82e7a517f3ce79bc4cf69cfae84493cd96ca81375272cb35d25eac"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::xobjects::extract_form_xobject_text_inner (cyclomatic 162): pdf_inspector::extractor::xobjects::extract_form_xobject_text_inner has cyclomatic complexity 162 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/xobjects.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"00880563e81fa3617e2ca74b0dbf844280d59a43f83fef8bb9e86718f5ad0fa5"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::convert_items_with_rects_lines_and_table_output (cyclomatic 119): pdf_inspector::markdown::convert_items_with_rects_lines_and_table_output has cyclomatic complexity 119 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"691d8d2be41b454e7e0b65e8e87ad27158cd93378faa7badf69bffa81cd602d4"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detector::content_scan::scan_masked_content (cyclomatic 101): pdf_inspector::detector::content_scan::scan_masked_content has cyclomatic complexity 101 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_scan.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf2b9858d7b1f0335e93cbeac3353b1c943533996dd1689bc539184e688bd70"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::extract_text_from_operand (cyclomatic 100): pdf_inspector::extractor::fonts::extract_text_from_operand 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":"src/extractor/fonts.rs"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff2684b075a6f2b96cd715230168894d8cade2e35b72720de9f531740393fd2"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::convert::to_markdown_from_lines_with_tables_and_images (cyclomatic 94): pdf_inspector::markdown::convert::to_markdown_from_lines_with_tables_and_images has cyclomatic complexity 94 (threshold 15). Of this number, 92 points are the body\u0027s own statements and 2 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":"src/markdown/convert.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c99c153cafc5b8454b14d46c541c78f1034081323e221e550417e35720785d4"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detector::detect_from_document (cyclomatic 73): pdf_inspector::detector::detect_from_document has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aebfe957da3e17c9a59d4770047a945120e0a48ca08aeebe35847d906b1e821"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::merge_text_items_with_clips (cyclomatic 66): pdf_inspector::extractor::merge_text_items_with_clips has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"677ae2a734eda8a771b122e5cada57090c8e46af14db01320b2c1e71489f8934"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::detect_tables_from_rects (cyclomatic 61): pdf_inspector::tables::detect_rects::detect_tables_from_rects has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a4ce892687242c77192ac3354e7b8a76b0de4058666c20e50c65e587e204af"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::furniture::strip_repeated_lines (cyclomatic 57): pdf_inspector::markdown::furniture::strip_repeated_lines has cyclomatic complexity 57 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 4 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":"src/markdown/furniture.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4374e98e3867de2a213d26a912a55f41761580e0407bb8f8b400394be5c9f9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::try_build_key_value_table_from_rows (cyclomatic 57): pdf_inspector::tables::try_build_key_value_table_from_rows has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"2653d4f01d7ec48b09c5b5adefa8170edb292271bfc89ca8983c5c28dc045785"}},{"ruleId":"D1","level":"warning","message":{"text":"FontCMaps::collect_cmaps_from_fonts_inner (cyclomatic 53): FontCMaps::collect_cmaps_from_fonts_inner 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":"src/tounicode.rs"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c84d835baffd9b643cb5628a41063d9a139ab1a01bdfa2c1c1d76ead6aab6a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::text_utils::should_join_items (cyclomatic 53): pdf_inspector::text_utils::should_join_items 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":"src/text_utils.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b0ccfa74fdb466a3a9005cdc6c8d791ea808b4e82883fc3c5f59a1ca0b3da3"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::convert::to_markdown_from_lines (cyclomatic 51): pdf_inspector::markdown::convert::to_markdown_from_lines 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":"src/markdown/convert.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"562bc2e362e4db0e86785454ac0060282edbce722ca6bc0fc9cf155230f77aa0"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::detect_row_stripe_table_from_cell_rects (cyclomatic 49): pdf_inspector::tables::detect_rects::detect_row_stripe_table_from_cell_rects 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":"src/tables/detect_rects.rs"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17a4ed1e0a8b040677e03f8d12cff6fcd440176c7be8301ea918247c06de21d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::bin::pdf2md::main (cyclomatic 48): pdf_inspector::bin::pdf2md::main has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/pdf2md.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c34de9022379d86eb0523d07e8911d411180ab51ac5318432f503bd7a8a70de"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::try_build_table_from_columns (cyclomatic 47): pdf_inspector::tables::try_build_table_from_columns has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"68903935b0809bde91b6e9830ade1791d252211f4c2b765eba59022c3fd6b6a8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detector::collect_text_chars_before (cyclomatic 46): pdf_inspector::detector::collect_text_chars_before 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":"src/detector.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fed4e9c5b73eea39654579beb1d19390b56943a5f5b879a7c007335a293819"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::is_parallel_prose_table (cyclomatic 46): pdf_inspector::markdown::is_parallel_prose_table 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":"src/markdown/mod.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f89b80dba00da7f7dd4a86c78a2cce64e7ded72d39beccffe75b1ba8ecf5009"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_lines::detect_tables_from_lines_inner (cyclomatic 44): pdf_inspector::tables::detect_lines::detect_tables_from_lines_inner 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":"src/tables/detect_lines.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a44f6db257457cec1df00f04249ea3683554702ea3a48cd8f74e0a5c900b10"}},{"ruleId":"D1","level":"warning","message":{"text":"TextLine::text_with_formatting (cyclomatic 43): TextLine::text_with_formatting 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":"src/types.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6678b70a93ad4994dc3a6039c7dc576c19bebe66026f5f80b44d1a87bb13f2d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::layout::page_number_context_masks (cyclomatic 41): pdf_inspector::extractor::layout::page_number_context_masks 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":"src/extractor/layout.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc9c873c38d735c31be0d6a48799fb8af93ef1a77d93476a4ca98222b39c18d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_lines::detect_dense_line_chart_regions (cyclomatic 41): pdf_inspector::tables::detect_lines::detect_dense_line_chart_regions 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":"src/tables/detect_lines.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a097ff6ff724a461a1aee5283899de30a8d36aee9e34021f36dffd9c5d8e988"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::detect_stacked_box_table (cyclomatic 40): pdf_inspector::tables::detect_rects::detect_stacked_box_table 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":"src/tables/detect_rects.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc21d8b253549ce16d10dc93df99e399723395106d9cd0583a633b41826dd1bd"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::looks_like_partial_table_ex (cyclomatic 39): pdf_inspector::looks_like_partial_table_ex 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":"src/lib.rs"},"region":{"startLine":5636}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca0f389bb733fa7e5fd197b083ad6969e65f8a99694d3c178fb598d120f767f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::layout::detect_columns (cyclomatic 38): pdf_inspector::extractor::layout::detect_columns 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":"src/extractor/layout.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e23246ea07009cfb923761f995c2e19c46256b80de26a4bef446f544ddf3970"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_lines::build_text_anchor_table (cyclomatic 38): pdf_inspector::tables::detect_lines::build_text_anchor_table 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":"src/tables/detect_lines.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c30104db3298e3b3eb954be1e96348ebb85d18307bf83b176fbee964092993e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::process_document (cyclomatic 37): pdf_inspector::process_document 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":"src/lib.rs"},"region":{"startLine":4578}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da5f420448636a5d1379bb060901bb283ceca0f2b97dd12f7a8d95721be624a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extract_tables_in_regions_mem_with_options (cyclomatic 35): pdf_inspector::extract_tables_in_regions_mem_with_options has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e0708ad87b919e5354c419cb03625002c7f6c4e79695edcc63052b87d27f9a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::detect_contents_list (cyclomatic 34): pdf_inspector::tables::detect_heuristic::detect_contents_list has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"42244ce843c12fbe20ead9a2c05443b6a412b4388440970af9af4ec045c65da2"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::vision::pipeline::process_pdf_with_ocr_mem (cyclomatic 34): pdf_inspector::vision::pipeline::process_pdf_with_ocr_mem 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":"src/vision/pipeline.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba43539c12ced193b4facc0fd757df906acceea90ed79de4e2bd3165c16cacf7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::heading::classify_heading_sequences (cyclomatic 33): pdf_inspector::markdown::heading::classify_heading_sequences has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/heading.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf645847079e9cbb88c9076fb8b4710c8412d499159b38a5aac7964a8b75830d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::detect_table_in_region (cyclomatic 33): pdf_inspector::tables::detect_heuristic::detect_table_in_region has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"481b9cc6bf6be4049d3cfc5ab0088b829179cfdd3361761054c0e3d2a1b0b400"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detector::decoded_text_counts_within (cyclomatic 32): pdf_inspector::detector::decoded_text_counts_within 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":"src/detector.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"f761ccd0aee29bf1aa4032f6e487e78134a0373c6220e304affee73b9ee54acd"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::cluster_rects (cyclomatic 32): pdf_inspector::tables::detect_rects::cluster_rects has cyclomatic complexity 32 (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":"src/tables/detect_rects.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1802634cc9fc2d18759e413bf62cc1c207f68d642e79d0737be1f6bd08ac5e1"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::format::clean_table_cells (cyclomatic 32): pdf_inspector::tables::format::clean_table_cells 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":"src/tables/format.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedc00cbec7f3419d9b049b47c52be572fd99b289896edb77503e3611cc8ef61"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::extract_positioned_text_impl (cyclomatic 31): pdf_inspector::extractor::extract_positioned_text_impl has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"c516132aa6206da30e446d6a5d8a684bd92b98bdefa4a910888768ddfdb110ff"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::is_page_number_toc (cyclomatic 31): pdf_inspector::tables::detect_heuristic::is_page_number_toc has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"20878c19cb060e45ea62653bc0e5d6c9a925d853a7c9c116ef63545c4f6a7a57"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tounicode::build_simple_cmap_from_truetype (cyclomatic 31): pdf_inspector::tounicode::build_simple_cmap_from_truetype has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fb75c12d577eb51bb9717b8124fe39cce3c212666a19d62572d0c4a8c44d1c"}},{"ruleId":"D1","level":"warning","message":{"text":"ToUnicodeCMap::parse_bfrange_section (cyclomatic 30): ToUnicodeCMap::parse_bfrange_section 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":"src/tounicode.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff4c23cdc3c212049311a1ed0719386e25fa7775596b6b3a17b5c163e6d97e6"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::bidi::logical_line_order (cyclomatic 30): pdf_inspector::bidi::logical_line_order 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":"src/bidi.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ad3ff2816c2b3998530f3f70073cbd7cb78e1b6a7c040c8db2ca16e0ebff92"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::furniture::strip_edge_furniture (cyclomatic 30): pdf_inspector::markdown::furniture::strip_edge_furniture 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":"src/markdown/furniture.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd455e58a7d0c3a1702aac9e2d3d968dc3d46c2ac14dd501cf08b9b913992807"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::structure_tree::parse_struct_element_dict (cyclomatic 30): pdf_inspector::structure_tree::parse_struct_element_dict 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. This is NOT this file\u0027s highest cyclomatic complexity: StructRole::name (cyclomatic 50) 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":"src/structure_tree.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef3f9edd0f0f5726f2258f6cd2143d1557c2e4501c51eeb6b6c676c9110e5b7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::stale_identity_cmap_overrides (cyclomatic 29): pdf_inspector::extractor::fonts::stale_identity_cmap_overrides has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f5d43be51aba56f877dbeeff2ec1134232b85cf2dca005d5e52e685022072"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::layout::order_columns_with_policy (cyclomatic 29): pdf_inspector::extractor::layout::order_columns_with_policy has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d090a0dd4e628da1d88b3217011b07a3b4aadaebed69b949e4615df517693a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::links::walk_form_fields (cyclomatic 29): pdf_inspector::extractor::links::walk_form_fields has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/links.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67e49787da947924f97242f045a6d940e54c78c414c992afa9e8fffeaf0e74a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::find_first_table_row (cyclomatic 29): pdf_inspector::tables::detect_heuristic::find_first_table_row has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d98832aa7d323dc7c3e74833391a2e33d869ace2321fdb9da0d852c676a1e06"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_struct::recover_unclaimed_header_row (cyclomatic 29): pdf_inspector::tables::detect_struct::recover_unclaimed_header_row has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_struct.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed91c001eafad8ef9681d8c9f90525a14b1b20bd015d01f9220324169a06c48"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::type1::builtin_encoding (cyclomatic 28): pdf_inspector::extractor::type1::builtin_encoding has cyclomatic complexity 28 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/type1.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"355ea11f55ca5e727f1264acd712bfc1a75af1f9dd6e0f9c00f0ee32f3a62ec7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::word_gaps::tj_tracking (cyclomatic 27): pdf_inspector::extractor::word_gaps::tj_tracking has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/word_gaps.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"782fd5cccb29fe451c1a84f8b5e34984868ecfed587dfbbebaced96b7691251d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::postprocess::format_urls (cyclomatic 27): pdf_inspector::markdown::postprocess::format_urls has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/postprocess.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"098f772ab01dc838e4ccc179fe420a1a427ad34b4e4edbc4197ac75afe60574a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extract_text_in_regions_mem_with_options (cyclomatic 26): pdf_inspector::extract_text_in_regions_mem_with_options has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b059c0f73ce96cc65a79ede61d91ca83f75d973a90b0bb487a1739610bfed9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detector::content_mask::header_tokens (cyclomatic 26): pdf_inspector::detector::content_mask::header_tokens 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":"src/detector/content_mask.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c42989492c996f43abcf9815daa02515280de97213ba6071c654bb1c98f876d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::try_build_grid (cyclomatic 26): pdf_inspector::tables::detect_rects::try_build_grid 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":"src/tables/detect_rects.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"4278b0135c1f3bc3136e707e2cc5c2d57d6d2f1f36aadee0512d5900874e59d8"}},{"ruleId":"D1","level":"warning","message":{"text":"TextPaint::observe (cyclomatic 25): TextPaint::observe 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":"src/extractor/text_paint.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ad0db49c7a2ba1614effee40f7b5da67cf10843e05bdff09206e9b5361d84a"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::bidi::analysis_sequence (cyclomatic 25): pdf_inspector::bidi::analysis_sequence 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":"src/bidi.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"865a11e99ebd35f9cfa7534bf5ff47381f612e84b3c501f7c72a2f1ce0d5bef6"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::should_preserve_overlapping_stream_order (cyclomatic 25): pdf_inspector::extractor::should_preserve_overlapping_stream_order has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abada950b33147b55ca124aff303c051e7e062e0b1ec6de176599db6cff5ee6"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::tracked_run_space_floor (cyclomatic 25): pdf_inspector::extractor::tracked_run_space_floor has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff75ea7b5bd48d946fd08eb2aa9d66dc7af38e7021a6035860d005c021733bba"}},{"ruleId":"D1","level":"warning","message":{"text":"ToUnicodeCMap::parse (cyclomatic 24): ToUnicodeCMap::parse has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"18deeaa48a87a2a8dcf364b8a681c00d29c831cf18e2af4521ad5ac9f6b6dc3e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::parse_simple_font_widths (cyclomatic 24): pdf_inspector::extractor::fonts::parse_simple_font_widths 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. This is NOT this file\u0027s highest cyclomatic complexity: pdf_inspector::extractor::fonts::decode_single_byte_fallback_char (cyclomatic 29) 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":"src/extractor/fonts.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b599688a617f751df446f789b08bfbe70f818767085f8ccbae874ea1b3418e2"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::mac_glyph_order::build_cmap_from_mac_glyph_order (cyclomatic 24): pdf_inspector::mac_glyph_order::build_cmap_from_mac_glyph_order has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mac_glyph_order.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54182f07666817cedbdbecc7700c9021c64d8c68dda45bd40643108f70f3156"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::try_build_rect_guided_table (cyclomatic 24): pdf_inspector::tables::try_build_rect_guided_table has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb7513e7ca1fb9cf8b4c6fbd2aaffddda8535a90eb0a1f45d29e6c0053d5dd0"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::collapse_multiline_description_rows (cyclomatic 24): pdf_inspector::tables::detect_rects::collapse_multiline_description_rows has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1a4838d70b7511dd2151563dad1bceba29b6062e05420aaf8fcb180d0568af"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::parse_cid_w_array (cyclomatic 23): pdf_inspector::extractor::fonts::parse_cid_w_array 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. This is NOT this file\u0027s highest cyclomatic complexity: pdf_inspector::extractor::fonts::decode_single_byte_fallback_char (cyclomatic 29) 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":"src/extractor/fonts.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"54039088b16b1512ee7cdd304b913b282c9bde449544fc0fec1492565afdb328"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::find_table_regions_strict (cyclomatic 23): pdf_inspector::tables::detect_heuristic::find_table_regions_strict 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":"src/tables/detect_heuristic.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f25f50fdf7c9594ec0280ac2f954ee59a99d2c37879b77dfcf69733f3cb4433"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_struct::detect_tables_from_struct_tree (cyclomatic 23): pdf_inspector::tables::detect_struct::detect_tables_from_struct_tree 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":"src/tables/detect_struct.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"7574685e28679b535bd7b7aa5afeef7c6fe5619f808e69f2827f7cb82fe2b4fe"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extract_pages_markdown_mem_impl (cyclomatic 22): pdf_inspector::extract_pages_markdown_mem_impl 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":"src/lib.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a96e43e8501a7a9325852c0ed3e72dfeed9838e5dd783370572f6c4af853f4"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detector::content_mask::mask_strings_comments_and_inline_images (cyclomatic 22): pdf_inspector::detector::content_mask::mask_strings_comments_and_inline_images has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_mask.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd1954821517eaa1cb59d21dab1cb894e739a64394e2d7e157b78368294d488"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::content_decode::count_content_operators (cyclomatic 22): pdf_inspector::extractor::content_decode::count_content_operators 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":"src/extractor/content_decode.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a46ea6db5ab13f480ecab7698149b7ca1731451f5d168f59bf49e7fe8341a2"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::layout::mark_adjacent_page_folio_pairs (cyclomatic 22): pdf_inspector::extractor::layout::mark_adjacent_page_folio_pairs 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":"src/extractor/layout.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c8d3950eb9a4348f20d25726d428b3ee1402f1763f1e69187a136e4499f854"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::layout::try_banded_layout (cyclomatic 22): pdf_inspector::extractor::layout::try_banded_layout 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":"src/extractor/layout.rs"},"region":{"startLine":2769}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9b7b1e1e2381bf8ff4b9a43d2a1cbd925a55fd23810a72c554d3ea766d86f1"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::layout::group_single_column (cyclomatic 22): pdf_inspector::extractor::layout::group_single_column 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":"src/extractor/layout.rs"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb45028e07d675d56c11a832c5c9b86a1830b869235d7c18b792a3e51a4754c7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::overlong_numerals::saturate_overlong_bbox_numerals (cyclomatic 22): pdf_inspector::overlong_numerals::saturate_overlong_bbox_numerals 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":"src/overlong_numerals.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab04e4193f9e2bbb5c4c26184dfd33c6679dca3f478b868a779f9ca6d4c9031"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_lines::build_dense_row_anchor_table (cyclomatic 22): pdf_inspector::tables::detect_lines::build_dense_row_anchor_table has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"a833b9a635c58889b1e498f82eb622f945f74d228319d49aaf5d8ec7267c8ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::detect_row_stripe_table (cyclomatic 22): pdf_inspector::tables::detect_rects::detect_row_stripe_table has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74aa322b227973fcb32d7f1386a4fb5e9c46db15425c7d54c54641b3717e58f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tounicode::parse_binary_cmap (cyclomatic 22): pdf_inspector::tounicode::parse_binary_cmap 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":"src/tounicode.rs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e547659cf3e4ebbe5bd130dd023d8d493c682b56290bad30bdff0227f975cff"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extract_tables_with_structure_cells_mem (cyclomatic 21): pdf_inspector::extract_tables_with_structure_cells_mem 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":"src/lib.rs"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d99891de4ac1f911d4460ee55193b35d883811ecfaa81da0270a6896fed130"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::layout::mark_spread_folio_pairs (cyclomatic 21): pdf_inspector::extractor::layout::mark_spread_folio_pairs 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":"src/extractor/layout.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"512f9d673f837924729c7b8de5440fcf450db0a274016f63cb6d560fdd002b70"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::scripts::detect_script_runs (cyclomatic 21): pdf_inspector::extractor::scripts::detect_script_runs 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":"src/extractor/scripts.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8265f55df4d2041a6019810fbf17cd9126bd728b299ca7fbe49affc0f05f755c"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::rect_cluster_spans_band_boundary (cyclomatic 21): pdf_inspector::markdown::rect_cluster_spans_band_boundary 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":"src/markdown/mod.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e9fc0da9962e9630705afee05d589c5e6b7f1d101b2afd1bf56eeb734a0f74"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::convert::find_isolated_lines (cyclomatic 21): pdf_inspector::markdown::convert::find_isolated_lines 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":"src/markdown/convert.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"976fdba1f6a6afe1eacacf691619de0504d3684ba3b80c0c71aee32ff6e38cd7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::merge_adjacent_items_preserving (cyclomatic 21): pdf_inspector::tables::detect_heuristic::merge_adjacent_items_preserving 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":"src/tables/detect_heuristic.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"113c98905779fd9b4cde11dbff176e4f96d834c7d1083cc1b7c89b0a29467143"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tounicode::w_array_lookup (cyclomatic 21): pdf_inspector::tounicode::w_array_lookup 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":"src/tounicode.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa34c480f4a24fba5627cba7ee998f81be1e2dbda4b64f506c628a8947819e1"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tounicode::parse_encoding_cmap_stream (cyclomatic 21): pdf_inspector::tounicode::parse_encoding_cmap_stream 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":"src/tounicode.rs"},"region":{"startLine":2760}}}],"partialFingerprints":{"codehealthFindingId/v1":"142682dd4f3e9544030e6ea52b745ffcaabda1e7685a488c12b71cff69bdd502"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::xref_repair::parse_classic_xref_table_inner (cyclomatic 21): pdf_inspector::xref_repair::parse_classic_xref_table_inner 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":"src/xref_repair.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"2500d112a45360f44831004c0436213d226350084f3e66debf1006465778551e"}},{"ruleId":"D1","level":"warning","message":{"text":"ToUnicodeCMap::compute_gap_fills (cyclomatic 20): ToUnicodeCMap::compute_gap_fills 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":"src/tounicode.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7ff6f77d6b73a30cef010daedb0a6e1be8138fe4555d4a007b50f8999cf001"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tsr_assign_orphan_items (cyclomatic 20): pdf_inspector::tsr_assign_orphan_items 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":"src/lib.rs"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d610b20b8b42df1f2ef3c963f351063bc6596ca8cff5f496210ca7956a1aede8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::parse_encoding_dictionary (cyclomatic 20): pdf_inspector::extractor::fonts::parse_encoding_dictionary 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: pdf_inspector::extractor::fonts::decode_single_byte_fallback_char (cyclomatic 29) 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":"src/extractor/fonts.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea65a9869b4251fd20d997c88d798fdb3ce4ea2a2cac386e699ff60caf47c855"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::layout::find_relative_valleys (cyclomatic 20): pdf_inspector::extractor::layout::find_relative_valleys 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":"src/extractor/layout.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"46280baf966587090d2ac7462093a43cc56c7da349d8e6398f0f230b04e3f831"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::layout::is_newspaper_layout (cyclomatic 20): pdf_inspector::extractor::layout::is_newspaper_layout 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":"src/extractor/layout.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d75ffa2ce46c49eb8708e449ffc88c948b27418b9fc8d203db81f131b7945f0"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::split_side_by_side (cyclomatic 20): pdf_inspector::markdown::split_side_by_side 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":"src/markdown/mod.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b7f89abe9a724a93ac27a87ae8513df3ddbe5f6da1a1b1b127e9723fd1f818"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::split_from_hint_regions (cyclomatic 20): pdf_inspector::markdown::split_from_hint_regions 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":"src/markdown/mod.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d095ac9b76c0d67fe58d6ec2be707dd341e54a2a04752d8cc1c16427d4f8581"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::key_value_rows_look_like_prose (cyclomatic 20): pdf_inspector::tables::key_value_rows_look_like_prose 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":"src/tables/mod.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"f734f042c5968d1d4321c92134130e5629e89c436c5fad79bb9667328979612f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::text_utils::is_explicit_page_number_expression (cyclomatic 20): pdf_inspector::text_utils::is_explicit_page_number_expression 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":"src/text_utils.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c699ab0c4ccaada63ee7d96b9173573cf6ddd84663136217482056014fbdf3"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detector::analyze_page_images (cyclomatic 19): pdf_inspector::detector::analyze_page_images has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2090aa18b568769734e848c61fe5ceb30852b1956facd0120cdd35bf426dcf52"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detector::collect_images_from_resources (cyclomatic 19): pdf_inspector::detector::collect_images_from_resources has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33af2c3c76e366c51101faf331f9f9cfeda59355ee89af51c9401e218f67d26"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::base14::base14_table (cyclomatic 19): pdf_inspector::extractor::base14::base14_table has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/base14.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8da3e0f0122b07807cdb84dee7eaecc5c659613357baf618a7b8cf77630d99e"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::blank_glyph_codes (cyclomatic 19): pdf_inspector::extractor::fonts::blank_glyph_codes 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: pdf_inspector::extractor::fonts::decode_single_byte_fallback_char (cyclomatic 29) 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":"src/extractor/fonts.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"7529a0dde408e8aebf2b92ffe32d15a622435c218f568d9d6957f09a5ad86393"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::reading_order::paired_column_images (cyclomatic 19): pdf_inspector::extractor::reading_order::paired_column_images has cyclomatic complexity 19 (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":"src/extractor/reading_order.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e714b96b8951b4592708ca2862e8729d7b5c98ba31602fb0996449647423a537"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::convert::merge_continuation_tables (cyclomatic 19): pdf_inspector::markdown::convert::merge_continuation_tables has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"528067b0cd19c389d87169d1445ac323cc6c7c47eed8327fa8d5a911e0127dd8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::overlong_numerals::recover_referenced_bboxes_in_object_streams (cyclomatic 19): pdf_inspector::overlong_numerals::recover_referenced_bboxes_in_object_streams has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overlong_numerals.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"598de6662c7f2f654a8e9fc8d3b47bad6b54847bc8ea9fcd20af4bbdab2f86f8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::grid::find_column_boundaries (cyclomatic 19): pdf_inspector::tables::grid::find_column_boundaries has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/grid.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4be6a667e52ba63ba00a71ff41c536c81d267540117459d21fcf9b6517723de"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::vision::fusion::fuse_ocr_pages_impl (cyclomatic 19): pdf_inspector::vision::fusion::fuse_ocr_pages_impl has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/fusion.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"7448b9601a375cdd9ea569b45322d514f7a5db91854dda795f25af0900b13602"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::analysis::is_heading_fragment (cyclomatic 18): pdf_inspector::markdown::analysis::is_heading_fragment has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs 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":"src/markdown/analysis.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f4298506b3a2619046c425db88bc67de84490a1b8cdb9c1b656c170fd498d9"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::postprocess::dehyphenate_line_breaks (cyclomatic 18): pdf_inspector::markdown::postprocess::dehyphenate_line_breaks has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/postprocess.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac29c946b2ce2231d227a5e7456ab45ccf7d30be95c01be92f64bbdd9c7cb05"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::detect_tables_with_page_width (cyclomatic 18): pdf_inspector::tables::detect_heuristic::detect_tables_with_page_width has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc4e9aa96cb837c47a4723ab7ea2ea7c52710fdeee6d158dec6d100f848f199"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::structured::parse_structure (cyclomatic 18): pdf_inspector::tables::structured::parse_structure has cyclomatic complexity 18 (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":"src/tables/structured.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ca89c68922a0890831d149903f165c30f0e07f8a9c3a24284ab645b8d27275"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tounicode::parse_cidrange_section (cyclomatic 18): pdf_inspector::tounicode::parse_cidrange_section has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":2888}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b109f0f74e21795b9b6b1a317051edb0c57458b47d934363f762d161811a3b"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf-inspector.parseArgs (cyclomatic 18): pdf-inspector.parseArgs has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"napi/bin/pdf-inspector.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a5e9df11ce5933816d7c43de70d52d613439239cd2dff6111fdb871021d020"}},{"ruleId":"D1","level":"warning","message":{"text":"ToUnicodeCMap::decode_cids_with (cyclomatic 17): ToUnicodeCMap::decode_cids_with has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3de5b133e11f56d88c78f08351e7b026055109318912b837dc121f6b5ef488"}},{"ruleId":"D1","level":"warning","message":{"text":"FontCMaps::walk_xobject_fonts (cyclomatic 17): FontCMaps::walk_xobject_fonts has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":3684}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe77822088211ee05d1739c4ba6bbc2eb3f1b7dcb7297de2883b0cccb8a84f1"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::compute_layout_complexity_with_chart_regions (cyclomatic 17): pdf_inspector::compute_layout_complexity_with_chart_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":"src/lib.rs"},"region":{"startLine":6731}}}],"partialFingerprints":{"codehealthFindingId/v1":"943a281419e7062c70e33f8cf2ecdfa14f32b369372460c11ca298ee9bed8d24"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::bidi::visual_to_logical (cyclomatic 17): pdf_inspector::bidi::visual_to_logical has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bidi.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8eac5eee2ffd85e8b0e2186dd405c00a744d807adc085bee525b7456beb8ea0"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detector::identity_h_font_has_fallback (cyclomatic 17): pdf_inspector::detector::identity_h_font_has_fallback 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":"src/detector.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"569f22aae9e7dfae4ed10beaf347346b524e4847f340595eb71484f6fbd2cd4b"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::compose_detached_spacing_accents (cyclomatic 17): pdf_inspector::extractor::compose_detached_spacing_accents has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3d35ed876504c7d0f75932e4f70ea8ac99c0556a3d6e857bd395e815a9f6da"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::extractor::underline::mark_underlined_items (cyclomatic 17): pdf_inspector::extractor::underline::mark_underlined_items 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":"src/extractor/underline.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada71bafdc0dde597e1b3d2d23b52e16c361075ad81b8a8da0d548821e06484c"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::markdown::analysis::compute_paragraph_threshold (cyclomatic 17): pdf_inspector::markdown::analysis::compute_paragraph_threshold has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/analysis.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"085e2d41ee6606a96da45be9bc64ae1f692d3c4c294f7b29398798a78d73b78f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::overlong_numerals::mask_noise (cyclomatic 17): pdf_inspector::overlong_numerals::mask_noise has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overlong_numerals.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aff8e896d1f9a8fcfaba185a5dad938540a411bfdb7ae56ae511dba46f59b7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::looks_like_table_data (cyclomatic 17): pdf_inspector::tables::detect_heuristic::looks_like_table_data has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00c25ab30e38736f04e1124baa6ab6de2068c2558f24a82ed5f4737bcaa0407"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::is_paragraph_content (cyclomatic 17): pdf_inspector::tables::detect_heuristic::is_paragraph_content has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5f132fa46c657ba7fcd8a92881ab78cec2bf8a8f4e89476e410fc472b437b1"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::format::format_toc_as_list (cyclomatic 17): pdf_inspector::tables::format::format_toc_as_list has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/format.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8268c7b09ecdcea224ac15a764be2e348227bdfe3b573e1933bb067fca2b41"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::structured::derive_axis_bands (cyclomatic 17): pdf_inspector::tables::structured::derive_axis_bands has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/structured.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3876176247bfb691e38b24dfc297c6997ef89cded48017768e83bf4047c0c57"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokens::next (cyclomatic 16): Tokens::next 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":"src/extractor/type1.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"405104ced778c39a9ec7ca3545fb5d17f4fb3d700d5f2b3cfc2c47e62edef1c0"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detect_tsr_quality_issue (cyclomatic 16): pdf_inspector::detect_tsr_quality_issue has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b860f7b630c5e601ac42068acbd8ddc2c78dc8fcc09b75c12ab842de7b4f90"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::detect_file_type_hint (cyclomatic 16): pdf_inspector::detect_file_type_hint has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":6935}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4a10a290c97986b7a8b3fd557b3796095df7b541f12c2d2ee38dd3270fb6c0"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::form_bbox_repair::is_form_with_degenerate_bbox (cyclomatic 16): pdf_inspector::form_bbox_repair::is_form_with_degenerate_bbox 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":"src/form_bbox_repair.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5435ad3fd0c31bcb4e6df8ef6e11cbd1b0362f8af60871d3a82043ebdfab415"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tables::key_value_single_pair_allowed (cyclomatic 16): pdf_inspector::tables::key_value_single_pair_allowed has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"88491650aca34ac610e168bb08fcf44131d8c69d66b5c746a4b71aeb84c6233d"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::tounicode::parse_binary_cmap_encoding (cyclomatic 16): pdf_inspector::tounicode::parse_binary_cmap_encoding 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":"src/tounicode.rs"},"region":{"startLine":2974}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c6d7928ba1e3bd29531ec7a8386a6db6cf5aae22a4d826a6baea0d3a8e4da8"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_inspector::xref_repair::skip_pdf_object (cyclomatic 16): pdf_inspector::xref_repair::skip_pdf_object has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xref_repair.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"610dd6fd3d1b5096f85957e7407ae87fdb3d468b0718b685b37bdabc1bc81142"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::content_stream::extract_page_text_items_with_options (cognitive 789): pdf_inspector::extractor::content_stream::extract_page_text_items_with_options has cognitive complexity 789 (threshold 15). Drivers by points: if/else 169 (644 pts), boolean chains 60, loops 13 (44 pts), match/switch 11 (41 pts) (nesting depth added 536). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea15e98ca46619b142c18c99640ecd6245c94919a31ca7d6f5753fbce3d3851e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::xobjects::extract_form_xobject_text_inner (cognitive 475): pdf_inspector::extractor::xobjects::extract_form_xobject_text_inner has cognitive complexity 475 (threshold 15). Drivers by points: if/else 102 (388 pts), boolean chains 34, match/switch 7 (27 pts), loops 8 (26 pts) (nesting depth added 324). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/xobjects.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"777315b950b3d08c235c1439516eec63707188ee347a097fb780e0fc662cffef"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::convert_items_with_rects_lines_and_table_output (cognitive 385): pdf_inspector::markdown::convert_items_with_rects_lines_and_table_output has cognitive complexity 385 (threshold 15). Drivers by points: if/else 72 (254 pts), loops 32 (109 pts), boolean chains 20, match/switch 1 (2 pts) (nesting depth added 260). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"2601f3ffb555dd57eca2a2719207244c138ad72ade8b3927c3bb3ccd4ef2d6fd"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::extract_text_from_operand (cognitive 244): pdf_inspector::extractor::fonts::extract_text_from_operand has cognitive complexity 244 (threshold 15). Drivers by points: if/else 68 (195 pts), match/switch 8 (22 pts), boolean chains 21, loops 2 (6 pts) (nesting depth added 145). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"181037959b684cf028e112736df306077c3435d40433058de0d36be5f2633218"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::convert::to_markdown_from_lines_with_tables_and_images (cognitive 203): pdf_inspector::markdown::convert::to_markdown_from_lines_with_tables_and_images has cognitive complexity 203 (threshold 15). Drivers by points: if/else 67 (156 pts), boolean chains 29, loops 6 (11 pts), match/switch 3 (7 pts) (nesting depth added 98). Of this number, 199 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":"src/markdown/convert.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eb15b4fd31d74f2761db45eb914922cf411270ea5fefd14df5c96428edbc07"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::content_scan::scan_masked_content (cognitive 155): pdf_inspector::detector::content_scan::scan_masked_content has cognitive complexity 155 (threshold 15). Drivers by points: if/else 46 (108 pts), boolean chains 38, match/switch 2 (8 pts), loops 1 (nesting depth added 68). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_scan.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"0073a618e0aebf0a772c5859094b2b2a8a66b5c95e597c33bb0a99291c3c66ea"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::detect_tables_from_rects (cognitive 151): pdf_inspector::tables::detect_rects::detect_tables_from_rects has cognitive complexity 151 (threshold 15). Drivers by points: if/else 45 (119 pts), loops 7 (19 pts), boolean chains 13 (nesting depth added 86). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32246dbdb2b76e714b7b687c7040c47ee0b46b7b833ae2433c11c4030ef9d09"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::merge_text_items_with_clips (cognitive 137): pdf_inspector::extractor::merge_text_items_with_clips has cognitive complexity 137 (threshold 15). Drivers by points: if/else 37 (88 pts), boolean chains 25, match/switch 4 (14 pts), loops 5 (10 pts) (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dd932ad236983f25bfd779a387780b7e78b0b4655d667dffa9a0902c5212df"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::collect_text_chars_before (cognitive 129): pdf_inspector::detector::collect_text_chars_before has cognitive complexity 129 (threshold 15). Drivers by points: if/else 21 (75 pts), loops 11 (36 pts), boolean chains 9, match/switch 2 (9 pts) (nesting depth added 86). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18d1ef9b441eb107d035049c7fe34b2dcc86cb114906e5c94d5344142ba29de"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::detect_from_document (cognitive 124): pdf_inspector::detector::detect_from_document has cognitive complexity 124 (threshold 15). Drivers by points: if/else 41 (80 pts), boolean chains 28, loops 6 (9 pts), match/switch 4 (7 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dee21d5178de6acb8f7bb787282eab6d8a87f3bbe77946bf89cf1e169a42577"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::convert::to_markdown_from_lines (cognitive 113): pdf_inspector::markdown::convert::to_markdown_from_lines has cognitive complexity 113 (threshold 15). Drivers by points: if/else 41 (96 pts), boolean chains 16, loops 1 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"6074952c85d6cfb3b036ee4c53f709b8a7ba6080eb2a274e6908f44e3ef4cd1f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::bin::pdf2md::main (cognitive 108): pdf_inspector::bin::pdf2md::main has cognitive complexity 108 (threshold 15). Drivers by points: if/else 40 (88 pts), match/switch 8 (17 pts), boolean chains 3 (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":"src/bin/pdf2md.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb909a13bd1b2389a4802e147121ce8c1af2eb977c4fc1ccc9d00c425d04244"}},{"ruleId":"D2","level":"warning","message":{"text":"FontCMaps::collect_cmaps_from_fonts_inner (cognitive 103): FontCMaps::collect_cmaps_from_fonts_inner has cognitive complexity 103 (threshold 15). Drivers by points: if/else 30 (66 pts), match/switch 14 (29 pts), boolean chains 5, loops 3 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eedef06a3a14bb4f99ea6443eec53659b84585692f432decd8bd734be4c48b4"}},{"ruleId":"D2","level":"warning","message":{"text":"ToUnicodeCMap::parse_bfrange_section (cognitive 100): ToUnicodeCMap::parse_bfrange_section has cognitive complexity 100 (threshold 15). Drivers by points: if/else 18 (62 pts), loops 12 (38 pts) (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":"src/tounicode.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"83700d280cb3ec3747129c4def796ffefd6e76f08fffcaad27d96889de0c5ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tounicode::build_simple_cmap_from_truetype (cognitive 98): pdf_inspector::tounicode::build_simple_cmap_from_truetype has cognitive complexity 98 (threshold 15). Drivers by points: if/else 18 (68 pts), loops 8 (26 pts), boolean chains 4 (nesting depth added 68). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf1f50bdeb321e0fbe48d286dade7f8d496be9d1424a94bbf89cd44ca0d9109"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::page_number_context_masks (cognitive 96): pdf_inspector::extractor::layout::page_number_context_masks has cognitive complexity 96 (threshold 15). Drivers by points: if/else 12 (46 pts), loops 9 (29 pts), boolean chains 21 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"e408405e668173df10a6c718421eef80a3fd7ab29acd2a2afde03490f3dab332"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::furniture::strip_repeated_lines (cognitive 91): pdf_inspector::markdown::furniture::strip_repeated_lines has cognitive complexity 91 (threshold 15). Drivers by points: if/else 33 (62 pts), loops 13 (18 pts), boolean chains 8, match/switch 3 (nesting depth added 34). Of this number, 87 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":"src/markdown/furniture.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6f9864a99b552e31c6eb5182b3eb2249dce688e22106c01e20fe36604bb91c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::text_utils::should_join_items (cognitive 82): pdf_inspector::text_utils::should_join_items has cognitive complexity 82 (threshold 15). Drivers by points: if/else 28 (56 pts), boolean chains 25, match/switch 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/text_utils.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a198cc58f2a97a14e02497087edd51e05c38ab569601e652a347ac223a0ab7a9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::cluster_rects (cognitive 81): pdf_inspector::tables::detect_rects::cluster_rects has cognitive complexity 81 (threshold 15). Drivers by points: loops 17 (38 pts), if/else 9 (35 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 51). 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":"src/tables/detect_rects.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b89373c0fcbec77836a0d610e9502d0a5d39367ca1941833398d49a4eaf437"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::try_build_key_value_table_from_rows (cognitive 80): pdf_inspector::tables::try_build_key_value_table_from_rows has cognitive complexity 80 (threshold 15). Drivers by points: if/else 34 (52 pts), boolean chains 24, loops 3 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4859f98e79f96bc648462231652476d7014fc95eb81d983dd89207e97e4f06"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::detect_row_stripe_table_from_cell_rects (cognitive 78): pdf_inspector::tables::detect_rects::detect_row_stripe_table_from_cell_rects has cognitive complexity 78 (threshold 15). Drivers by points: if/else 31 (51 pts), loops 8 (16 pts), boolean chains 9, match/switch 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":"src/tables/detect_rects.rs"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d289279e0ca27cc3e01f9f7161fbd0f1452577402d730ebe7bccef1d377207"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::try_build_table_from_columns (cognitive 77): pdf_inspector::tables::try_build_table_from_columns has cognitive complexity 77 (threshold 15). Drivers by points: if/else 27 (51 pts), loops 11 (17 pts), boolean chains 9 (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":"src/tables/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55260d0a31192840a6cbaebd36d0be3365094f6a1cc27243473db8aeec56231"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::structure_tree::parse_struct_element_dict (cognitive 76): pdf_inspector::structure_tree::parse_struct_element_dict has cognitive complexity 76 (threshold 15). Drivers by points: if/else 19 (55 pts), match/switch 6 (17 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structure_tree.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"35556685799f6a827e5ac6ffca33aef0e7a7f5c1ca082b8bfecc352707885c88"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extract_tables_in_regions_mem_with_options (cognitive 75): pdf_inspector::extract_tables_in_regions_mem_with_options has cognitive complexity 75 (threshold 15). Drivers by points: if/else 25 (58 pts), loops 4 (7 pts), match/switch 2 (6 pts), boolean chains 4 (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":"src/lib.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bea15cc68985c204fd7ffbb25b300b57f4a9400718f2be85ac0460281222b9c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::vision::pipeline::process_pdf_with_ocr_mem (cognitive 74): pdf_inspector::vision::pipeline::process_pdf_with_ocr_mem has cognitive complexity 74 (threshold 15). Drivers by points: if/else 23 (52 pts), loops 5 (8 pts), match/switch 3 (8 pts), boolean chains 6 (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":"src/vision/pipeline.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3892083c208da10afce5459aedc0ea3493c282f104ad89dddccd6c1dfa40b15"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_lines::detect_dense_line_chart_regions (cognitive 73): pdf_inspector::tables::detect_lines::detect_dense_line_chart_regions has cognitive complexity 73 (threshold 15). Drivers by points: if/else 20 (44 pts), loops 9 (16 pts), boolean chains 13 (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":"src/tables/detect_lines.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2a9a1bad310a3d6509db1a0259685175a923e39c7095337076e2a8c552f131"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::process_document (cognitive 72): pdf_inspector::process_document has cognitive complexity 72 (threshold 15). Drivers by points: if/else 34 (52 pts), loops 4 (11 pts), boolean chains 8, match/switch 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":4578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed16bd2ad9b8fc77b1f7cacdd5c138adad1f43f2c4e48059ade17a60ddf490f4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::decoded_text_counts_within (cognitive 72): pdf_inspector::detector::decoded_text_counts_within has cognitive complexity 72 (threshold 15). Drivers by points: if/else 11 (36 pts), match/switch 8 (28 pts), loops 3 (7 pts), boolean chains 1 (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":"src/detector.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"919dd1f947ce98e2c2c4184a7918f05c8a88eb58f1840a2b7cac1d71e18dc160"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::is_parallel_prose_table (cognitive 68): pdf_inspector::markdown::is_parallel_prose_table has cognitive complexity 68 (threshold 15). Drivers by points: if/else 15 (36 pts), boolean chains 23, loops 7 (9 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5649fbb052417189b9747f80f168f591eb2397a2d7aed5111ae73158c65b74"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::links::extract_page_links (cognitive 66): pdf_inspector::extractor::links::extract_page_links has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (63 pts), loops 1 (3 pts) (nesting depth added 46). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/links.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3159a56543013e78f2a6557c5802380dd3ab3b1e18f41e5550c8e17dd9fb9f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::extract_positioned_text_impl (cognitive 65): pdf_inspector::extractor::extract_positioned_text_impl has cognitive complexity 65 (threshold 15). Drivers by points: if/else 17 (41 pts), match/switch 3 (9 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28581705d738ec01ef75a1ef57d2e7dee121927167c4067f9edf7e4d3df1bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::looks_like_partial_table_ex (cognitive 64): pdf_inspector::looks_like_partial_table_ex has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (46 pts), boolean chains 12, loops 3 (6 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":5636}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd6f3ddfa52cb91e490ec1ef936a598b9975d9a1008ebde882a4e989ee3441a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::analyze_page_images (cognitive 64): pdf_inspector::detector::analyze_page_images has cognitive complexity 64 (threshold 15). Drivers by points: if/else 9 (38 pts), match/switch 4 (20 pts), loops 1 (5 pts), boolean chains 1 (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacd9faba051e48ba7c92625cf4e433e06b8c240d1a129ca6444e2f2efd9e2a8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tounicode::parse_binary_cmap (cognitive 64): pdf_inspector::tounicode::parse_binary_cmap has cognitive complexity 64 (threshold 15). Drivers by points: if/else 13 (42 pts), loops 5 (16 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2031fc4c4b20f71dc6c685fd04af3aee45944b8f1d13d2524d2abf5f5a9aaf0"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_struct::detect_tables_from_struct_tree (cognitive 63): pdf_inspector::tables::detect_struct::detect_tables_from_struct_tree has cognitive complexity 63 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 7 (22 pts), boolean chains 3 (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":"src/tables/detect_struct.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d0288d6b29a63ee7f97fa24a64fbead8b6645fbeb109ad116893492a2dfcf2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::detect_columns (cognitive 61): pdf_inspector::extractor::layout::detect_columns has cognitive complexity 61 (threshold 15). Drivers by points: if/else 27 (47 pts), boolean chains 8, loops 4 (6 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e27e5ba43f36d7bb697e15abd6db0892f14d395a589f5bd19c057c2bb087c1"}},{"ruleId":"D2","level":"warning","message":{"text":"TextLine::text_with_formatting (cognitive 60): TextLine::text_with_formatting has cognitive complexity 60 (threshold 15). Drivers by points: if/else 24 (38 pts), boolean chains 19, match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/types.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"36bdf2a6987f9e3bff6083fb0b993a112e742c33f5242cfbed4dbf165608882a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::order_columns_with_policy (cognitive 60): pdf_inspector::extractor::layout::order_columns_with_policy has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 15 (28 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb2016e0444b7740400c018e92dde1433c93cdedf42ea0c78d567d9c0ed7e09"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::bidi::logical_line_order (cognitive 59): pdf_inspector::bidi::logical_line_order has cognitive complexity 59 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 6 (11 pts), boolean chains 5, match/switch 2 (5 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":"src/bidi.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde0d1dc14a724816c9b5396bf3dc720c9c06841e515463c469b7afd447e7077"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_lines::detect_tables_from_lines_inner (cognitive 58): pdf_inspector::tables::detect_lines::detect_tables_from_lines_inner has cognitive complexity 58 (threshold 15). Drivers by points: if/else 37 (48 pts), boolean chains 9, 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":"src/tables/detect_lines.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7c9a887c4bfa0ca0ab09b7bcee1cdb8b32001ce0fa39b6e767ce9f4d14a8b4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extract_tables_with_structure_cells_mem (cognitive 57): pdf_inspector::extract_tables_with_structure_cells_mem has cognitive complexity 57 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 7 (15 pts), boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fc233602e915618f7874c7b06a10a39b86778f3f9ec659c827e37d2952b164"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::furniture::strip_edge_furniture (cognitive 56): pdf_inspector::markdown::furniture::strip_edge_furniture has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 8 (16 pts), boolean chains 6 (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":"src/markdown/furniture.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dacc5f866d3406909c1b7dfb4774d1f1dc59111b82b657301719b0ec0bcc87f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extract_text_in_regions_mem_with_options (cognitive 55): pdf_inspector::extract_text_in_regions_mem_with_options has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 5 (11 pts), boolean chains 7 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1001df04b02914e92082409b0a1c5c97483a912fb1935833b86348ed9e115ba8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::convert::merge_continuation_tables (cognitive 53): pdf_inspector::markdown::convert::merge_continuation_tables has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 5 (14 pts), match/switch 2 (5 pts) (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":"src/markdown/convert.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cbcc6323321465be834527989200f65196dfccfcac387a84c18c6e57f591b5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::heading::classify_heading_sequences (cognitive 53): pdf_inspector::markdown::heading::classify_heading_sequences has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (29 pts), boolean chains 14, loops 6 (10 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":"src/markdown/heading.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"275c0c346d1db1aa26f80a5404309bc7f83853396ba70e8b0657cfe84116bff4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::postprocess::format_urls (cognitive 53): pdf_inspector::markdown::postprocess::format_urls has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 7 (17 pts), boolean chains 9 (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":"src/markdown/postprocess.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a3acdd0d982d431d9341f7065cdc5193d937617d24007c82d488f2422b4030"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::format::clean_table_cells (cognitive 53): pdf_inspector::tables::format::clean_table_cells has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 21, loops 2 (5 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/format.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"090ade3924a4f58600aa12bc8bfbd587fa248148061b021bb540b70242618e56"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::bidi::analysis_sequence (cognitive 51): pdf_inspector::bidi::analysis_sequence has cognitive complexity 51 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 7 (14 pts), match/switch 3 (10 pts), boolean chains 7 (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":"src/bidi.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c55f3d0a723e3ce9d35387881f5da7caf7aa41ca0f195918d82688dbfdf661"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::detect_stacked_box_table (cognitive 51): pdf_inspector::tables::detect_rects::detect_stacked_box_table has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 19, loops 5 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5de960e315f984fce2ab4e5fed57dc23fc9d81fb6d010c8f00951b0e770f168"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::is_newspaper_layout (cognitive 49): pdf_inspector::extractor::layout::is_newspaper_layout has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (43 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b512a97541586a611e866f42f2dfba451e3751b64d835058c56bd1bc2de478"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::links::walk_form_fields (cognitive 49): pdf_inspector::extractor::links::walk_form_fields has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (33 pts), match/switch 8 (11 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/links.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"94caa6b74a881f74f6fa8b854dca63aa2c0e993a9b9c8b2c0463fd65cc0e57c1"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::scripts::detect_script_runs (cognitive 49): pdf_inspector::extractor::scripts::detect_script_runs has cognitive complexity 49 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 5 (9 pts), match/switch 2 (7 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/scripts.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"397b3d5b04ac85c3b7fda19394535bce00cbc83284fbed38ae2e47a13d280346"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::find_first_table_row (cognitive 49): pdf_inspector::tables::detect_heuristic::find_first_table_row has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 12, loops 4 (9 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":"src/tables/detect_heuristic.rs"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de72d91a12dc87ee3222f418609aa3bd6b047c31eb86c6873403a2065516920"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::word_gaps::tj_tracking (cognitive 47): pdf_inspector::extractor::word_gaps::tj_tracking has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 5 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/word_gaps.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4f2ae70e7af322898621218dd11e2421e107d0c1e2ee49f5e41372b24247b3"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_lines::build_text_anchor_table (cognitive 47): pdf_inspector::tables::detect_lines::build_text_anchor_table has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 17, loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a2fdbc80e8504a72479333752decace08890915a75f450ef134015094de244"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_struct::recover_unclaimed_header_row (cognitive 47): pdf_inspector::tables::detect_struct::recover_unclaimed_header_row has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (35 pts), loops 7 (9 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_struct.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd84e074dcf2e9c48cd51f503ee561104aeea78e591d7019e645b1a447975c21"}},{"ruleId":"D2","level":"warning","message":{"text":"ToUnicodeCMap::decode_cids_with (cognitive 45): ToUnicodeCMap::decode_cids_with has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 2 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bed4773ab19c217c5bb5550460de42d452d9b57c46dd75170b79da5b6cd395"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::group_single_column (cognitive 45): pdf_inspector::extractor::layout::group_single_column has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (37 pts), boolean chains 6, loops 2 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb5e21d9861a389b963f433f7930b86cf361ee224aef390393ca75b1f83aeaf"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::find_table_regions_strict (cognitive 45): pdf_inspector::tables::detect_heuristic::find_table_regions_strict has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 8 (13 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":"src/tables/detect_heuristic.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d89d3ff2bc6b56166a78846e805362749dfa926a47b1533d548da58183a6de"}},{"ruleId":"D2","level":"warning","message":{"text":"ToUnicodeCMap::parse (cognitive 44): ToUnicodeCMap::parse has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (35 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02c3378f3e057bda8d84e7c7cb3bd69b01a41a4ff736448fb5e4e6103367abd"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::parse_cid_w_array (cognitive 43): pdf_inspector::extractor::fonts::parse_cid_w_array has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 3 (8 pts), match/switch 4 (6 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":"src/extractor/fonts.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e122911765efc523414f852e096291b709da990518e15f31a66d67b061a61b5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::try_build_rect_guided_table (cognitive 42): pdf_inspector::tables::try_build_rect_guided_table has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 9 (16 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":"src/tables/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b848eeeade07d619ef5252d5457aae82346947a8b226d93629711253271822"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::collapse_multiline_description_rows (cognitive 42): pdf_inspector::tables::detect_rects::collapse_multiline_description_rows has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 9, loops 2 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7acc77fb00eca293043c738744d3008dbe97fc6a9aaaec02583456cc8f0096a3"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tounicode::parse_encoding_cmap_stream (cognitive 42): pdf_inspector::tounicode::parse_encoding_cmap_stream has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 3 (5 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":"src/tounicode.rs"},"region":{"startLine":2760}}}],"partialFingerprints":{"codehealthFindingId/v1":"05373c82922e61c3c44090d1d3eadd18090d8017f8f25bfb5390f56da72438d4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::parse_simple_font_widths (cognitive 41): pdf_inspector::extractor::fonts::parse_simple_font_widths has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 5 (12 pts), boolean chains 1, 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":"src/extractor/fonts.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f88c666ef7547c694d22bfef3355afa3229899c490e68edf788bd18f843f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::mark_spread_folio_pairs (cognitive 40): pdf_inspector::extractor::layout::mark_spread_folio_pairs has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (28 pts), loops 6 (9 pts), boolean chains 3 (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":"src/extractor/layout.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bbe4ccf43bb37ecd0bf7b8c145661aa6b188a3489a18440e70acbc3a47951a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::xobjects::collect_xobjects_from_dict (cognitive 40): pdf_inspector::extractor::xobjects::collect_xobjects_from_dict has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (37 pts), loops 1 (3 pts) (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/xobjects.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb12e9d095e4354041e86592c699637132708281714749ad9406be28e8185fb"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::merge_adjacent_items_preserving (cognitive 40): pdf_inspector::tables::detect_heuristic::merge_adjacent_items_preserving has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b7eea33f66e2a7aed035a43158ab03fd8c1209fa3e6f04104069460c431e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::detect_table_in_region (cognitive 40): pdf_inspector::tables::detect_heuristic::detect_table_in_region has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (27 pts), boolean chains 6, loops 3 (4 pts), match/switch 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6c4ffc906e095bb5822c591ce7aebc8896f5d38b56c982aa35ac53afc97bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::stale_identity_cmap_overrides (cognitive 39): pdf_inspector::extractor::fonts::stale_identity_cmap_overrides has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 10, match/switch 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61eedc391ba9ec2b35e0252e18ba6fbaf94180fa06db3b7643555078830b59a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::type1::builtin_encoding (cognitive 39): pdf_inspector::extractor::type1::builtin_encoding has cognitive complexity 39 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 5 (13 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/type1.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b3dbe870dd5868eec9c0f03e093ef0fa193f9e4e5a84e26ed1d82ad757d99d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::analysis::compute_paragraph_threshold (cognitive 39): pdf_inspector::markdown::analysis::compute_paragraph_threshold has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 3 (5 pts), boolean chains 2 (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":"src/markdown/analysis.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c244699ba59c1cfe31d338007757720afd5e375a61e424c4c698152df15b500"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::detect_contents_list (cognitive 38): pdf_inspector::tables::detect_heuristic::detect_contents_list has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 14, loops 3, match/switch 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1355fd2bd37137a5073bcd163fdf924c03e45fc7546f5c5aa5f9f8adf806bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tounicode::cid_values_look_like_unicode (cognitive 38): pdf_inspector::tounicode::cid_values_look_like_unicode has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 2 (6 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":3109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e2b5d7e45519ded55b2682a3eb03893636bee83c01e95466f414f32ad3e312"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tsr_assign_orphan_items (cognitive 37): pdf_inspector::tsr_assign_orphan_items has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8a3873bb7cee6b79b1906b72b30dc049eedc706366f05a222261159d9dded3"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tounicode::parse_cidrange_section (cognitive 37): pdf_inspector::tounicode::parse_cidrange_section has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 8 (15 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":"src/tounicode.rs"},"region":{"startLine":2888}}}],"partialFingerprints":{"codehealthFindingId/v1":"7834bfff8b145b007dd57f48029cfb56d1151c30ba07a1b41e00d75d5b6076b6"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::vision::fusion::fuse_ocr_pages_impl (cognitive 37): pdf_inspector::vision::fusion::fuse_ocr_pages_impl has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 4, loops 3, 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":"src/vision/fusion.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80c7023a885327efdd550e1045e68c4781313e597cff31caf0b29f7b9ee0981"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::content_mask::header_tokens (cognitive 36): pdf_inspector::detector::content_mask::header_tokens has cognitive complexity 36 (threshold 15). Drivers by points: loops 6 (16 pts), match/switch 3 (9 pts), if/else 2 (7 pts), boolean chains 4 (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":"src/detector/content_mask.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b3e23b4ea3533160ed4003abd58352d265369a424fca39ac667066df9f3c65"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::find_relative_valleys (cognitive 36): pdf_inspector::extractor::layout::find_relative_valleys has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 4 (5 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":"src/extractor/layout.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2fe8a0ae82c43566a55528638f81ad7f3739be000ad090d650ca49061eb5b5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::try_banded_layout (cognitive 36): pdf_inspector::extractor::layout::try_banded_layout has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 5 (9 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":2769}}}],"partialFingerprints":{"codehealthFindingId/v1":"687280974e6a7baea7752e565087445cf0afb1d46f72525ab50cce59a13dc929"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::overlong_numerals::saturate_overlong_bbox_numerals (cognitive 36): pdf_inspector::overlong_numerals::saturate_overlong_bbox_numerals has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 4 (7 pts), match/switch 3 (4 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":"src/overlong_numerals.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8053c978f21fce48f4606ef399b80c31f7136f1a294d221d9f2c6adc22e31e7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::should_preserve_overlapping_stream_order (cognitive 35): pdf_inspector::extractor::should_preserve_overlapping_stream_order has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 7, loops 4 (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":"src/extractor/mod.rs"},"region":{"startLine":1357}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e25d4cc677158248bcf06fd517a70d6be341aba2be2ec95a86c0a7c914e78e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::overlong_numerals::recover_referenced_bboxes_in_object_streams (cognitive 35): pdf_inspector::overlong_numerals::recover_referenced_bboxes_in_object_streams has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 5 (9 pts), match/switch 2 (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":"src/overlong_numerals.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a8271dfdc7c29a5e88b66634e70fd70ce481569ceac44be8ed37fc51f11f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::detect_tables_with_page_width (cognitive 35): pdf_inspector::tables::detect_heuristic::detect_tables_with_page_width has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4cbbd03a346eb950c51513d63db1d7bc84ba5689e158eff2ffd2605ca26b30"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tounicode::parse_binary_cmap_encoding (cognitive 35): pdf_inspector::tounicode::parse_binary_cmap_encoding has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (14 pts), match/switch 2 (5 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":"src/tounicode.rs"},"region":{"startLine":2974}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bccd0cbdddef903b34ad1661be3ca3b31207f285d285e3337036bfe288d938"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::content_mask::mask_strings_comments_and_inline_images (cognitive 34): pdf_inspector::detector::content_mask::mask_strings_comments_and_inline_images has cognitive complexity 34 (threshold 15). Drivers by points: if/else 2 (10 pts), loops 4 (10 pts), match/switch 3 (9 pts), boolean chains 5 (nesting depth added 20). Of this number, 33 points are the body\u0027s own statements and 1 belongs 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":"src/detector/content_mask.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"55748d2425ff5a6abfa8961173d8786aa4298deb4e4bffab1478b64257d3bb31"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::is_page_number_toc (cognitive 34): pdf_inspector::tables::detect_heuristic::is_page_number_toc has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 16, loops 1 (nesting depth added 3). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f018d497f338adaa5efa3454279a84c05ebb8960e115744a8bc83d8fbbc7dac"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::try_build_grid (cognitive 34): pdf_inspector::tables::detect_rects::try_build_grid has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (24 pts), loops 4 (5 pts), boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbd57195c0df534f6a4e67cab3dc5e0f5fe9923ff28f7a0463897744e40c0f2"}},{"ruleId":"D2","level":"warning","message":{"text":"ToUnicodeCMap::compute_gap_fills (cognitive 33): ToUnicodeCMap::compute_gap_fills has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 6, 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":"src/tounicode.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7d64d9bb9feb2d40b73e60f439914860e15a8d2b4d0e8b7de1bbdffbf50769"}},{"ruleId":"D2","level":"warning","message":{"text":"FontCMaps::walk_xobject_fonts (cognitive 33): FontCMaps::walk_xobject_fonts has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 6 (14 pts), loops 2 (5 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":"src/tounicode.rs"},"region":{"startLine":3684}}}],"partialFingerprints":{"codehealthFindingId/v1":"9215e686b08336f5e9a46e524ebbaadf34dd19a5a64610f95bbfe9a91c5f9827"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::compute_layout_complexity_with_chart_regions (cognitive 33): pdf_inspector::compute_layout_complexity_with_chart_regions has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":6731}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9d0eedd8efa886f99f492017026962826f3e5ad39d3f0c3efe97a9bd06321d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::bidi::visual_to_logical (cognitive 33): pdf_inspector::bidi::visual_to_logical has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (27 pts), loops 4 (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":"src/bidi.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"74794be001384e415d15ae797216419e1060caf35ae58ada68a71c0733069173"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::collect_images_from_resources (cognitive 33): pdf_inspector::detector::collect_images_from_resources has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 8 (16 pts), 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":"src/detector.rs"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"2453f9a3ee46af762032aafa859d3573b4337662a27a3fcdd0ed6f246cdd69fa"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::tracked_run_space_floor (cognitive 33): pdf_inspector::extractor::tracked_run_space_floor has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 7, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2362225a966e58e835a247e874dde0cf4ea4c87c2b21b343a0dc095ba4d331d1"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::compose_detached_spacing_accents (cognitive 33): pdf_inspector::extractor::compose_detached_spacing_accents has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (4 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":"src/extractor/mod.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d9d2563cb79b7e72f9f69d3e166422d0709a0dcda8f0c9161426ea19cb465c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::preprocess::merge_drop_caps (cognitive 33): pdf_inspector::markdown::preprocess::merge_drop_caps has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 2 (4 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":"src/markdown/preprocess.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f04f450df21926e63d1bbef2513f45fa9e58e57179ea77545ca5ef07064348"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::xref_repair::parse_classic_xref_table_inner (cognitive 33): pdf_inspector::xref_repair::parse_classic_xref_table_inner has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, match/switch 2 (4 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":"src/xref_repair.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28bdc9bceb964fc035bdd661f6943fb62a279820907f3d8475ffffa0af0ba47"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extract_pages_markdown_mem_impl (cognitive 32): pdf_inspector::extract_pages_markdown_mem_impl has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 7, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbfcb04d17da38a67c1bdaf0bfda048611c3752b39e287cc90ccdb4e19df326"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::split_from_hint_regions (cognitive 32): pdf_inspector::markdown::split_from_hint_regions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 4 (5 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":"src/markdown/mod.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e54a3dfb2f1e398aa27ea5b6ce33ec77c76ac7567bf4d57a4d7b0e4ccaf983e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::convert::find_isolated_lines (cognitive 32): pdf_inspector::markdown::convert::find_isolated_lines has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 7, 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":"src/markdown/convert.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecf44741f93a5cb45b70ab9eaa337e22af2d5870175386df438f0870121a658"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::grid::find_column_boundaries (cognitive 32): pdf_inspector::tables::grid::find_column_boundaries has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/grid.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"797470e5995875d9425bb591c99f95b6c71604d280f4441167182a1b5b12f4f9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::parse_encoding_dictionary (cognitive 31): pdf_inspector::extractor::fonts::parse_encoding_dictionary has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 5 (9 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":"src/extractor/fonts.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"680c8dc714aec517dee02768f427fa3c24924dbdc1a1ab78671fee59969c029a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::mark_adjacent_page_folio_pairs (cognitive 31): pdf_inspector::extractor::layout::mark_adjacent_page_folio_pairs has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 5, loops 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":"src/extractor/layout.rs"},"region":{"startLine":1365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4039347ba0720a4026231c642ff5ebb004a7f1e71c0ed96f31bb960e4dcdc4"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::overlong_numerals::mask_noise (cognitive 31): pdf_inspector::overlong_numerals::mask_noise has cognitive complexity 31 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 4 (10 pts), match/switch 2 (6 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":"src/overlong_numerals.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3170cf3ed0f40cd85a70fff658411f183f47f9d3259e7e53018ce7dfb9f6993b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tounicode::w_array_lookup (cognitive 31): pdf_inspector::tounicode::w_array_lookup has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 7 (10 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":1817}}}],"partialFingerprints":{"codehealthFindingId/v1":"626f2670dd8907435c1e079d493c3baa82d172dbe73e61186aeb81e404a567c2"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::mac_glyph_order::build_cmap_from_mac_glyph_order (cognitive 30): pdf_inspector::mac_glyph_order::build_cmap_from_mac_glyph_order has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 6, 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":"src/mac_glyph_order.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe862d02cfca9c32b8767ff302271b70c0471392339f414d968b7f50edbd063"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::analysis::is_heading_fragment (cognitive 30): pdf_inspector::markdown::analysis::is_heading_fragment has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 5 (nesting depth added 13). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/analysis.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"d636cf8be068ae3c8e54af860cefa45fa1ef11bfb2021f8a4305fcc41a90ca73"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::format::format_toc_as_list (cognitive 30): pdf_inspector::tables::format::format_toc_as_list has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 5, 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":"src/tables/format.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5f85b4ad8be0aacae8aa2172a5687d0e1eedf777bb716fa25354ccfe9e473c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::structured::parse_structure (cognitive 30): pdf_inspector::tables::structured::parse_structure has cognitive complexity 30 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 3 (8 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 17). 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":"src/tables/structured.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f91b3c3df91fae57010af2dd1de998aca47c890503ba5acd8cc3f133314d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::content_decode::count_content_operators (cognitive 28): pdf_inspector::extractor::content_decode::count_content_operators has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 5, loops 2 (4 pts), 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":"src/extractor/content_decode.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d84e6d59f3834f176dfa6f5da08ea348c288be3b83013a2d4a8b9a50431f38"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::validate_and_build_columns (cognitive 28): pdf_inspector::extractor::layout::validate_and_build_columns has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd27f4e41e8c8704b3481b166268907921d07706b8421f97840075568398caa"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::page_box::find_inherited_box (cognitive 28): pdf_inspector::extractor::page_box::find_inherited_box has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 4 (13 pts), loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/page_box.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c83724c4bf08842a5cabd8f7f400b4a91240778f746461dfe4f13394defa20"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::rect_cluster_spans_band_boundary (cognitive 28): pdf_inspector::markdown::rect_cluster_spans_band_boundary has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 8, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f2ab0eeb8ec845ec5c358e68fa29dac74fb8fbbada052e945746d5f3e4b11c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::key_value_rows_look_like_prose (cognitive 28): pdf_inspector::tables::key_value_rows_look_like_prose has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 8, 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":"src/tables/mod.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a679d7400fae640d629fcf577728d88ae160ac98a15a12b7323bbd835d3245"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::propagate_merged_cells (cognitive 28): pdf_inspector::tables::detect_rects::propagate_merged_cells has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (9 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":"src/tables/detect_rects.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2541831227990651f6b9d595b58758238d19d27f5ef03dc11083a60a01947be"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::bin::detect_pdf::run_detect_only (cognitive 27): pdf_inspector::bin::detect_pdf::run_detect_only has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 2 (5 pts), loops 1 (4 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/detect_pdf.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"c107ff3e56e44f44940bf6ea89b961b02be5d767af9720fdaaa91bbe4eeac579"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::blank_glyph_codes (cognitive 27): pdf_inspector::extractor::fonts::blank_glyph_codes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3 (4 pts), boolean chains 3, 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":"src/extractor/fonts.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"0608ff6c84b6e767f0e7bfbbde8459badf140e0eeceed0948c0f3900892b9026"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::postprocess::dehyphenate_line_breaks (cognitive 27): pdf_inspector::markdown::postprocess::dehyphenate_line_breaks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (6 pts), match/switch 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":"src/markdown/postprocess.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"161699d1718520c20fb5e80a7f47fefea73eb70e5ad3352b3bdb3ee3969d091e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::preprocess::effective_heading_level (cognitive 27): pdf_inspector::markdown::preprocess::effective_heading_level has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 1 (6 pts), loops 1 (3 pts) (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":"src/markdown/preprocess.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"92addc51075ec92b5bd4fd1a147c1c3c79292f5cb7d8fcf7d5250a5147e44455"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::group_into_lines_with_thresholds_and_regions_impl (cognitive 26): pdf_inspector::extractor::layout::group_into_lines_with_thresholds_and_regions_impl has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee482f855c5f129b5bf6d747a452ed910db4a3d08398fda69a7d05aaab13976"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::normalize_key_value_rows (cognitive 26): pdf_inspector::tables::normalize_key_value_rows has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), boolean chains 5, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed7f60247fabe7426d4234016a6b1bf20e9bc6acf42ffde8ddb8cd935ee1d73"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::underlined_table_columns (cognitive 26): pdf_inspector::tables::detect_heuristic::underlined_table_columns has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 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":"src/tables/detect_heuristic.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b0476d7b5ed1b031c1a03cf5727347e06a12d6938930141e78c26afae86b9b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::try_expand_multi_row_cells (cognitive 25): pdf_inspector::try_expand_multi_row_cells has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 8 (11 pts), boolean chains 1 (nesting depth added 10). 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":"src/lib.rs"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc41c8a030cfcc724c221b8a2f52bbc4c5842fb06182af82bd9bcae47b3ef41"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::bin::dump_ops::main (cognitive 25): pdf_inspector::bin::dump_ops::main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (20 pts), loops 2 (4 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":"src/bin/dump_ops.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c118b6e24199144ea3197c2e1d7999f8152cbf2879d00fe67fd384a50bb8d1ae"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::split_side_by_side (cognitive 25): pdf_inspector::markdown::split_side_by_side has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"087dbfcc317078de8770aaa3db1876aa46c73911652e5487565f1a23c3faac8b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_lines::build_dense_row_anchor_table (cognitive 25): pdf_inspector::tables::detect_lines::build_dense_row_anchor_table has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"960255041def7d3980f00017fd82ceb9112eed8796ee0b80dd8dbd26f7e1763b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::merge_overlapping_hints (cognitive 25): pdf_inspector::tables::detect_rects::merge_overlapping_hints has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (6 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":"src/tables/detect_rects.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba4e16f8f2699a63cdf00d3ccc7050c4364cbaf60e55f61dee193a5ddf08392"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::structured::derive_axis_bands (cognitive 25): pdf_inspector::tables::structured::derive_axis_bands has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4, match/switch 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/structured.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ca18026a753ff8d8e50aea5b4f7750ddad3912723158e63864398287944254"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detect_tsr_quality_issue (cognitive 24): pdf_inspector::detect_tsr_quality_issue has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de66904efc91b06d6e500b692aa8d53524cd74badcb6ca02aab21f3eccc937f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::bidi::bracket_pairs (cognitive 24): pdf_inspector::bidi::bracket_pairs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 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":"src/bidi.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae381026906464c7b8441261d1a00b2ebc8cf4711aa68e3baee879f51ff0b806"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::scan_xobjects_in_resources (cognitive 24): pdf_inspector::detector::scan_xobjects_in_resources has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 3 (8 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"32b583db9dabd971c425614bfecba52b62617db6124a2ae16b623417ef374a1a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::columns_have_prose (cognitive 24): pdf_inspector::extractor::layout::columns_have_prose has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, 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":"src/extractor/layout.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4b16e6eeb46ef6072212bc3cbc53c18e8954d0accd6723165dad2f5f4dc698"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::identify_spanning_lines (cognitive 24): pdf_inspector::extractor::layout::identify_spanning_lines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (5 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":"src/extractor/layout.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f9e01254e47179c101a3c429761a72333d0e3e8baf03100c4da86589a377c8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::redline_edit_regions (cognitive 24): pdf_inspector::tables::detect_heuristic::redline_edit_regions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (11 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":"src/tables/detect_heuristic.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1012215edb95a57165f7c324d179a814d05781a0da17376aea2874c3d57ec6e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::detect_row_stripe_table (cognitive 24): pdf_inspector::tables::detect_rects::detect_row_stripe_table has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 3, loops 3, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"db098a2dc285132d78c21557d9db5feba3c0402d0d02a5b53318466fb728dca5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::text_quality::is_garbage_text (cognitive 24): pdf_inspector::text_quality::is_garbage_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/text_quality.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cd3f46e2ba1f45c0a70c7f34248821c3ccbd5e60507f4304931df8b667c4d3"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tounicode::parse_cidchar_section (cognitive 24): pdf_inspector::tounicode::parse_cidchar_section has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (9 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":2844}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d5202a545ff1703b893b8b6699547bdbc7fed414546242d7612b776e7592bc"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::vision::pipeline::remove_duplicate_table_lines (cognitive 24): pdf_inspector::vision::pipeline::remove_duplicate_table_lines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (19 pts), boolean chains 3, loops 2 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/pipeline.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25d26d86f80c5162a62bb4aceb62b124ae406f3b4fab6b0fcac86f20d3ce26b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf-inspector.parseArgs (cognitive 24): pdf-inspector.parseArgs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"napi/bin/pdf-inspector.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ed99db740643a3923413de1f16bab5f21ac2bfe20630840a413597e92adf08"}},{"ruleId":"D2","level":"warning","message":{"text":"CipherGarbleStats::add_text (cognitive 23): CipherGarbleStats::add_text has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/text_quality.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72fb565a4a20f75aac9efede81881feec68d8d1647bb855a22a81d81d8379ce"}},{"ruleId":"D2","level":"warning","message":{"text":"ToUnicodeCMap::parse_bfchar_section (cognitive 23): ToUnicodeCMap::parse_bfchar_section has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 5 (9 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f4ce309ac0e78843ddba1db7e8a2b3c45644abb7dd1b37425c5786db9218fc"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::bin::detect_pdf::run_analyze (cognitive 23): pdf_inspector::bin::detect_pdf::run_analyze has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 1 (4 pts), match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/detect_pdf.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f6af9181a7b625d5edc80302e62c0a269df22d974da926ca8591e8844cacd5"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::build_font_encodings (cognitive 23): pdf_inspector::extractor::fonts::build_font_encodings 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":"src/extractor/fonts.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"87665a9574fa0dcbe0647c2e87f5cc389fb32b240dca6cd453eb94e027bd10ff"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::geometry::run_geometry (cognitive 23): pdf_inspector::extractor::geometry::run_geometry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 1, 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":"src/extractor/geometry.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dc02ed3ab742c2e4bfe9b14693bbd735bed5ee033ea2c906c9a7f8455c3a6b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::structure_tree::fix_bare_struct_names (cognitive 23): pdf_inspector::structure_tree::fix_bare_struct_names has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structure_tree.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a51151b4cc8710fb02416063aa9d03a201e49a1a88478841fe6a6b1c64e0be"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::grid::merge_numeric_adjacent_clusters (cognitive 23): pdf_inspector::tables::grid::merge_numeric_adjacent_clusters has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (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":"src/tables/grid.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ab99c98be93408aeb34dfe228b67eaa3eff6abd0218cb82b70844beb8432ac"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::vision::image_analysis::region_has_document_like_ink (cognitive 23): pdf_inspector::vision::image_analysis::region_has_document_like_ink has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/image_analysis.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b641ccc352290a5a233dffe7fb7e93a2edcd1b75c26e97c4bdf3553b0f818706"}},{"ruleId":"D2","level":"warning","message":{"text":"TextPaint::observe (cognitive 22): TextPaint::observe has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (5 pts), boolean chains 3, 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":"src/extractor/text_paint.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9757affd632eb17a2b6238efbe8a11b87a6d6ec10324938d4c502c7c3bdeee42"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extract_tables_with_structure_auto_mem (cognitive 22): pdf_inspector::extract_tables_with_structure_auto_mem has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 3 (7 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":"src/lib.rs"},"region":{"startLine":3755}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3431e42d35f684db2373c8c2f7deaed7822cb6b40234dfab1278cbbe2f3530"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::layout::mark_repeated_folio_candidates (cognitive 22): pdf_inspector::extractor::layout::mark_repeated_folio_candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"781862b74d0e651324f39b425dc1e6894b77b59eec27b947497b6d7eefdc82c7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::underline::rules_from_graphics (cognitive 22): pdf_inspector::extractor::underline::rules_from_graphics 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":"src/extractor/underline.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6c0939df5912623c1f00f0c9dfda428380cb69fb24b9918cd3c9b7404ecd4e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::analysis::compute_heading_tiers (cognitive 22): pdf_inspector::markdown::analysis::compute_heading_tiers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/analysis.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53c355500385dd37309272a71f2d43d7d95ebce459403fb2180aa39d7365a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::preprocess::merge_heading_lines (cognitive 22): pdf_inspector::markdown::preprocess::merge_heading_lines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/preprocess.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70dc4c12b248974e0445baf7fdf3627fa3899137e5c3fdb703a6375f288153f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::grid::recover_header_row (cognitive 22): pdf_inspector::tables::grid::recover_header_row has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, 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":"src/tables/grid.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1a7d1e95f30f4a24ed4dd94abfadc041429434375d11a5c20c726bc143a7d1"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::text_score (cognitive 21): pdf_inspector::extractor::fonts::text_score has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c81dce1aa4c6162047fce6e4ebb139fb211d517b9ac92ad702a23bd1e39feeb"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::scripts::apply_script_runs (cognitive 21): pdf_inspector::extractor::scripts::apply_script_runs has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (7 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/scripts.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c5333d90ba75b3e737ecad3901777c089e947508477bc9d37679a443499a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::convert::merge_wrapped_bold_heading_groups (cognitive 21): pdf_inspector::markdown::convert::merge_wrapped_bold_heading_groups has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (9 pts), boolean chains 7, if/else 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae12ecd41e647a5099b5cb1e7eaab982bd58725008357c2f52ba2ff440a0614"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::overlong_numerals::overlong_numerals (cognitive 21): pdf_inspector::overlong_numerals::overlong_numerals has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overlong_numerals.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cc217c04a0c518c9d75284d221c666ff1d12cd8ce6c58b0e206e6b9193170a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::text_utils::fix_letterspaced_items (cognitive 21): pdf_inspector::text_utils::fix_letterspaced_items has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 2 (nesting depth added 6). Of this number, 18 points are the body\u0027s own statements and 3 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":"src/text_utils.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbec1a5093729dd42b026c0bc21ed64f8b7d8552c61e421648707e3c000a122"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::identity_h_font_has_fallback (cognitive 20): pdf_inspector::detector::identity_h_font_has_fallback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 6 (8 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":"src/detector.rs"},"region":{"startLine":1475}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adbcc53f3457c5e2522fee8460c30a8b9c943a0dde33ab80766648cb402efbc"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::fonts::build_type3_scales (cognitive 20): pdf_inspector::extractor::fonts::build_type3_scales has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac608c0b6cc589ee6211f9f821d2b52bd5cfc72caa82833f9dfb33c2893e995"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::to_markdown (cognitive 20): pdf_inspector::markdown::to_markdown has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eb2d966c3f5b8d7cf5eb076d36da41111e3c24f779fd8355e7a1b862f74e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::analysis::detect_header_level (cognitive 20): pdf_inspector::markdown::analysis::detect_header_level has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/analysis.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3b22ef67fb5a155bac298a3f6598aea2e3e561455dbad8ae182ddc1bc49b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::cell_text::join_cell_items (cognitive 20): pdf_inspector::tables::cell_text::join_cell_items has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/cell_text.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a275a440b2fe29ed3ec1bffe2eac7c0931a429b9262898ea2ed82cc7aed4c41"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::assign_items_to_grid (cognitive 20): pdf_inspector::tables::detect_rects::assign_items_to_grid has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e485340468318e20f46f07162792974146d1ef2b571c85fe0ed06ad3306b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::is_repeated_cell_grid (cognitive 20): pdf_inspector::tables::detect_rects::is_repeated_cell_grid has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, 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":"src/tables/detect_rects.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e12a6ea2bac787c35a36d838bdf9cba71be237d3ad528e67c5ce27e19dbb69"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::text_utils::is_explicit_page_number_expression (cognitive 20): pdf_inspector::text_utils::is_explicit_page_number_expression has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, match/switch 2 (3 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":"src/text_utils.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f74697f6e620770334848d268ef3f902657790e4c9b239354963f05e1f3a64d"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::xref_repair::skip_pdf_object (cognitive 20): pdf_inspector::xref_repair::skip_pdf_object has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xref_repair.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"509ae1b034c55f0865cc67a7e2cdf4b21dce4c2da0fe06b601a42684154618b0"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::prose_grid_fragment_needs_ocr (cognitive 19): pdf_inspector::prose_grid_fragment_needs_ocr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":5485}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccfc9b400b167ce4b47bb9fc8016448464cbc96e7374fd2a8ace449ae11a475"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::content_mask::show_operand_text_bytes (cognitive 19): pdf_inspector::detector::content_mask::show_operand_text_bytes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_mask.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"451a9a1c82408d62497f82af42f1fb3510aac1d8be3cfe4a7dc6e86d48721997"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::reading_order::paired_column_images (cognitive 19): pdf_inspector::extractor::reading_order::paired_column_images has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 11, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/reading_order.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52b2afc495b5c7ae1fbbf11f849e5840ee12e5527dc65f9004bf53aa9a57c54"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::underline::mark_underlined_items (cognitive 19): pdf_inspector::extractor::underline::mark_underlined_items has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/underline.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcfa6325387120860ad4fdbed083791dc9cfde3c310faa43243c6b37a05451b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::links::extract_form_fields (cognitive 18): pdf_inspector::extractor::links::extract_form_fields has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 3 (5 pts), loops 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":"src/extractor/links.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe8ddbe3da608f0dc533653a2ba177e3308b64af8d1c50edba9c6daf4d9baa6"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::classify::is_caption_line (cognitive 18): pdf_inspector::markdown::classify::is_caption_line has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/classify.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cdcc4830caecf9d399deb52d40a27aafeba2488f863d9643b5ad08f44b9b72"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::convert::find_wrapped_bold_paragraph_lines (cognitive 18): pdf_inspector::markdown::convert::find_wrapped_bold_paragraph_lines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16c44dd2a173c7bc0dc5353c7fda4368f6732aec50c0dc38ea683809bbd3aae"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::infer_key_value_split_x (cognitive 18): pdf_inspector::tables::infer_key_value_split_x has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"31162e50ed95736ab23642503124e4ea08a5fac5f268bb256191f4f72cb78103"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::has_table_like_content (cognitive 18): pdf_inspector::tables::detect_heuristic::has_table_like_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb53a34395acaa5c391072c886d818865d57eb14fc5963dc85c941e2439a969e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::union_bucket_pairs (cognitive 18): pdf_inspector::tables::detect_rects::union_bucket_pairs 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":"src/tables/detect_rects.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"4663e56d281027a60048cdb5d27f2c6e87a73818b239d06d2aaee8fb0899a1cb"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::format::is_footnote_row (cognitive 18): pdf_inspector::tables::format::is_footnote_row has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/format.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad05d0a52e07d075b27b2997daf28ed0d9dfe478f50523be9764eacdded47ede"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::split_item_into_token_subitems (cognitive 17): pdf_inspector::split_item_into_token_subitems has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5b59fe72d406d8ee2e9aa7dda3141590870d4c6b09eec6e2d6fbf5f851e45c"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detect_file_type_hint (cognitive 17): pdf_inspector::detect_file_type_hint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (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":"src/lib.rs"},"region":{"startLine":6935}}}],"partialFingerprints":{"codehealthFindingId/v1":"859f7bc879b0530f7fbe87827884a00a282fdb2bc51d8543359132f0a31db742"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::bin::pdf2md::parse_page_spec (cognitive 17): pdf_inspector::bin::pdf2md::parse_page_spec has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (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":"src/bin/pdf2md.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d988cc76bf7f996a1291a592cece5cac9f74959c7d84b47b540e32f06dcf110b"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::bin::pdf2md::positional_args (cognitive 17): pdf_inspector::bin::pdf2md::positional_args has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/pdf2md.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"9611abdbb37b08c15f1f0e985f9f779314b73578dfb9784262fa97740efa36ec"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::underline::has_flanking_verticals (cognitive 17): pdf_inspector::extractor::underline::has_flanking_verticals has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11, boolean chains 6. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/underline.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b85c70c81c62d065aeef7be373913bbcec091fe030e773b4043cf253a65e39a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::xobjects::get_form_fonts (cognitive 17): pdf_inspector::extractor::xobjects::get_form_fonts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/xobjects.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea480729025962e056673fc4740c07c350eb977960f065d65aa5a822c6ee7a0"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::postprocess::remove_page_numbers (cognitive 17): pdf_inspector::markdown::postprocess::remove_page_numbers has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 2 (5 pts), loops 1 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/postprocess.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9fbbd5a4ce490b644bf5c945c428fc5ae1bac4811814106461f7299d19e948"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::try_add_label_column (cognitive 17): pdf_inspector::tables::detect_heuristic::try_add_label_column has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (6 pts), loops 4 (6 pts), boolean chains 5 (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":"src/tables/detect_heuristic.rs"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e10606dc54d3d554c5c220810acf77546b8bfb87eb0c90da905afe180fe3852"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::union_rect_against_bands (cognitive 17): pdf_inspector::tables::detect_rects::union_rect_against_bands has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6212a99552bd19107a27bc9b5084834b8aa1042c6f6e61bf5950ac34af03f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_struct::infer_column_positions (cognitive 17): pdf_inspector::tables::detect_struct::infer_column_positions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_struct.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf55d76e537733d7ab0503647bfe6763bc1d7e415e6e546a065e7e6134fae28a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tounicode::try_remap_subset_cmap (cognitive 17): pdf_inspector::tounicode::try_remap_subset_cmap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 4, boolean chains 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb2ba97ca063b3f534eb2d921b671723dbfb2fc28292273a336a843fd2c48e6"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::vision::fusion::merge_native_and_ocr (cognitive 17): pdf_inspector::vision::fusion::merge_native_and_ocr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/fusion.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae29ebcda219bbaedef791638bb787b7a10d1e7bcab422078903786a8c9f4aba"}},{"ruleId":"D2","level":"warning","message":{"text":"PaintResources::add (cognitive 16): PaintResources::add has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 2 (6 pts), if/else 3 (5 pts), loops 2 (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":"src/extractor/text_paint.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8191b288f3377e183c77e6902a84e95171ab615ec7783369e3e8c6e71f0879d9"}},{"ruleId":"D2","level":"warning","message":{"text":"OarOcrEngine::recognize_page (cognitive 16): OarOcrEngine::recognize_page has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/oar.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fc19e13faa3dd86552254c31e5d1f0736abd02a94a5914b0e5813cee23a2da"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::build_tsr_row_expansion (cognitive 16): pdf_inspector::build_tsr_row_expansion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, 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":"src/lib.rs"},"region":{"startLine":3390}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeace680f9dd0e797bf648255c8a04bd6991a4c59c10d00a60d0a59f09a1c2e0"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::analyze_page_content (cognitive 16): pdf_inspector::detector::analyze_page_content has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, loops 1 (2 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":"src/detector.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de3f7b1e18c04b2052253c21be4419c11bb16912556dc528cda39626c2b1862"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::detector::extract_font_name_before_tf (cognitive 16): pdf_inspector::detector::extract_font_name_before_tf has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (5 pts), loops 4 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"b779c16dc05c9e19f278ef10679ec8c35fa4df0fa633b52b5c96ee5a406131ee"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::extractor::word_gaps::word_gap_candidate (cognitive 16): pdf_inspector::extractor::word_gaps::word_gap_candidate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/word_gaps.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f4846a88d887eec664020f5bbaeef0667f3f6efa817eb537fcfdac548bc547"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::form_bbox_repair::is_form_with_degenerate_bbox (cognitive 16): pdf_inspector::form_bbox_repair::is_form_with_degenerate_bbox has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (9 pts), if/else 5, boolean chains 1, loops 1 (nesting depth added 3). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/form_bbox_repair.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc513c42526fc73d6466a3b99709ea02757edfbe94c471e04d2835ddd0e8895"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::markdown::classify::is_list_item (cognitive 16): pdf_inspector::markdown::classify::is_list_item has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/classify.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc793bac51dfb3b0b8e7a81aa123f4c304ace32255f06da6710014003b911eca"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::looks_like_table_data (cognitive 16): pdf_inspector::tables::detect_heuristic::looks_like_table_data has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. 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":"src/tables/detect_heuristic.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e0c44e29f992218a3545371eacc349215bf6c2b97a11daa90e2c7cf873bd7f"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_heuristic::is_paragraph_content (cognitive 16): pdf_inspector::tables::detect_heuristic::is_paragraph_content has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":2276}}}],"partialFingerprints":{"codehealthFindingId/v1":"92782a210ca73b594c984c6af79e30ad72238a3f50230103961fa26e3d0a52b0"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_lines::detect_text_anchor_rule_tables (cognitive 16): pdf_inspector::tables::detect_lines::detect_text_anchor_rule_tables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb74368919102f3d46b366040b089b32a45521f7165f2413468a1008c7fe1e93"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tables::detect_rects::row_stripe_is_sparse_prose_outline (cognitive 16): pdf_inspector::tables::detect_rects::row_stripe_is_sparse_prose_outline has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, loops 2 (3 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":"src/tables/detect_rects.rs"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d153bde52055c2a8613241b099c595001a66f141b9f5495a669079b88327e60"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::tounicode::find_usecmap_name (cognitive 16): pdf_inspector::tounicode::find_usecmap_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (11 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":"src/tounicode.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e323344d5021519ba57896bd7877174b1ab8209850484887ecd317bf78992f3"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_inspector::vision::models::validate_manifest (cognitive 16): pdf_inspector::vision::models::validate_manifest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, loops 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":"src/vision/models.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c6f78011bd731ce100742c67833ee44120f92c3df4dbf9565efe7775dde178"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::content_stream::extract_page_text_items_with_options: FunctionTooLong \u2014 pdf_inspector::extractor::content_stream::extract_page_text_items_with_options runs 1578 significant 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 1478 over it, 15.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb2b1fad2fe8f06fb356d387bed93db5c83006bbf9b56673edded601b9cd7ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::xobjects::extract_form_xobject_text_inner: FunctionTooLong \u2014 pdf_inspector::extractor::xobjects::extract_form_xobject_text_inner runs 851 significant 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 751 over it, 8.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/xobjects.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"605efbb974152fd92142d682a0dbdd4a68115c8071725105b1c36f4bfcaa4502"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 3422 significant 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 128 free functions. The bar is 500 significant lines; this is 2922 over it, 6.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a1dad5908b747bfb241f824bad89a171d16266749f9b9389507378dc4db8a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/detect_rects.rs: FileTooLong \u2014 2230 significant 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 1730 over it, 4.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff12cf700a452caefd19ec820ab3517319311c932d4283e26d68cf2da1f96c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tounicode.rs: FileTooLong \u2014 2165 significant 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 1665 over it, 4.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":"src/tounicode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6abf5e063f1e2bd2d971d20651874229dc24ddc6b432a453d74bd4e62aaff2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractor/fonts.rs: FileTooLong \u2014 2003 significant 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 1503 over it, 4.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":"src/extractor/fonts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"016b2b04ba2765f4832c29e59f7e3a240b1d27d8de68e75822e24841db21dbdf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractor/content_stream.rs: FileTooLong \u2014 1886 significant 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 1386 over it, 3.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfb31216adb6ed2fc8f01ebfc92baaa70b4e648959e8b4f37b6faef700890e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::markdown::convert::to_markdown_from_lines_with_tables_and_images: FunctionTooLong \u2014 pdf_inspector::markdown::convert::to_markdown_from_lines_with_tables_and_images runs 376 significant 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 276 over it, 3.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cceda92a4631d2e995a37f92e3c118d4f127416427648460e52072d3c24176e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractor/layout.rs: FileTooLong \u2014 1849 significant 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 1349 over it, 3.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef95b846062a6b7edd14edf0ad9467df8171cffcc85ca6ea01fc1d986a4e1331"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::bin::pdf2md::main: FunctionTooLong \u2014 pdf_inspector::bin::pdf2md::main runs 316 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 216 over it, 3.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/pdf2md.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8f34b93acb598fc6d6179bb012fc29ff1fccc3ad4df8e56f94314a1d2e0d60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/detect_heuristic.rs: FileTooLong \u2014 1577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 1077 over it, 3.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00af7372c3b32a8ee4a3217ccebaa5216abe69d0bc7f2ba45a3f50d7defe7190"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::process_document: FunctionTooLong \u2014 pdf_inspector::process_document runs 313 significant 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 213 over it, 3.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":4578}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f9846eb5c34de299c4b88f8026ff8cfa118517a7007343201644186d31a439"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::fonts::extract_text_from_operand: FunctionTooLong \u2014 pdf_inspector::extractor::fonts::extract_text_from_operand runs 302 significant 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 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eeb90838c0680dae210d613a372fa8c259d7557433cba4e3b92235950c58e04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_rects::detect_row_stripe_table_from_cell_rects: FunctionTooLong \u2014 pdf_inspector::tables::detect_rects::detect_row_stripe_table_from_cell_rects runs 302 significant 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 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":2689}}}],"partialFingerprints":{"codehealthFindingId/v1":"565484cfd9fac6e630362c7d7049980450a109bcbcd581405442c9f003b1fd84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_rects::detect_tables_from_rects: FunctionTooLong \u2014 pdf_inspector::tables::detect_rects::detect_tables_from_rects runs 300 significant 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 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":"src/tables/detect_rects.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"f709380c747ff3567835c842fa4f6670a74016f99d9dee800e6f20c5b51d8810"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/detect_lines.rs: FileTooLong \u2014 1493 significant 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 993 over it, 2.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f493c9c56c01edff4f551a89709c01255b794604df8bef63aad2ce19b34792"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::merge_text_items_with_clips: FunctionTooLong \u2014 pdf_inspector::extractor::merge_text_items_with_clips runs 283 significant 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 183 over it, 2.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":"src/extractor/mod.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f33524d6f92ad6c83671b92a59c2dcd94a129146bd334ee67ac55efcbc93eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractor/mod.rs: FileTooLong \u2014 1381 significant 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 59 free functions. The bar is 500 significant lines; this is 881 over it, 2.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0435f9b5faddc749a47da25060b18c9cb2326bba600fd1ceabfe789d5807aa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/detector.rs: FileTooLong \u2014 1265 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 765 over it, 2.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59e0fa31de3d0449a4065b7637f9fa2357ab25ceef1dca5630f9c643e7dd553"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_lines::detect_tables_from_lines_inner: FunctionTooLong \u2014 pdf_inspector::tables::detect_lines::detect_tables_from_lines_inner runs 242 significant 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 142 over it, 2.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"1557e48a266a7842b3cd73ff851e6782062a74c4ac1c58502206ebe59b754f1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::detector::detect_from_document: FunctionTooLong \u2014 pdf_inspector::detector::detect_from_document runs 231 significant 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 131 over it, 2.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d2255f1bdd3007d2d50a2bc5d606a2aa9c17a5a13d0cc934fef156ba467b57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FontCMaps.collect_cmaps_from_fonts_inner: MethodTooLong \u2014 collect_cmaps_from_fonts_inner runs 222 significant 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 122 over it, 2.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":"src/tounicode.rs"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"09947fa7e7aabb299b2016362a03b28ef3009236e89f07011f9c6ad333bb4e5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_heuristic::detect_contents_list: FunctionTooLong \u2014 pdf_inspector::tables::detect_heuristic::detect_contents_list runs 219 significant 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 119 over it, 2.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"0465799d2a9a39e4c3dd7fae31be4b561eb43851633c207ba0350c229bfd40b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: markdown/convert.rs: FileTooLong \u2014 1065 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 565 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e67ba7ce29a57d008890dfb9b19dc4a571b761113dbffb803ff6bc8fae25e63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extractor/xobjects.rs: FileTooLong \u2014 1064 significant 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 564 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":"src/extractor/xobjects.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b442cd32e2cb788ec3b772db7a933089d421defac6d59b28c1747eb341d199f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::detector::content_scan::scan_masked_content: FunctionTooLong \u2014 pdf_inspector::detector::content_scan::scan_masked_content runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_scan.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"1737f1dfaaf5a5d4678ebb249aa4a9a9e7b56e4015e78ba6ed01a85d5c802372"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::vision::pipeline::process_pdf_with_ocr_mem: FunctionTooLong \u2014 pdf_inspector::vision::pipeline::process_pdf_with_ocr_mem runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/pipeline.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0606ae0e3fb9953387aa3542f3b116c7f7ab842c17ae3f85abd84495f5d9a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tables/mod.rs: FileTooLong \u2014 1050 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 550 over it, 2.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbbe161cae9a64eca183920686a84c7f4e28d41f97f87f61b58bcb4f53f8ecb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::layout::page_number_context_masks: FunctionTooLong \u2014 pdf_inspector::extractor::layout::page_number_context_masks runs 205 significant 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 105 over it, 2.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":"src/extractor/layout.rs"},"region":{"startLine":1490}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbe495da92ce76e3fb0cd9cff6653168526b23e2b1ae2c5db9883c08c582db4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::try_build_table_from_columns: FunctionTooLong \u2014 pdf_inspector::tables::try_build_table_from_columns runs 198 significant 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 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"94faf95ce04f4b23c70743fb093e26d8e419a3ef714a32b83f2bb8c636002243"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extract_tables_in_regions_mem_with_options: FunctionTooLong \u2014 pdf_inspector::extract_tables_in_regions_mem_with_options 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":"src/lib.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"230b85bdaaacfc44b79df2ead3b5394a456b123a00f0ceff052297ba943f5dbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_lines::detect_dense_line_chart_regions: FunctionTooLong \u2014 pdf_inspector::tables::detect_lines::detect_dense_line_chart_regions runs 190 significant 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 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":"src/tables/detect_lines.rs"},"region":{"startLine":1454}}}],"partialFingerprints":{"codehealthFindingId/v1":"250a28c0614b902220e3bf1340a17392d5a9936f8f3312fa3c75b2b9f9557abe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::markdown::convert::to_markdown_from_lines: FunctionTooLong \u2014 pdf_inspector::markdown::convert::to_markdown_from_lines runs 182 significant 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 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5be385fca90cd25892ebb7c1bb11a71fd0200176d52796229cb5ed7954df72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extract_pages_markdown_mem_impl: FunctionTooLong \u2014 pdf_inspector::extract_pages_markdown_mem_impl runs 177 significant 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 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bedeafaba357b5b648044a4e24232a4153a2a3f18ed33c3b3edcfb264ff114b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::try_build_key_value_table_from_rows: FunctionTooLong \u2014 pdf_inspector::tables::try_build_key_value_table_from_rows runs 176 significant 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 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d99d78415b081f14eddeaefb1a65e4f7f10f2da26aed239176560b7f256d061"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/python.rs: FileTooLong \u2014 877 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 377 over it, 1.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e4ccfcdd0a9aa5730fa11d198c61e63351b9198c2bb6751be5daf3746be32f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::extract_positioned_text_impl: FunctionTooLong \u2014 pdf_inspector::extractor::extract_positioned_text_impl runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba227fdd5b139fafb7fecf9e559287fe02132c93e2b94349360444e9fdb94b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 831 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 331 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":"napi/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f46b1c09b159ab2ee265cc3503db07283268091dd9dc2c79dc69cb0cc2ce6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::markdown::furniture::strip_repeated_lines: FunctionTooLong \u2014 pdf_inspector::markdown::furniture::strip_repeated_lines runs 164 significant 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 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/furniture.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c73536b15477cc4e837075bc1b81a8fe992b28af7fc3af74e3431748c847b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::layout::detect_columns: FunctionTooLong \u2014 pdf_inspector::extractor::layout::detect_columns runs 163 significant 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 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7764158560500b5bd122d4df189274597622d76c849e6dae909924c7c477dc05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_rects::detect_stacked_box_table: FunctionTooLong \u2014 pdf_inspector::tables::detect_rects::detect_stacked_box_table runs 163 significant 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 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a9b139780509eb8f7ac1a2be23cfeac7e4c5f2178603ba71b8baa42c41e936"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_lines::build_text_anchor_table: FunctionTooLong \u2014 pdf_inspector::tables::detect_lines::build_text_anchor_table runs 159 significant 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 59 over it, 1.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":"src/tables/detect_lines.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74c6d6ee935404a8d3f01ef41eea789248d52e46d34b671058dba26f8c7d7a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_rects::detect_row_stripe_table: FunctionTooLong \u2014 pdf_inspector::tables::detect_rects::detect_row_stripe_table runs 159 significant 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 59 over it, 1.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":"src/tables/detect_rects.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"e101cc2c073f929d060e2737e0f8d42eab36f8463a6ac7c090827aa3db5d0b01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_heuristic::detect_table_in_region: FunctionTooLong \u2014 pdf_inspector::tables::detect_heuristic::detect_table_in_region 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":"src/tables/detect_heuristic.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b053ac35e3ac560edea0a8d4f93be461e4f852b7c267c582f3a9783b6b4001a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: detector/content_scan.rs: FileTooLong \u2014 760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 260 over it, 1.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":"src/detector/content_scan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2980b704bb0fab4277db06d7c2520d38efb02716fb6afc28db1798c1f4d954ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/structure_tree.rs: FileTooLong \u2014 747 significant 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 247 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structure_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfad940599e1c219acacbb1f74db570e65049d96fdaff95df7a17c1119bcc9df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vision/pipeline.rs: FileTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 243 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a53fc9b66aa18444aa2aa5dd9bcbac182be470b4c5d5e16a7f94dee00b14524"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_heuristic::detect_tables_with_page_width: FunctionTooLong \u2014 pdf_inspector::tables::detect_heuristic::detect_tables_with_page_width runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb55bee7e21dd69f8f056dae7bebe79446d011516bd13bfc5d4577f7fb0f86c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_rects::try_build_grid: FunctionTooLong \u2014 pdf_inspector::tables::detect_rects::try_build_grid runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e453d080df8f81c9f3f1c100d1232ac197dd909941cd6460a57e4aafa22e0e90"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vision/fusion.rs: FileTooLong \u2014 719 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 219 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/fusion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff610f3c6d82b49b80066ef43de76283b2eaa76eda9015e2f7d99dd8a9a1b283"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::links::walk_form_fields: FunctionTooLong \u2014 pdf_inspector::extractor::links::walk_form_fields runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/links.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"edce8e1bdacf2534c680291da3cc3cbbd92737987fa6f20b6e83c6d03c067b49"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::markdown::heading::classify_heading_sequences: FunctionTooLong \u2014 pdf_inspector::markdown::heading::classify_heading_sequences runs 138 significant 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 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/heading.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"a671e72f1329dc492d45a93a56e58e48ed947efc48044a47eb0f80e059a7824f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::format::clean_table_cells: FunctionTooLong \u2014 pdf_inspector::tables::format::clean_table_cells runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/format.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fa6532dd9759d9c6453fb2a23629b621f31424b350d8558d9e31e2ea15ff7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/pdf2md.rs: FileTooLong \u2014 678 significant 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 178 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/pdf2md.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a308301f7cc8ef85172af58988d701b287515c895c846c2d3fbab1d90533b3d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/text_utils.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), declaring 37 free functions. 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":"src/text_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d35b3eafadf91d4792f890cd3c1e40b86560f9ac5d375fa5abe915982fe9161"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::detector::decoded_text_counts_within: FunctionTooLong \u2014 pdf_inspector::detector::decoded_text_counts_within runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8741bda865521f8ff01aaa254924fd8cf4d9fc34c77d74a16fc2d46b8317505b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extract_text_in_regions_mem_with_options: FunctionTooLong \u2014 pdf_inspector::extract_text_in_regions_mem_with_options runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cf261ffe7ffcfbaac27dc1339e106808694abbeae388b73993ef76eb928c06"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::layout::order_columns_with_policy: FunctionTooLong \u2014 pdf_inspector::extractor::layout::order_columns_with_policy runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58c42e5f2e0a1818351a756aaf60be1a3b44d975bd96ee41ca35e9309946bdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_rects::detect_merged_cluster_table: FunctionTooLong \u2014 pdf_inspector::tables::detect_rects::detect_merged_cluster_table runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":3286}}}],"partialFingerprints":{"codehealthFindingId/v1":"28532463ddeec88e83c9a23cfea2dfd0bb10786069315e98f26576742a30eddc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_struct::detect_tables_from_struct_tree: FunctionTooLong \u2014 pdf_inspector::tables::detect_struct::detect_tables_from_struct_tree runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_struct.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"520de512443614ab96456a0730c35f57679c595acd0f532a3e71e8106ad0e160"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::layout::validate_and_build_columns: FunctionTooLong \u2014 pdf_inspector::extractor::layout::validate_and_build_columns 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":"src/extractor/layout.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db3b329bb7c845fc2bae669765898e1c9494a2d46519c70ae4fccc1e295bcd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::structure_tree::parse_struct_element_dict: FunctionTooLong \u2014 pdf_inspector::structure_tree::parse_struct_element_dict 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":"src/structure_tree.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"40915d8a3bb1b7f9957a147cb4035c9c13ba380dfe8cc441f767d70ce11dd589"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_lines::build_dense_row_anchor_table: FunctionTooLong \u2014 pdf_inspector::tables::detect_lines::build_dense_row_anchor_table 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":"src/tables/detect_lines.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7bbee0bfba186eb9255dae88adb7c57e40b93a7c511ee90fc44c874d049cde"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::vision::fusion::fuse_ocr_pages_impl: FunctionTooLong \u2014 pdf_inspector::vision::fusion::fuse_ocr_pages_impl 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":"src/vision/fusion.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87584fbf0c117fa3607e5393cb25dc95317e653a1fa04d479b11e8d1deee1da"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extract_tables_with_structure_cells_mem: FunctionTooLong \u2014 pdf_inspector::extract_tables_with_structure_cells_mem runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"c343a07ab23406a53b6f8c99292a5bec8e9e29bea7a5234d79e371c7f1257a22"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ContentScanState: TooManyFields \u2014 36 stored fields beside 33 methods. The bar is 30 stored fields; this is 6 over it, 1.20\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_scan.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac8708006a644cd22cbd46b2ade3d262352180497cda7e59dfc3503b57a76a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::markdown::furniture::strip_edge_furniture: FunctionTooLong \u2014 pdf_inspector::markdown::furniture::strip_edge_furniture runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/furniture.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0cd36e8bca6fe688925e5b669c0c254d67d2992e8856d1b022916a58c72ab2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ContentScanState: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_scan.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cf15855789fa241d17eee2d8be3c5ce03414d20af993a72d475dee4b8623f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::layout::group_into_lines_with_thresholds_and_regions_impl: FunctionTooLong \u2014 pdf_inspector::extractor::layout::group_into_lines_with_thresholds_and_regions_impl 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":"src/extractor/layout.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2860cd742894bd8371e63096dec1fa8f8a0b917b9aee09796fe7800dd57e04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_rects::cluster_rects: FunctionTooLong \u2014 pdf_inspector::tables::detect_rects::cluster_rects 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":"src/tables/detect_rects.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"862d14cb644fd7019165427be1a6e7116635252957b017bfbc40b1102c6c0741"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::bidi::logical_line_order: FunctionTooLong \u2014 pdf_inspector::bidi::logical_line_order runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bidi.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cec5231bf5fc71b6c2d1985b9d5d4026effd6a6a6d21e66e0833e83ea636df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::extractor::reading_order::paired_column_images: FunctionTooLong \u2014 pdf_inspector::extractor::reading_order::paired_column_images runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/reading_order.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5c2a6245c04aaec3b6bbb1ec9f3eb13ddec4b787b59f8d3bbbbe6cfedea0d7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToUnicodeCMap: ClassTooLong \u2014 424 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 2 blocks, lines 26-1612. The bar is 400 significant lines; this is 24 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7668a25aa400abcebc9cf5db025a5602e8007d3ddb9cabf482fea711c31dee4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_heuristic::merge_adjacent_items_preserving: FunctionTooLong \u2014 pdf_inspector::tables::detect_heuristic::merge_adjacent_items_preserving runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe6379d709b3a3bdbaf39dd013ebbfcd662e22df2d1eb7f7d55fd9219a25a17"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_heuristic::is_page_number_toc: FunctionTooLong \u2014 pdf_inspector::tables::detect_heuristic::is_page_number_toc runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1858}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacf66de74c402b454cedf4a1990222fc24aaaf511e32bf750cb61b333311d77"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContentScanState: ClassTooLong \u2014 409 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 2 blocks, lines 288-1007. The bar is 400 significant lines; this is 9 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":"src/detector/content_scan.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"492bad3bc04044e9f8f97d4c7e276375ca0c71e749ff126248798490b3b77ede"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_heuristic::find_table_regions_strict: FunctionTooLong \u2014 pdf_inspector::tables::detect_heuristic::find_table_regions_strict runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bcba84ed0cb681e67dfbaa534feed74a9bab32d3021f15ef48626af0658579"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pdf_inspector::tables::detect_struct::recover_unclaimed_header_row: FunctionTooLong \u2014 pdf_inspector::tables::detect_struct::recover_unclaimed_header_row runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_struct.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1826393f7c4999d68efdcb13d59b572fd4576933f62866cd0520dc247e6f6c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (606 shared lines): src/extractor/content_stream.rs:446-2739 | src/extractor/xobjects.rs:308-1505 \u2014 These two members are variants of one another: 606 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"13704f231a08a0bc932835b8ff8fc04a2b80ae3c22abb6db1ef03d60704219dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (132 shared lines): src/markdown/convert.rs:760-1370 | src/markdown/convert.rs:1439-1719 \u2014 These two members are variants of one another: 132 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d84b60cba9d700c22ca3629719ee91189447bf35f749511825a3170148bef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/tables/detect_lines.rs:211-269 | src/tables/detect_lines.rs:576-674 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddbe8e8b9cf46e70fc020712d892b8558da017058fda5ca85c8bb344e028d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/extractor/layout.rs:350-476 | src/extractor/layout.rs:836-1006 | src/markdown/mod.rs:317-385 | src/vision/oar.rs:652-697 | src/vision/render.rs:384-414 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0623fe382ea510358d435ec59e9a616d329346f1039549c6c07b4b2b4be365"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/markdown/heading.rs:44-56 | src/markdown/heading.rs:65-78 | src/markdown/heading.rs:80-97 | src/markdown/heading.rs:99-119 \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":"src/markdown/heading.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"584e5c6e41ed2a180709df1cbf2290b8bb5c55f984f6b471ffc71b635762d858"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tables/detect_rects.rs:1462-1680 | src/tables/detect_rects.rs:1927-2157 | src/tables/detect_rects.rs:2693-3152 | src/tables/detect_rects.rs:3290-3465 \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":"src/tables/detect_rects.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fbe086224eab1ad2b8f0f7ca5ec074d000ffb1c96a87e4a68ace9df21b2f874"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/tounicode.rs:936-994 | src/tounicode.rs:997-1123 | src/tounicode.rs:2849-2886 | src/tounicode.rs:2893-2956 \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":"src/tounicode.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"3858157e46d3da7d62049f3505135d34781d472c0a393dbc8ab8e5ccea9255c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (83 corresponding lines): src/tounicode.rs:830-933 | src/tounicode.rs:2760-2842 \u2014 These two members are one piece of code written twice and then edited apart: 83 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"9701d1ae09d24bd4f3487041864acefd1db9da1406f3c1337ee06908fdb9d9f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/lib.rs:2562-2591 | src/lib.rs:2597-2626 \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":"src/lib.rs"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"48413b8475a3f182b9a93a67f8c8ec7703ac87ec3af53cdf82b56270618df42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): napi/src/lib.rs:551-594 | src/python.rs:679-722 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"napi/src/lib.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09832f2e594efd0f9a15b85b68c73cab93210ab5d636c6ec39fb29b4c497b9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/vision/pdfium.rs:135-172 | src/vision/pdfium.rs:180-216 \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":"src/vision/pdfium.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ae21c8f5407dc88e5558186093a857b02c940c663a2f083152fe3d81b997c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/lib.rs:5804-5834 | src/lib.rs:5856-5884 \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":"src/lib.rs"},"region":{"startLine":5804}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc72abcebd0b290bb0ba3e0ecd41e939d62857c420f06158d02c23798da8b9ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/extractor/geometry.rs:52-64 | src/extractor/geometry.rs:69-87 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/geometry.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fd38d9e50b3b91e5c2fb4beb638f9ba277d513c974949be01d8dafb46ff48c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/markdown/analysis.rs:32-58 | src/markdown/analysis.rs:61-91 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/analysis.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3089e263255af8d1940943f3d9415a680fa7cac0b36a6da093c6d5cb5fefed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/tounicode.rs:1752-1770 | src/tounicode.rs:1773-1794 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead1901907089506bfdca9e2c009ee557ef0ef304962e38f7e52a9b21b98c927"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): napi/src/lib.rs:453-476 | src/python.rs:579-602 | wasm/src/lib.rs:207-232 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"napi/src/lib.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30ca05fb2ff02db79a95dbdc64c5d14cc454d0a040cd2589cc9d85439b17b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/tounicode.rs:1556-1565 | src/tounicode.rs:1568-1577 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"00924d7e321d0437147c4cb0f567e6c04290ef6d5a805ceade39900b9c5c4134"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/lib.rs:4105-4115 | src/lib.rs:4117-4130 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":4105}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57586f03a4905da865b34d9c6ea687da435259f2215c60eeb201b3ae4225b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/extractor/xobjects.rs:108-130 | src/extractor/xobjects.rs:136-154 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/xobjects.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0ee0bf5b9c19ba5c85b46cbdabe8ecf203a58df7dd25fa57a8661bf4d80d11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): wasm/src/lib.rs:310-318 | wasm/src/lib.rs:322-330 \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":"wasm/src/lib.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c517e51474b3cafa73d0b99c421661cb219eb3158cc12c5838c55c33355af9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): napi/src/lib.rs:1012-1023 | napi/src/lib.rs:1042-1053 \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":"napi/src/lib.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46c8d5cd19a21c67a650a5b4241d4bd39e8fbd407ff7d008143aee5a4d7845a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): napi/src/lib.rs:1342-1362 | src/python.rs:808-826 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"napi/src/lib.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f064922c135e7353a2ff387dabb8a016f45bed5f660158424d2d3be4946c48ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/detector/content_geometry.rs:30-38 | src/extractor/page_box.rs:62-70 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_geometry.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a185e58151a8bd32e27a6db22d20d9824ecfa145f1814dc237916ca12efa6772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/python.rs:904-919 | src/python.rs:949-965 \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":"src/python.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bae2b214ab464c45cce7f7bdd032d27424e299b2cd110306a7c6538239442e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/tables/cell_text.rs:143-154 | src/tables/cell_text.rs:162-175 \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":"src/tables/cell_text.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"24da12fd742853dab165499199b31910b7301aae17f6c49235a75980c7d813f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/extractor/layout.rs:1765-1775 | src/extractor/layout.rs:1784-1793 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad1c6781903d8325b9491541e2f573af8b2c75b93dfb57d31d6b6d083851116"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/lib.rs:4147-4163 | src/tables/detect_lines.rs:676-685 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":4147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff59ced0d08e3fb89ef0047a7d7ef2ff9f8adb82139b965ad4b9468c452b00d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/tables/detect_heuristic.rs:1818-1828 | src/tables/grid.rs:162-172 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1818}}}],"partialFingerprints":{"codehealthFindingId/v1":"68419535fe8e826f364a7f9a3bd0357c61912822cc8ef102482e1fc71a64bf25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/extractor/underline.rs:453-469 | src/extractor/underline.rs:475-485 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/underline.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"714250d2d4a52467032846aea879cbeaeaa1e46ca083feedad67bb34a39569ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): napi/src/lib.rs:1384-1400 | src/python.rs:828-844 \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":"napi/src/lib.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ec7a52f5bd1f59c09f38dcd6095d2bb3c19149b0c4b20b8bdd1fbb4c681d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/lib.rs:270-278 | src/vision/pipeline.rs:98-111 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfddc10ca0fdd28a920b58a4da66b32605537719f6164f7c5e321edbc632b0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/structure_tree.rs:350-358 | src/structure_tree.rs:409-415 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structure_tree.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc232236fcf098671676c1e777ea8fc54ea425969620aa59e78930be07227d2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/structure_tree.rs:365-379 | src/structure_tree.rs:493-504 \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":"src/structure_tree.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae8e52007f43e32940cf6921dfc86bdec4670aa5a97a7dc002b54099596e377"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/xref_repair.rs:257-264 | src/xref_repair.rs:328-335 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/xref_repair.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1f67470ac119075476ca55dc9a4bfa8778b57e5daaf29e58daad94d814f295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): napi/src/lib.rs:772-782 | src/python.rs:1199-1208 \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":"napi/src/lib.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"709c524fd4d19ab40e9e90b26128205d4bcfaf9c7dba223c249713ca03b703d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): napi/src/lib.rs:695-704 | wasm/src/lib.rs:334-344 \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":"napi/src/lib.rs"},"region":{"startLine":695}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c317fd2c371388e8c4e7300ff1759c289fb70f478cebe11cbd8938165912d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/extractor/fonts.rs:1010-1016 | src/tounicode.rs:544-555 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e84ea137bc5590f24985b1e3007350365bf1387127da76a3f6cbf03c826ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): napi/src/lib.rs:678-686 | src/python.rs:865-872 \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":"napi/src/lib.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"374f98ba9e0b8ddf8e7b5c983438846b536af4fcf892fbce70f243c5d711cfd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/tables/cell_text.rs:125-135 | src/tables/mod.rs:1513-1520 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/cell_text.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcf8a169a09743bf8a82d3fc7c042aa1fb1647c97b1994cbb57ddb52529173c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/extractor/fonts.rs:2315-2321 | src/extractor/text_paint.rs:144-149 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f90c9a4f5b8fff301c6e28cfba2a1640be4d789b64d54fb4a4e63cfa3c56b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/adobe_korea1.rs:7-12 | src/bidi_mirroring.rs:15-20 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adobe_korea1.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d201a215c39324bbd7e0c12ce8daaddc8b14c017a5e3604573e473f2dc53fb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/extractor/mod.rs:1477-1486 | src/text_utils.rs:89-101 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57164a89667f46b6bed2c6f4efb99ba54acab948c2603a0464a06afbf5a4dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/detector.rs:205-211 | src/xref_repair.rs:561-567 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ac37928cdf997630735244f610065c855f5f3671afb34012226c1fdef59119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (121\u2013128 lines \u00D7 2): src/extractor/content_stream.rs:1229-1356 | src/extractor/xobjects.rs:1069-1189 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1229\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":"src/extractor/content_stream.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf4646e17b01b76b0ca4efe69b8dcfdd568a2e317f2a5ffe47b1a3fcedf8c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (93\u201394 lines \u00D7 2): src/extractor/content_stream.rs:1473-1566 | src/extractor/xobjects.rs:1250-1342 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1473\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b42409c6e5ae13c5e68aa0d5d1d32c1bd2be5f1853bf3cb447ba942947a3f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68\u201369 lines \u00D7 2): src/extractor/content_stream.rs:1578-1646 | src/extractor/xobjects.rs:1353-1420 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1578\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73981b3e8e01cc574da43eedb05caca121b61acdb8f2b41ebd0d72c13163c4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51\u201357 lines \u00D7 2): src/extractor/content_stream.rs:515-571 | src/extractor/xobjects.rs:395-445 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c349d15ee713d481dc2003e4e5f4b1f52832cfc15e434b9c1a11b22de68ab5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201346 lines \u00D7 2): src/tables/detect_rects.rs:1947-1992 | src/tables/detect_rects.rs:3301-3342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:1947\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb24ecc459685e14c27d1eb077bcdf340e0230ec8a6772eabf0b1006a33ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201345 lines \u00D7 2): src/markdown/convert.rs:1245-1289 | src/markdown/convert.rs:1642-1682 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"addddd34716c826c167940a6500400daef4f15974361fcd800b4b00e2c453cf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2): src/extractor/content_stream.rs:1134-1169 | src/extractor/xobjects.rs:975-1010 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1134\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"097924b26a74f3da6c0411266110003db5275115063c9330c9d5b88b3263def5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201334 lines \u00D7 2): src/extractor/content_stream.rs:1885-1913 | src/extractor/xobjects.rs:906-939 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1885\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":"src/extractor/content_stream.rs"},"region":{"startLine":1885}}}],"partialFingerprints":{"codehealthFindingId/v1":"5693001f103c7cf6212c29c8b57032d99f1b4b0352b3eb6489155cc600db8e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201333 lines \u00D7 4): src/tounicode.rs:938-970 | src/tounicode.rs:998-1030 | src/tounicode.rs:2850-2872 | src/tounicode.rs:2894-2916 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tounicode.rs:938\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":"src/tounicode.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87825702e5ae051874d8ad5186a8842b481447a5ccc97d7b378609258e42d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201333 lines \u00D7 2): src/tables/detect_rects.rs:1994-2026 | src/tables/detect_rects.rs:3344-3370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:1994\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce38b5937fd0f7dbbedd2c63040ece521c6bd8cacd329f438ce99626c81ed883"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201331 lines \u00D7 2): src/markdown/convert.rs:1139-1169 | src/markdown/convert.rs:1587-1611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/convert.rs:1139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc85bb2b76cf622eba30b713836caab610877d4cdb8ac801a0117c436f27ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2): src/extractor/content_stream.rs:864-911 | src/extractor/xobjects.rs:687-734 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"4657da4a0dbae70f4df03e411ae74edfafc78cbdf1d06cfec93c56ca5af1b04a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201329 lines \u00D7 3): src/extractor/content_stream.rs:2355-2356 | src/extractor/content_stream.rs:2373-2401 | src/extractor/content_stream.rs:2407-2435 \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 \u0060src/extractor/content_stream.rs:2355\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":2355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdafb14f3c24904aaf66a954ec211afa28ea0a7e0c33ad35a33d3c92443b805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/extractor/content_stream.rs:1013-1039 | src/extractor/content_stream.rs:1843-1869 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/extractor/content_stream.rs:1040\u0060 calls \u0060unwrap_or\u0060 and \u0060src/extractor/content_stream.rs:1870\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"6946ee20dcb00b5b11e107957eb13b1a4f88e4a8ad6ac5b2d249c3390a3e72be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): src/extractor/content_stream.rs:1143-1168 | src/extractor/content_stream.rs:1962-1987 | src/extractor/xobjects.rs:984-1009 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1143\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/extractor/content_stream.rs:1990\u0060 calls \u0060unwrap_or\u0060 and \u0060src/extractor/content_stream.rs:1169\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f392a71ef7279a76dd093248df14b3575d6714d7fa059ca51d38596105763aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/markdown/convert.rs:1312-1335 | src/markdown/convert.rs:1690-1713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/convert.rs:1312\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":1312}}}],"partialFingerprints":{"codehealthFindingId/v1":"751d0266a439bee5926d5f02d43e369466de6f0d6139e4af952e5c5508a48c26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 5): src/extractor/content_stream.rs:1144-1165 | src/extractor/content_stream.rs:1490-1512 | src/extractor/content_stream.rs:1963-1984 | src/extractor/xobjects.rs:985-1006 | src/extractor/xobjects.rs:1268-1290 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1144\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a039dadd2173d56b2f85496addf6a41e4b7428c747716125e3091e7aaaef463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): src/extractor/content_stream.rs:483-504 | src/extractor/xobjects.rs:368-387 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed06ead6538100ca5d3a38e87669bde9d756daef48341111a3061ba8b86ca388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): src/tounicode.rs:839-860 | src/tounicode.rs:2766-2786 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tounicode.rs:839\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9c6a7218270ccd236d7d8ca30ccc884eef810bebc0ff444ec192f225bc4022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/tounicode.rs:2449-2470 | src/tounicode.rs:2979-3000 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tounicode.rs:2449\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, \u0060src/tounicode.rs:3001\u0060 calls \u0060max\u0060 and \u0060src/tounicode.rs:2471\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":"src/tounicode.rs"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9893a7a346128dd5bd75b341cbae7dfc2736be8beaeb13443047ba4ba361cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/lib.rs:4601-4621 | src/lib.rs:4625-4645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/lib.rs:4601\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":"src/lib.rs"},"region":{"startLine":4601}}}],"partialFingerprints":{"codehealthFindingId/v1":"992e69b17a7ce23b814878871a2db9fee9816011f7f4dac512718a772ea64086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201321 lines \u00D7 2): src/markdown/convert.rs:341-354 | src/markdown/convert.rs:419-439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/convert.rs:341\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060lines\u0060 to \u0060Vec\u003CTextLine\u003E\u0060 in one and \u0060\u0026[TextLine]\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/markdown/convert.rs:340\u0060 calls \u0060push\u0060, \u0060clone\u0060 and \u0060src/markdown/convert.rs:418\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":"src/markdown/convert.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"448c0d550b975e75e4c951fa240514fb36b92e6ceda630485b9e9d99d74ce4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/extractor/content_stream.rs:1047-1066 | src/extractor/content_stream.rs:1870-1889 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1047\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, \u0060src/extractor/content_stream.rs:1040\u0060 calls \u0060unwrap_or\u0060 and \u0060src/extractor/content_stream.rs:1869\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b181efd1d8875752f8a1a087005e19809c440b0960f5bf18d4753af234b920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/extractor/content_stream.rs:1702-1721 | src/extractor/xobjects.rs:1475-1494 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1702\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60fcacd5520ff2d26d22cbb27fcf3f0cf1a2f29e8d04513902cfd899d238de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/markdown/convert.rs:1200-1219 | src/markdown/convert.rs:1620-1638 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/convert.rs:1200\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":"src/markdown/convert.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1047881f0f069364906107078c8965c29d795cb341bda4f6758222da9355b445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/markdown/mod.rs:1052-1070 | src/tables/detect_rects.rs:531-550 \u2014 before extracting anything, compare \u0060src/markdown/mod.rs\u0060 and \u0060src/tables/detect_rects.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 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":"src/markdown/mod.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2287fc4f724262136d45b4a8ae4f6bd42afe3861713241ee25d4de51a4b3c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/bin/detect_pdf.rs:230-248 | src/bin/pdf2md.rs:838-856 | src/bin/pdf2md.rs:889-907 \u2014 before extracting anything, compare \u0060src/bin/detect_pdf.rs\u0060 and \u0060src/bin/pdf2md.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/detect_pdf.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8be89a8fa8dddd13abf99637fd0458ff09dc7a406fed0346c72d75e814233b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/bin/detect_pdf.rs:87-104 | src/bin/pdf2md.rs:24-41 \u2014 before extracting anything, compare \u0060src/bin/detect_pdf.rs\u0060 and \u0060src/bin/pdf2md.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/detect_pdf.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"460660925995997e8f2396932669cf4732630fd4bfad6ba67f89ef9b279d8d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201318 lines \u00D7 3): src/extractor/content_stream.rs:793-810 | src/extractor/content_stream.rs:2309-2310 | src/extractor/xobjects.rs:752-769 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:793\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/extractor/content_stream.rs:791\u0060 calls \u0060get_number\u0060, \u0060unwrap_or\u0060 and \u0060src/extractor/content_stream.rs:2307\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":"src/extractor/content_stream.rs"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30cb04c4e6b0458dd98b9f1794402c3e825d8daf542449eddd64667e53dc21e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/extractor/content_stream.rs:971-988 | src/extractor/content_stream.rs:1813-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 \u0060src/extractor/content_stream.rs:971\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"3036a35a30a556646931e3d6d141b6665a97ed710438c092b43bda96c89cbccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/extractor/fonts.rs:743-760 | src/extractor/fonts.rs:762-779 \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":"src/extractor/fonts.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b8c0390f5979d24f728eae4780a6c39bccf60ae5678b089c3e4b986ecb48ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/markdown/analysis.rs:42-58 | src/markdown/analysis.rs:75-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/analysis.rs:42\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/analysis.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e42f2e5c88d0af2e5c9bb10b2fd6190571f789ff036a4ec77d0fb18a275ca1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): src/tables/detect_rects.rs:3496-3507 | src/tables/grid.rs:12-28 \u2014 before extracting anything, compare \u0060src/tables/detect_rects.rs\u0060 and \u0060src/tables/grid.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":3496}}}],"partialFingerprints":{"codehealthFindingId/v1":"970adfe7cf2b69bece6ad3b9a8d0fa4cbff2e353ddfc2f779932c04d92c526e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201316 lines \u00D7 3): src/extractor/content_stream.rs:776-791 | src/extractor/content_stream.rs:2307-2309 | src/extractor/xobjects.rs:735-750 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:776\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"2517de2f9738f176a104a4bf965d163d2393801e37d146d909085fe8eeab6b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/extractor/content_stream.rs:1036-1049 | src/extractor/xobjects.rs:879-894 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1036\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8c8ede8f5d0c5771349d49541cf8737793bb2cf285a170b95df87e75c8aeb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/extractor/layout.rs:439-454 | src/extractor/layout.rs:924-939 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"10668ffe1547194f7a5e738f6fc183d4448837f9cf56d9c0ba20d611ecf7f92d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/markdown/mod.rs:942-957 | src/tables/detect_rects.rs:461-476 \u2014 before extracting anything, compare \u0060src/markdown/mod.rs\u0060 and \u0060src/tables/detect_rects.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tables/detect_rects.rs:480\u0060 calls \u0060filter\u0060 and \u0060src/markdown/mod.rs:958\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fa1d0f0d830a62e8871bb8f51d5a3697d96ca42f23ad9815cf09197ec0628e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/vision/pdfium.rs:395-410 | src/vision/render.rs:296-311 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/vision/pdfium.rs:395\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":"src/vision/pdfium.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"52868a4b7908868c7b4e1549796c3be5e268a3f7a1dd64d89aa5b96f2f02883c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/extractor/content_stream.rs:1076-1090 | src/extractor/content_stream.rs:1893-1907 | src/extractor/xobjects.rs:919-933 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1076\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1076}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f02ae390d5790702dfc048b340a7eb4187ac34c0fdbfeff08e5f43990b29eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/extractor/content_stream.rs:1462-1476 | src/extractor/content_stream.rs:1841-1854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1462\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4536c4c220665155ef4463f47bb279c1bf4788589b4a505dcbf03edc0b69bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/extractor/xobjects.rs:833-846 | src/extractor/xobjects.rs:1240-1254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/xobjects.rs:833\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/xobjects.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5f8364f4403471b23bc3292613c35c66e52fac12930aa90736210e01cbe5a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/markdown/convert.rs:735-747 | src/markdown/convert.rs:971-985 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/convert.rs:735\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42924ccfad1edbb84d2302e7be954912a957e7a11d7883940c4b5cfd29d4964"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/markdown/convert.rs:762-776 | src/markdown/convert.rs:1441-1455 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/convert.rs:762\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea1590f475d49146a2b441be4fa0ac2a7cbc4b15fd5be8f5fd830265e219eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tables/detect_rects.rs:2050-2064 | src/tables/detect_rects.rs:3394-3408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:2050\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":2050}}}],"partialFingerprints":{"codehealthFindingId/v1":"e126f3f545b790cf891b9e459f70e979540ac2814fdc54efec1973e38148e358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/tounicode.rs:2227-2241 | src/tounicode.rs:2269-2283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tounicode.rs:2227\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e6410144ea745ddf5d747f679ba9a0825bcbdf3d5dd002d527ee6dd6da2c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/bin/detect_pdf.rs:30-43 | src/bin/pdf2md.rs:44-57 \u2014 before extracting anything, compare \u0060src/bin/detect_pdf.rs\u0060 and \u0060src/bin/pdf2md.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/detect_pdf.rs:30\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":"src/bin/detect_pdf.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ac30ba993f2fc408c6c75732992ad1e62cb605b0e1d9aac5748922391886dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): src/extractor/content_stream.rs:1119-1132 | src/extractor/content_stream.rs:1935-1944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1119\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"b200055e4f1ce8250bfde28ea234a48b7e2fe2460ca6e2dca3af030ed3edbba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/extractor/content_stream.rs:1661-1674 | src/extractor/xobjects.rs:1434-1447 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1661\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":"src/extractor/content_stream.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda0544c27dbcce37abfe81a662a68487ebc836ed23090d2cdcc48c31d253530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201314 lines \u00D7 3): src/extractor/content_stream.rs:2313-2315 | src/extractor/content_stream.rs:2476-2488 | src/extractor/content_stream.rs:2540-2553 \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 \u0060src/extractor/content_stream.rs:2476\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":"src/extractor/content_stream.rs"},"region":{"startLine":2313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b10d76a80c8f509e9c2d0adb2ee9572a80ffbf93333181d4173a1247b0df59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/vision/oar.rs:672-685 | src/vision/render.rs:391-404 \u2014 before extracting anything, compare \u0060src/vision/oar.rs\u0060 and \u0060src/vision/render.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/oar.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95dc8fbc87cd31eff3ea03c80b943217d19f1250f79861ed5e4aac4debd8dfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/extractor/content_stream.rs:1092-1104 | src/extractor/content_stream.rs:1908-1920 | src/extractor/xobjects.rs:934-946 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1092\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":"src/extractor/content_stream.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31586b35aebed8c5ff5808f423243ffe50d83ac8b1123ea03cf8cf5a559a6c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): src/tables/detect_rects.rs:1969-1981 | src/tables/detect_rects.rs:2803-2815 | src/tables/detect_rects.rs:3322-3334 \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 \u0060src/tables/detect_rects.rs:1969\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":"src/tables/detect_rects.rs"},"region":{"startLine":1969}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7a82c1a2c4a1a1dc41acdf7c1c63e736019b3b8ee89cea93ac777e325a57f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/extractor/content_stream.rs:2014-2026 | src/extractor/xobjects.rs:608-620 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:2014\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":"src/extractor/content_stream.rs"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb43d84e47b7b367301e956aad2c88ca7eeb71d9e34a364089fcb9fbb8f93cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201313 lines \u00D7 2): src/tables/cell_text.rs:44-56 | src/types.rs:976-981 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/cell_text.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd985eba99fccc4b51c952281d7b9059d71343328092398e8400937dad15433f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/tounicode.rs:2700-2712 | src/tounicode.rs:3189-3201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":2700}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd3fa731684234dcb5e58eb282a82efc8b6dc7616843d119a1304a473e73e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 5): src/tounicode.rs:947-958 | src/tounicode.rs:1007-1018 | src/tounicode.rs:1086-1095 | src/tounicode.rs:2855-2864 | src/tounicode.rs:2899-2908 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a6b7f8178e3c2e053313ad730c64e927a8cccf8238da58b638309abbcccead"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): src/extractor/content_stream.rs:1095-1105 | src/extractor/content_stream.rs:1911-1921 | src/extractor/content_stream.rs:2261-2272 | src/extractor/xobjects.rs:937-947 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1095\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":"src/extractor/content_stream.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af6bd2559eb990f32b509522291a237e0a6964be8911f5440a52184cac28fea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 3): src/tables/detect_rects.rs:2008-2019 | src/tables/detect_rects.rs:2829-2835 | src/tables/detect_rects.rs:3356-3363 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0ba2f9fad5e9a86ce043a92ed7337c5b27752485ac3937ad9667c1ee78634e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/detector.rs:738-749 | src/detector.rs:796-807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc92824ab4cb8ef2744dd93e2b85b929da02895d6bcb94fd2dfef695ac661a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/extractor/xobjects.rs:1516-1527 | src/extractor/xobjects.rs:1531-1542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/xobjects.rs:1516\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. 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":"src/extractor/xobjects.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"494852f268dc2f5bb85e3632e3dfd9249a86f3e89ce6e3e8ac40e1e294f52496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/lib.rs:2563-2574 | src/lib.rs:2598-2609 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09cf6293f64acb8e29f114540466cdddd6e820512139c256ae378515fbff464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/overlong_numerals.rs:631-642 | src/overlong_numerals.rs:715-726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/overlong_numerals.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a851c135550c2be38ba568d1fb72948c81d4cdb1daba1c090e2c5bee682239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/tables/grid.rs:324-335 | src/tables/grid.rs:340-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/grid.rs:324\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/grid.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e94854907e836bc770c85e3e301b05008296c89e3b2d1e7cfd75f034e16eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): src/tounicode.rs:1037-1048 | src/tounicode.rs:2921-2930 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b05f69bf50b4e820a96ec592b2774a7c4212fd633562dccfe2335399788889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tounicode.rs:1291-1302 | src/tounicode.rs:1319-1330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tounicode.rs:1291\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":"src/tounicode.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8cd83acf3d0d3fbde57a944ff0cadbfc78c176d8d987db14960cd5e2128d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tounicode.rs:1754-1765 | src/tounicode.rs:1775-1786 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tounicode.rs:1754\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":"src/tounicode.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"929a0e03d34671bbda96d4e257e25b54a5b36621de53b4e4817a6ec5019bbe96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 3): src/extractor/content_stream.rs:1061-1066 | src/extractor/content_stream.rs:1884-1890 | src/extractor/xobjects.rs:906-916 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:1061\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":"src/extractor/content_stream.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"16673a6b6237aa95f950be5668d134ab76039cf07d9f051e318f9402af6b51cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/extractor/content_stream.rs:1118-1128 | src/extractor/content_stream.rs:1687-1697 | src/extractor/content_stream.rs:1934-1944 \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 \u0060src/extractor/content_stream.rs:1118\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"440875dad71ec0d2c470f39623a64683ea33208b847ef91ae45506159f7d062b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): src/extractor/fonts.rs:2424-2434 | src/tounicode.rs:3458-3465 | src/tounicode.rs:3621-3628 \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 that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e870fbba824cd24e432abecf7ced7cebcb824f5840f358e5603411aca9571d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/tables/detect_lines.rs:216-226 | src/tables/detect_lines.rs:590-600 | src/tables/detect_lines.rs:1254-1264 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd23cd9046186851587cbdce343b8b5460db1cd3533bbf9dfa4198b2fd4e83b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/bin/detect_pdf.rs:249-259 | src/bin/detect_pdf.rs:333-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/bin/detect_pdf.rs:249\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":"src/bin/detect_pdf.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3975aee253b838fe56cf6a0a82601103cbdd348fcd58ee77d22f0f4cb3a45573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/detector/content_resources.rs:121-131 | src/detector/content_resources.rs:173-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/detector/content_resources.rs:121\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_resources.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a75f6139a30ffda852b146de87968a52fcb6e02cb4081cee9b8206a704d41aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/extractor/content_stream.rs:820-832 | src/extractor/xobjects.rs:648-658 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:820\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":"src/extractor/content_stream.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0169b7ed057d7a6cf3c21c571dda0e8a9844b4c5e8ab2d38cd190261fb21a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201311 lines \u00D7 4): src/extractor/content_stream.rs:2452-2461 | src/extractor/content_stream.rs:2513-2523 | src/extractor/geometry.rs:294-295 | src/tables/structured.rs:188-189 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:2452\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":"src/extractor/content_stream.rs"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaaecf07dfc80835d253063e6d05b360751a7d8586df7d1d92695bffa3554e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/extractor/xobjects.rs:960-970 | src/extractor/xobjects.rs:1460-1470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/xobjects.rs:960\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/xobjects.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e36fc51594bab65a077d6155d49b86971122cf37f5fa833c15f2d811bee274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/lib.rs:1348-1358 | src/lib.rs:1552-1562 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/lib.rs:1563\u0060 calls \u0060insert\u0060 and \u0060src/lib.rs:1359\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":"src/lib.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"865790e16ead1791565048ff82ca4fccb0610b0026a0b28b2513607d5af0abb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/lib.rs:1358-1368 | src/lib.rs:1564-1573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/lib.rs:1358\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8fe5164e6ca11e742caf1a4a597b4ef28d6718e14b20b75371e746efd28bfea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/structure_tree.rs:916-926 | src/structure_tree.rs:958-968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/structure_tree.rs:916\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":"src/structure_tree.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e80de4493d1c61efef8a4c212f524f1dde44b21fae931e1cf7919685f887a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/tables/detect_lines.rs:279-289 | src/tables/detect_lines.rs:789-798 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_lines.rs:279\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":"src/tables/detect_lines.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"938d44d5ad64b369b66700d461ef81f12f6327d6b91c5de3cee0f073334f2eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tables/detect_rects.rs:114-124 | src/tables/detect_rects.rs:244-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:114\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tables/detect_rects.rs:255\u0060 calls \u0060component_size\u0060 and \u0060src/tables/detect_rects.rs:125\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e77809ea72c2feffdb42ea9b235362eab6ec1f7f7ca9b77fb2dd00642f2c3f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/tables/detect_rects.rs:1634-1645 | src/tables/detect_rects.rs:2095-2106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:1634\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":"src/tables/detect_rects.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c76bc4065cdbe6f8b5a159171d942fc3b5dbe5dac2c40c4e05bf4d1e7a9650"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tables/detect_struct.rs:77-87 | src/tables/detect_struct.rs:91-101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_struct.rs:77\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_struct.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"723c47978fd89014d5d685624726db7d8df6ba910bcc269e81b1fee03c24faac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/tables/mod.rs:74-84 | src/tables/mod.rs:132-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/mod.rs:132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f97b94ed7c96e01daa69aa6c305a6bf3def4f4b464c7b077610e809b9f7704e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 9): src/tounicode.rs:950-959 | src/tounicode.rs:976-985 | src/tounicode.rs:1010-1019 | src/tounicode.rs:1036-1043 | src/tounicode.rs:1052-1059 | src/tounicode.rs:1089-1096 | src/tounicode.rs:2858-2865 | src/tounicode.rs:2902-2909 | src/tounicode.rs:2920-2927 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aa29d20e043c25f835524999205cdbe630db4c3489b30cc74eecae2894acad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): src/extractor/content_stream.rs:1058-1066 | src/extractor/content_stream.rs:1881-1889 | src/extractor/content_stream.rs:2229-2238 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"54700189ff412a756a96998937bf51f0e538650d9b28495abe4f557cb4112768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/markdown/mod.rs:946-955 | src/tables/detect_lines.rs:1645-1654 | src/tables/detect_rects.rs:465-474 \u2014 before extracting anything, compare \u0060src/markdown/mod.rs\u0060 and \u0060src/tables/detect_rects.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tables/detect_rects.rs:480\u0060 calls \u0060filter\u0060 and \u0060src/markdown/mod.rs:958\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"c708180b2b2deae31332ea5bd0d0a59ad37b049be650cc7c81bb9691447323d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/markdown/mod.rs:1802-1811 | src/markdown/mod.rs:1826-1835 | src/markdown/mod.rs:1841-1850 \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 \u0060src/markdown/mod.rs:1802\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36b3c7ae2d88c6442e6801c5c7451726b0b131a2b001ed8d1132b9ceca87352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/tables/financial.rs:119-128 | src/tables/mod.rs:342-351 | src/tables/mod.rs:376-385 \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 \u0060src/tables/financial.rs:119\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: \u0060src/tables/financial.rs:119\u0060 is reached only past a guard at line 84 that tests \u0060item.font_size\u0060 and \u0060item.width\u0060 and leaves the function early, and \u0060src/tables/mod.rs:342\u0060 reads \u0060item.font_size\u0060 and \u0060item.width\u0060 with no such check. What separates these copies is not which lines they run but which PRECONDITION they enforce, so one of them is operating on state the other one refuses. Decide which is intended BEFORE unifying them \u2014 extract the shared part and whichever copy is missing the check keeps running unchecked, and if the guard is the correct behaviour then that hole is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/financial.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b52fa8480939312087577f1f208781f6bdf2265980ff7a4ca9572517d93954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/detector.rs:2166-2175 | src/detector.rs:2353-2362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/detector.rs:2166\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":"src/detector.rs"},"region":{"startLine":2166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3346d1c7691fff7307014db8ea103dff312666b4b463c369fd553bdd7e59d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/extractor/content_stream.rs:852-863 | src/extractor/xobjects.rs:668-677 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e638b62d2d7d33b6ca3e0bfc5343617d3a67d3b31c3d4df6bb441a4257fe44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201310 lines \u00D7 3): src/extractor/content_stream.rs:2464-2472 | src/extractor/content_stream.rs:2526-2535 | src/extractor/geometry.rs:296-297 \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 that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"439b9596d38bd9a26c64fa6726a37c53e7653fd76f897db1a893477315c8e9a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/extractor/underline.rs:226-235 | src/extractor/underline.rs:676-685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/underline.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c496cb0e6916de6de1be25a90d98d6ddfb3d5d9032ed8348a39975daffd3626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): src/lib.rs:2460-2466 | src/tables/detect_lines.rs:1752-1761 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/lib.rs:2460\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":"src/lib.rs"},"region":{"startLine":2460}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfedab8283ede280ebe63b23e4f58ca955dfe7d11519f83d3766086b5302469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/lib.rs:5572-5581 | src/tables/format.rs:217-226 \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":"src/lib.rs"},"region":{"startLine":5572}}}],"partialFingerprints":{"codehealthFindingId/v1":"180f8034b3e70c08c1cbec5586d5bcd7523bc29b4ac7c12ea55cd987ce820ad9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/markdown/convert.rs:577-586 | src/markdown/preprocess.rs:25-32 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a65c5816ff114d7e4b7ea4548e59e8216de6a6d1eb6df6d76e0204188f08545"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/markdown/mod.rs:1719-1726 | src/markdown/mod.rs:1759-1768 \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":"src/markdown/mod.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"549d1baf18878f2445cc54f8928fde987622463cb6cf25733e67d33f69727ec2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/overlong_numerals.rs:117-126 | src/overlong_numerals.rs:157-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/overlong_numerals.rs:117\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. 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":"src/overlong_numerals.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02ab5cdd21072f299a97ce74c2bd73a0275f3f56fac7181b8696a0ac956b88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tables/detect_lines.rs:1956-1965 | src/tables/detect_lines.rs:1984-1993 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_lines.rs:1956\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":"src/tables/detect_lines.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f10c6249aa91399aba684f6762ab17887342838790a6cb0f72bbefb7fda5c8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tables/detect_rects.rs:1129-1138 | src/tables/detect_rects.rs:1760-1769 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a273822b2947832ed18398aee1e0d9e58cd8831f5f4d997dbd361871a14351c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/tables/detect_rects.rs:3516-3524 | src/tables/grid.rs:297-306 \u2014 before extracting anything, compare \u0060src/tables/detect_rects.rs\u0060 and \u0060src/tables/grid.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:3516\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":3516}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f4866164a8a6ca707766bec3688780b83537c6af05550031fde4d994d3ecb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/vision/pdfium.rs:138-146 | src/vision/pdfium.rs:181-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":"src/vision/pdfium.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73a514aeb7fc02e532f4fa4a8543c1f051662735a476634a0446db3c8c6e958"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/tables/detect_lines.rs:212-220 | src/tables/detect_lines.rs:586-594 | src/tables/detect_lines.rs:937-944 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"972a0fdfe2d5767e843249b985881dde714efbdf24a53f3420f4caaee6ecb81c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/detector.rs:2013-2030 | src/detector.rs:2071-2088 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/detector.rs:2013\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e14413d407ad584a6e0a0bc8fccb0c7adf2017b5849fb5aece8e5c85e95447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/extractor/fonts.rs:230-238 | src/extractor/fonts.rs:312-320 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/fonts.rs:230\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":"src/extractor/fonts.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d4102a20f3f386a3b4bd300cd1a5171d921a492d79fc66c206a07a3d9486df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/extractor/fonts.rs:515-524 | src/extractor/fonts.rs:527-536 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/fonts.rs:515\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"65265dbb55bf3bdf39c0a1bb62a432ebb9b4cdd05072dc8e5524c889dcf11a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/extractor/layout.rs:2429-2439 | src/tables/mod.rs:505-515 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/layout.rs:2429\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":2429}}}],"partialFingerprints":{"codehealthFindingId/v1":"98484bd7b204fa90359b5199713c3c1d3eee687e4dd6245b012b9a282db56961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/extractor/xobjects.rs:139-147 | src/extractor/xobjects.rs:1515-1523 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060form_dict\u0060 to \u0060\u0026lopdf::Dictionary\u0060 in one and \u0060\u0026\u0027a lopdf::Dictionary\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/xobjects.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07393580aba39577753942cc00d31a2c7117e0015317f74ad4a8483221b1e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/markdown/furniture.rs:482-490 | src/markdown/furniture.rs:493-501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/furniture.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"715bb82c450be6bb8b42ebd2f7408e9445265be0d5b9c4727a113bf620d86a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20139 lines \u00D7 5): src/markdown/mod.rs:1088-1096 | src/tables/detect_rects.rs:891-899 | src/tables/detect_rects.rs:931-934 | src/tables/detect_rects.rs:935-935 | src/tables/detect_rects.rs:936-936 \u2014 before extracting anything, compare \u0060src/markdown/mod.rs\u0060 and \u0060src/tables/detect_rects.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 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 \u0060src/markdown/mod.rs:1088\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/tables/detect_rects.rs:936\u0060 calls \u0060iter\u0060, \u0060reduce\u0060, \u0060unwrap\u0060 and \u0060src/tables/detect_rects.rs:938\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b848c9b310c571753e4249899e00045bb943ca26a15d38f69f5c29d219ea3bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/markdown/mod.rs:1876-1885 | src/markdown/mod.rs:1934-1943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":1876}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd9cf16176c933552293dbe31a0fc0b303ba8642a8aa6322593f658ad312e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tables/detect_lines.rs:932-940 | src/tables/detect_lines.rs:1261-1269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_lines.rs:932\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31899b1497da5d0d014dfb533a0b5a5c2c781acd1fa7f7629a29001af0dd6ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/tounicode.rs:2870-2878 | src/tounicode.rs:2928-2936 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":2870}}}],"partialFingerprints":{"codehealthFindingId/v1":"653aaa9d7a39342629693cb4f5dd0adcd557c3ab43572a6df06804d8060236a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): src/tables/detect_lines.rs:220-227 | src/tables/detect_lines.rs:327-334 | src/tables/detect_lines.rs:594-601 | src/tables/detect_lines.rs:804-811 | src/tables/detect_lines.rs:929-936 | src/tables/detect_lines.rs:1258-1265 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e5c91b1a4a6cfc54dfa55b0f4f67b4dbf9df842f95e4fee46a604ca2d1036e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/extractor/layout.rs:442-449 | src/extractor/layout.rs:927-934 | src/vision/oar.rs:679-686 | src/vision/render.rs:398-405 \u2014 before extracting anything, compare \u0060src/vision/oar.rs\u0060 and \u0060src/vision/render.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/layout.rs:442\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc6e9f1a0dcfe45ae0df8b2d1e145ed5b2a5ad9491698bd355bcf134433b643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/tounicode.rs:1754-1761 | src/tounicode.rs:1775-1782 | src/tounicode.rs:1823-1830 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26e93ccbb66f326530590895afef59ffe71659e1f38fad9fcf9ede498f57b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/detector.rs:1517-1524 | src/extractor/fonts.rs:2088-2095 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/detector.rs:1517\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f394072c66aa3d1674113c08ad85bac08235ab3b996ec589620d48757bfaf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/extractor/fonts.rs:2984-2990 | src/text_utils.rs:774-781 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/fonts.rs:2984\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":"src/extractor/fonts.rs"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2d7976bd7d4b888029134cd4abe995bc8e2b574f54c2999dc40e50843e5218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/extractor/reading_order.rs:55-62 | src/extractor/reading_order.rs:295-302 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/reading_order.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d934039e59c04f8540b828b069b831045065e010725c77120cf3ce79bb5edb33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/markdown/convert.rs:1000-1007 | src/markdown/convert.rs:1510-1517 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db570326ae4dc0690feb82424cba6b69cfacad5e072b98ef7082a3322c9c0d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/markdown/furniture.rs:441-448 | src/markdown/furniture.rs:546-553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/furniture.rs:441\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":"src/markdown/furniture.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbdec776739c68a3ca30443b57527ffb270cdb013aac96166acd2ea90d22d7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/markdown/mod.rs:704-711 | src/markdown/mod.rs:726-733 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/mod.rs:704\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":"src/markdown/mod.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb6bbfa353e109ad1a92c3201b0e2fa39b55dae18edcc53d32b34aedcd3a753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (1\u20138 lines \u00D7 4): src/markdown/mod.rs:1101-1108 | src/tables/detect_rects.rs:904-911 | src/tables/detect_rects.rs:936-936 | src/tables/detect_rects.rs:937-938 \u2014 before extracting anything, compare \u0060src/markdown/mod.rs\u0060 and \u0060src/tables/detect_rects.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 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 \u0060src/markdown/mod.rs:1101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c73d2aeefa7f6ecbdbe6f2afb05767fbbf7fe9f5dd963e3defccc7ab35e037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tables/detect_rects.rs:1938-1945 | src/tables/detect_rects.rs:3292-3299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:1938\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":"src/tables/detect_rects.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fad1d1c04c2e593fe8474d868e97221e186e71e7c4e57c20af3a1179799073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tables/mod.rs:788-795 | src/tables/mod.rs:807-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa729b9af9c61a8e290900be0d2ca22b76530db467986cd30bf4b3de386e40dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/vision/render.rs:429-436 | src/vision/render.rs:437-444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/render.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"09eefdc34daf0d240911b565a3c5baa2f5dbfef6fe34c3a64fa5948e5897bba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/tables/detect_lines.rs:215-221 | src/tables/detect_lines.rs:589-595 | src/tables/detect_rects.rs:1400-1406 \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 \u0060src/tables/detect_lines.rs:215\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e99b6347da6eecb13c56c92b1af8f94a5c47a436596cc73b7fcfd69a360286"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/detector/content_geometry.rs:32-38 | src/extractor/page_box.rs:64-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/detector/content_geometry.rs:32\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 \u0060other\u0060 to \u0060\u0026UserBox\u0060 in one and \u0060\u0026PageBox\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_geometry.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a6984f3b6b5cb5d97feed6a2b58821e36cafc0eaf4892474e12815f3f354fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/extractor/content_stream.rs:2847-2853 | src/extractor/content_stream.rs:2868-2874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/content_stream.rs:2847\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rotation\u0060 to \u0060f32\u0060 in one and \u0060PageRotation\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":2847}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8e23324a1a98bbde3ff4d63b6e34767f47e3018fb5b148a12e75218fefe63e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/extractor/links.rs:71-77 | src/extractor/links.rs:151-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/links.rs:71\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":"src/extractor/links.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc6d379f472d0c969db000c5698f88260884d4f3e9685eb667eabd6f2972229"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/lib.rs:1263-1273 | src/lib.rs:1517-1527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/lib.rs:1263\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":"src/lib.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5422cfdc8507d9ea4713c76717804011957ee1f0b3a7d3b9af5a68168b57a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/markdown/heading.rs:50-56 | src/markdown/heading.rs:91-97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/heading.rs:50\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/heading.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cd8f8bfd089c1458371f1b0b876ec265723de63c860afd2a488ddd6f1bdfed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/markdown/mod.rs:1970-1976 | src/markdown/mod.rs:1979-1986 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/mod.rs:1979\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":"src/markdown/mod.rs"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"025129aebb4d173f8877076715d28986e2d182848d9115f115ecc1ec2121e1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/markdown/postprocess.rs:332-339 | src/markdown/postprocess.rs:342-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/markdown/postprocess.rs:332\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/markdown/postprocess.rs:329\u0060 calls \u0060replacen\u0060, \u0060to_string\u0060 and \u0060src/markdown/postprocess.rs:341\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/postprocess.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d951ab8203388d3d66385d5f4158595af162613fac699b9a65ee341608f72f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tables/detect_rects.rs:1393-1399 | src/tables/detect_rects.rs:1401-1407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f49b3e44e2dd312bac092c3f769f10b986d7bb673df3c0bf56285f282b426f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tables/structured.rs:241-247 | src/tables/structured.rs:253-259 \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":"src/tables/structured.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb6ca40de84af817dfcc3a685bd2ec49f84b415a674a1b43becd162f4736f4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/markdown/analysis.rs:45-50 | src/markdown/analysis.rs:78-83 | src/markdown/analysis.rs:666-671 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/analysis.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"daab381d7fa3e3a8448b66014d56838c6346ec80cb9f26b43c62bbf15c967a6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 4): src/tables/detect_rects.rs:1568-1571 | src/tables/detect_rects.rs:2144-2149 | src/tables/detect_rects.rs:3139-3144 | src/tables/detect_rects.rs:3452-3457 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:2144\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/tables/detect_rects.rs:2144\u0060 calls \u0060collect\u0060 and \u0060src/tables/detect_rects.rs:1568\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"a023bfad0f5691575930c4844eac98b40ec0d634708cf8f72880d3c2ec65ca3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/extractor/layout.rs:1270-1276 | src/extractor/layout.rs:1378-1384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"659bc50c50c0742476a20399828d07ea9b904979331de6ae8127d2bb02f7e770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/lib.rs:5805-5810 | src/lib.rs:5857-5862 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":5805}}}],"partialFingerprints":{"codehealthFindingId/v1":"db965a874812ab402351bd2ea225ea916c4279712c727196c4a62285452b5292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/markdown/mod.rs:1126-1131 | src/markdown/mod.rs:1170-1175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/mod.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c81345e4df0d02a24c35419237b8b3249df7dd8654bd7299d19069d694dd0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tables/detect_lines.rs:1706-1711 | src/tables/detect_rects.rs:2358-2363 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_lines.rs:1706\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":"src/tables/detect_lines.rs"},"region":{"startLine":1706}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f38eabe276c021d3e7f100ad8243a6de96b80b54cd425d6968a236d0220bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tables/detect_rects.rs:2334-2339 | src/tables/detect_rects.rs:2434-2439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:2334\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":"src/tables/detect_rects.rs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7816fb17e75d05cc1a7c45c469bd440101205b02e27edb1549903a1f85908d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): src/extractor/layout.rs:438-442 | src/extractor/layout.rs:443-450 | src/extractor/layout.rs:853-857 | src/extractor/layout.rs:923-927 | src/extractor/layout.rs:928-935 | src/markdown/mod.rs:363-370 | src/vision/oar.rs:680-687 | src/vision/render.rs:399-406 \u2014 before extracting anything, compare \u0060src/vision/oar.rs\u0060 and \u0060src/vision/render.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad27d4b9461d378a6e612193be50e57f987f6fe501917c674fbfe3e03e08f9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/markdown/heading.rs:50-54 | src/markdown/heading.rs:72-76 | src/markdown/heading.rs:111-117 \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 \u0060src/markdown/heading.rs:111\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/heading.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"96565e5ae88c8617633b6474d58c391be49d2fc4d6091739a175307aa6f91087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/lib.rs:1249-1254 | src/lib.rs:1507-1511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"626779cb9d0a704da0ee58c6db2be237debfd3b6ff415171bd69b2e8498f798f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tables/detect_heuristic.rs:1742-1746 | src/tables/mod.rs:652-656 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_heuristic.rs:1742\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, \u0060src/tables/detect_heuristic.rs:1741\u0060 calls \u0060skip\u0060 and \u0060src/tables/mod.rs:651\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1742}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c008bda2f11a66362c19a8953ba1f14c28cbe2b8cd9408e137ae3505b0fac97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/tables/detect_lines.rs:452-457 | src/tables/detect_lines.rs:877-882 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_lines.rs:452\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/tables/detect_lines.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e85c75018879bbb6cd49fd3c8c4763f55dff1eb251071807f0c476b4e5599d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tounicode.rs:3445-3452 | src/tounicode.rs:3615-3619 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":3445}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52165f279a8cf0fd7e770af5506429b38b2f54597bf09b1b41355e5f0daebcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/bin/detect_pdf.rs:45-58 | src/bin/pdf2md.rs:59-72 \u2014 before extracting anything, compare \u0060src/bin/detect_pdf.rs\u0060 and \u0060src/bin/pdf2md.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/detect_pdf.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bdfa8f19294d6118cbaf305d545d15f36628d716fcc6b1d507dffa2f8a9de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/detector/content_resources.rs:230-236 | src/tounicode.rs:781-787 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector/content_resources.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"51aa15d57b07030149fbde0db9abc2830482f408e7bb21cf95b362285a5927ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/extractor/content_stream.rs:100-105 | src/extractor/mod.rs:994-999 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc01e0b6499d5588439a7b6ba77451a0fd85a8f5dd72a971d1946b6fc25ca5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/extractor/fonts.rs:141-147 | src/structure_tree.rs:1081-1087 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/fonts.rs:141\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb977657703a86176d7a9e85e4f8ad6802021955a8c24d429530c198af3e88a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/lib.rs:5565-5569 | src/tables/mod.rs:1453-1457 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":5565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3689cf1753244685e7b04251b0ae77a3f5d2fef4237c26f9bb4f00275828fd4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/lib.rs:5583-5587 | src/tables/format.rs:204-208 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":5583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64d6968a472b0754c638170c5852cd07fa6eb4a707248c7c505f26e29a771b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tables/format.rs:210-214 | src/tables/mod.rs:1322-1326 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/format.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fdf93810a84f075a197f7456937d2ea39e586bc5458dc06f6439249c30856f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): napi/src/lib.rs:478-487 | src/python.rs:604-613 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060gaps\u0060 to \u0060Vec\u003Cpdf_inspector::FontCMapGaps\u003E\u0060 in one and \u0060Vec\u003Ccrate::FontCMapGaps\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":"napi/src/lib.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"f140520c26a3b0b0e4e3a334889de15c718f6b47a26b4ea1f7d158687075233c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): napi/src/lib.rs:489-497 | src/python.rs:615-623 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060reasons\u0060 to \u0060Vec\u003Cpdf_inspector::PageOcrReasons\u003E\u0060 in one and \u0060Vec\u003Ccrate::PageOcrReasons\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":"napi/src/lib.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f685c4d84b0bfc683720d36281ecf5b6309ef2d65ca8310f949c2ddbbd9d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/tables/detect_rects.rs:2028-2043 | src/tables/detect_rects.rs:3372-3387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:2028\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":2028}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0ba3104d4c102246b2bd2c02c375896dc637e3ea3622ecf9e78bb2ebc52c95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/extractor/content_stream.rs:840-851 | src/extractor/xobjects.rs:673-686 \u2014 before extracting anything, compare \u0060src/extractor/content_stream.rs\u0060 and \u0060src/extractor/xobjects.rs\u0060 as WHOLE FILES: this scan already matched 23 separate duplicated blocks between them, totalling at least 724 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"0302703dd766e00512a9d528a0974c4b9d7ea77580b8143f75a6d87a30db9b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/extractor/fonts.rs:621-633 | src/extractor/fonts.rs:2078-2082 \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":"src/extractor/fonts.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"b021b73e1d432cd9260593611ff9741ac19c405c86736e454df26a7d984ab248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/bin/detect_pdf.rs:274-285 | src/bin/detect_pdf.rs:358-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/detect_pdf.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea88fc790539469500f5deeb28db3c8d68537267bcc0587120cc7e3b8d839c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/tables/detect_rects.rs:2993-3002 | src/tables/detect_rects.rs:3420-3429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:2993\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":2993}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d25ca13c7c12dc042087056ae7331d78d6bcb6baaf4b359a419c582dc15ad5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/tables/detect_rects.rs:1650-1657 | src/tables/detect_rects.rs:2108-2114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:1650\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_rects.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"12316823910909cab1fa58e758d48f6de5bc9643ed648b833a7298e9641ec3fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/tounicode.rs:923-930 | src/tounicode.rs:2533-2540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0d7a070037560630bc914ab7d5c4036a3d90348c022de500d31f990428f6ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/extractor/text_paint.rs:204-210 | src/extractor/text_paint.rs:218-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/text_paint.rs:204\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":"src/extractor/text_paint.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5580733ad4ba1c61f0f8cebd1195de116635b4bf59eb3d4d731009aee4e8a171"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/extractor/links.rs:151-157 | src/extractor/xobjects.rs:163-169 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/links.rs:151\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":"src/extractor/links.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"82668708c64988e7a67e885107683c6b39bfe7ce35839b4f21ac2c7557e494d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/extractor/fonts.rs:2835-2839 | src/extractor/fonts.rs:2850-2854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/extractor/fonts.rs:2835\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":"src/extractor/fonts.rs"},"region":{"startLine":2835}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2e9580cf13661692b05cc1311d82ffaddb5636b869268c008256b49b0fe791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/extractor/layout.rs:363-367 | src/extractor/layout.rs:376-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecc78142e13cae054aa8c7780ec7097c2a928da0221e36556b25fbe8ce9b112"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tables/detect_rects.rs:3510-3514 | src/tables/grid.rs:289-293 \u2014 before extracting anything, compare \u0060src/tables/detect_rects.rs\u0060 and \u0060src/tables/grid.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_rects.rs:3510\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":"src/tables/detect_rects.rs"},"region":{"startLine":3510}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b37ac734acc8d6ba32304e9ee090f49f87abfe3e94b152a698c42831d6bb82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/tables/detect_struct.rs:162-166 | src/tables/detect_struct.rs:207-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/tables/detect_struct.rs:162\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":"src/tables/detect_struct.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21fa837b26f2be38da6522d92a85953b873f9fc2a2cc97213983c230c42d1d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): scripts/version.py:62-81 | scripts/version.py:112-124 \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":"scripts/version.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f49ac58192f1b613f0ccb93bcdbdfb771d8c448d288949c3c0acdb1273873c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/version.py:49-58 | scripts/version.py:102-108 \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":"scripts/version.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4623abe86c9f8c204d6642b4bf5632265e9ac1b8eb34acf8d512f34e9148d0fa"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pdf-inspector: pdf-inspector: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"34f6b1cedb5f6fc83440e657c3607247689c9f4bdca2afc3b7594821d36e4956"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: src/adobe_korea1.rs: 0.0% line coverage (0/6)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/adobe_korea1.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"651949cf1cabe030aa38ebffc16ec7b18f528b8cbba184f20a48b672366ae14a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extractor/content_stream.rs: src/extractor/content_stream.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 272 in pdf_inspector::extractor::content_stream::extract_page_text_items_with_options at line 438. 21 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/extractor/content_stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9937b5994f25c3dd4b251c1f5f533c485629cba5fdd53e6223675800816791c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extractor/xobjects.rs: src/extractor/xobjects.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 162 in pdf_inspector::extractor::xobjects::extract_form_xobject_text_inner at line 292. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/extractor/xobjects.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/xobjects.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"572efd3a592f0027ccb3a16278883de1dff614cfba66fa7fcbfa0bdd38a360d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extractor/fonts.rs: src/extractor/fonts.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 100 in pdf_inspector::extractor::fonts::extract_text_from_operand at line 2519. 12 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/extractor/fonts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24786ae6932322ee805fe32d23a4428bb93bc17dbf673268c36afc5e9129d09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extractor/mod.rs: src/extractor/mod.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in pdf_inspector::extractor::merge_text_items_with_clips at line 2039. 17 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/extractor/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/mod.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fd2d70615233786a2a63c37fcef4a84dc579f731a0b8edf2a52708df898684"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/markdown/convert.rs: src/markdown/convert.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in pdf_inspector::markdown::convert::to_markdown_from_lines_with_tables_and_images at line 750. 4 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/markdown/convert.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/markdown/convert.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"da09a0f848bd008415febcb543059a6f2ba019aed1f2cb3e5ce170e7f86f8211"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/lib.rs: src/lib.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in pdf_inspector::process_document at line 4578. 15 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- 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":"src/lib.rs"},"region":{"startLine":4578}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c530fbeeba83c04da61dff30496df913b8ad97db9ae2ce4ec912d047bc7cc0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/vision/pipeline.rs: src/vision/pipeline.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in pdf_inspector::vision::pipeline::process_pdf_with_ocr_mem at line 215. 4 of those changes were fix/bug commits, and the other 13 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/vision/pipeline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/pipeline.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b566c7f21408cd7838ac19813cd6d21ab71010d1740847af7cc23a69378aed83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/bin/pdf2md.rs: src/bin/pdf2md.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in pdf_inspector::bin::pdf2md::main at line 614. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/bin/pdf2md.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/bin/pdf2md.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb478e21fc9bdfbac01c5b35fdb0e6d1ce533951594cfb9d6ac113111cd8942"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/detector.rs: src/detector.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in pdf_inspector::detector::detect_from_document at line 216. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/detector.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/detector.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddc3f1454df76ef8ac879b8d2afab062a73a8b3852d63ed4c8f0e0fbce658e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tounicode.rs: src/tounicode.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in FontCMaps::collect_cmaps_from_fonts_inner at line 3305. 8 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/tounicode.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tounicode.rs"},"region":{"startLine":3305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b391629ae3bf7249446fb4a170556d270036ff641c7549b6819b50adcd5596b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tables/mod.rs: src/tables/mod.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in pdf_inspector::tables::try_build_table_from_columns at line 407. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/tables/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb9a34161c0640c807e3fbdf6d210ece071fe3aadebcb37625728748a95a4bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tables/detect_heuristic.rs: src/tables/detect_heuristic.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in pdf_inspector::tables::detect_heuristic::detect_table_in_region at line 1341. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/tables/detect_heuristic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b581f4ef89139664bf1593b4e483d13b2f6781d69ab4a80900f04a98830018"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tables/detect_lines.rs: src/tables/detect_lines.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in pdf_inspector::tables::detect_lines::build_text_anchor_table at line 344. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/tables/detect_lines.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_lines.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53cc487ae7c5fc0bc6094018ecdf27dc38132d562e0f259cd641f19b30f8369"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extractor/layout.rs: src/extractor/layout.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in pdf_inspector::extractor::layout::order_columns_with_policy at line 2386. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/extractor/layout.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/layout.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c307818908b5d52d85f5a4be76a3d75974ba3984a25e5433a61777ad7bf43b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/vision/fusion.rs: src/vision/fusion.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in pdf_inspector::vision::fusion::fuse_ocr_pages_impl at line 267. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/vision/fusion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/vision/fusion.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d612dd1260f8bdbf702c65158236240127e48803fb017d3f07d8d83539fd0401"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/tables/detect_struct.rs: src/tables/detect_struct.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in pdf_inspector::tables::detect_struct::detect_tables_from_struct_tree at line 388. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/tables/detect_struct.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_struct.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"def58b25cee2528fa4ffdbd9332cc2044b96d6a0804163ea4e012b8ef6b92655"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extractor/links.rs: src/extractor/links.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in pdf_inspector::extractor::links::walk_form_fields at line 275. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/extractor/links.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/links.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f0aa92610ca17f9c6830fee98afc993119d6efc992ca533e9142909a3b5b48"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extractor/word_gaps.rs: src/extractor/word_gaps.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in pdf_inspector::extractor::word_gaps::tj_tracking at line 483. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/extractor/word_gaps.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/word_gaps.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d80345482dccb7b893c77a8bbc285ea921de7694da87727b59b9db42775a3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/extractor/underline.rs: src/extractor/underline.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in pdf_inspector::extractor::underline::mark_underlined_items at line 705. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/extractor/underline.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/underline.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"0313bf88ae757f9467cfd5eb4bbb85b80575ef2011ba3d8b266b0c0bd1f2e380"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/mac_glyph_order.rs: src/mac_glyph_order.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in pdf_inspector::mac_glyph_order::build_cmap_from_mac_glyph_order at line 413. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/mac_glyph_order.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/mac_glyph_order.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"7275c0e8ca957e75055a49482e02c04e3192fa67f0de75de9f43e47d0beb388c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extractor/clip_boundaries.rs: src/extractor/clip_boundaries.rs changed 7 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is ClipTracker::observe at line 122), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(underline): keep repeated strikethroughs and strikethroughs inside tables (#663)\u201D; \u201Cfix(tounicode): interpolate single-glyph gaps in a ToUnicode CMap and report its coverage (#568)\u201D; \u201Cfix(extractor): compose a detached spacing accent with the letter it is painted over (#563)\u201D; \u201Cfix(rtl): read right-to-left runs shown in reading order forwards (#561)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/extractor/clip_boundaries.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/clip_boundaries.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"686bf2cd25390ce16760e9d6c11384b3efa5a67b0b41027d57aecc51beacca1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/extractor/geometry.rs: src/extractor/geometry.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is pdf_inspector::extractor::geometry::run_geometry at line 214), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(extractor): start TJ sub-runs at their first painted glyph (#527)\u201D; \u201Cfix(extractor): keep word spaces painted as squeezed whitespace runs (#517)\u201D; \u201Cfix(extractor): honor PDF text horizontal scaling (#510)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 23:19:13 -08:00\u0027 --until=\u00272026-11-13 23:19:13 -08:00\u0027 --full-history --no-merges -- src/extractor/geometry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/geometry.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"648521571de78432672b840156684488dbb40d475dc5709346903ced3d3f298c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: add a rotated-page vector-grid fixture before enabling this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1878}}}],"partialFingerprints":{"codehealthFindingId/v1":"0233baa0ddf2b0b77a6122e4c1cb113bdff963f176d4ef8c1b708f5daece23e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: refactor vector detectors to return normalized \u0060(x_edges, y_edges)\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"32118307a94002306270419556808667a7d412f073ab81a225873fe21f50c865"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060Cargo.toml\u0060 makes this repository a deployable product (line 104)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Cargo.toml"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a1f320edebd162aecb630322055fab9fa4bd5274ac8a03cd339206970700a5"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 3.3/10. The most over is \u0060(repository root)\u0060 (127784 LoC, 184 module-visible types across 10 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D29","level":"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":"b4b84274ded7e6b21af20f24c3c1abbd7c2623cc940e96b12bd49088aeb7e024"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"735fe0b3e06367424b6faa27f4b329e443bdfeebb2a0f67e5ff72409451f8d93"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76189e112956243edf98060905d8ea654e12e5d0f6023ed5b7a9b4161d52a6f1"},"properties":{"dependency":{"package":"js-yaml","version":"4.1.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"402836fe4899f2dff5f6617509933816173d31f125ea457cedd9b358a7d11f21"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 1/2 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060napi\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060napi/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"napi/package.json"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abd706bb758e1211e7ef05c359bd691041800dfa095870245e81a2f13e68776"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(items[0].x - 20.0).abs() \u003C 0.01 \u0026\u0026 (items[0].width - 29.4).abs() \u003C 0.01\u0060 appears character-identically in 2 files \u2014 src/extractor/content_stream.rs, src/extractor/xobjects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":5694}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f3a4bd225bf805e77fd994e4f7668aa0d3aa32c7761d714cc7dc8bc834a8f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.len() \u003E= 2 \u0026\u0026 bytes[0] == 0xFE \u0026\u0026 bytes[1] == 0xFF\u0060 appears character-identically in 2 files \u2014 src/extractor/fonts.rs, src/text_utils.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":2984}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae08722b154fd4cc7869b2b21c510a9dd0758b341e3d993ed641f761fec9c5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c \u003C 0.05 \u0026\u0026 m \u003C 0.05 \u0026\u0026 y \u003C 0.05 \u0026\u0026 k \u003C 0.05\u0060 appears character-identically in 2 files \u2014 src/extractor/content_stream.rs, src/extractor/xobjects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a73fbd0392b477093fb993a6e0e376dff70cd382636844024d56e6cbadfefe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060encoding != b\u0022Identity-H\u0022 \u0026\u0026 encoding != b\u0022Identity-V\u0022\u0060 appears character-identically in 2 files \u2014 src/extractor/fonts.rs, src/tounicode.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/fonts.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"7728250ec21714fbc4f702fbb9af4a218b1f98379ea877da743c0a5da370b99c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060font_info.is_some() || (end_w - start_w != 0.0 \u0026\u0026 ((end_w - start_w \u003E 0.0) == (*estimate_ts \u003E 0.0)))\u0060 appears character-identically in 2 files \u2014 src/extractor/content_stream.rs, src/extractor/xobjects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9e432eabdb76263807bf4a2df223d3bf7fbdd7eeb88c55b877e102d2d7e088"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060horizontal_advance \u0026\u0026 crate::text_utils::is_visual_rtl_candidate(text)\u0060 appears character-identically in 2 files \u2014 src/extractor/content_stream.rs, src/extractor/xobjects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e00f0511ac2e0c5581a18158bce2290f2951349525f4f5a5e62e86a6e710a4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060in_text_block \u0026\u0026 !op.operands.is_empty()\u0060 appears character-identically in 2 files \u2014 src/extractor/content_stream.rs, src/extractor/xobjects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"4634f94f4d8bded57f4df92c945d2c37919e155e33fadb1958da42ba60612478"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060n_val \u003E space_threshold \u0026\u0026 !current_text.is_empty() \u0026\u0026 total_width_ts \u002B displacement \u003C sub_start_width_ts\u0060 appears character-identically in 2 files \u2014 src/extractor/content_stream.rs, src/extractor/xobjects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3548943a2160c78eef81992978f23a70a3d577e36ede657d178375421e4d0f88"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nums[0] \u003C 0.05 \u0026\u0026 nums[1] \u003C 0.05 \u0026\u0026 nums[2] \u003C 0.05 \u0026\u0026 nums[3] \u003C 0.05\u0060 appears character-identically in 2 files \u2014 src/extractor/content_stream.rs, src/extractor/xobjects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad8d674619f35efba0a3877f8d8e91039d1ea734fa6cba7853a422c0559802b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nums[0] \u003E 0.95 \u0026\u0026 nums[1] \u003E 0.95 \u0026\u0026 nums[2] \u003E 0.95\u0060 appears character-identically in 2 files \u2014 src/extractor/content_stream.rs, src/extractor/xobjects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fb543e5e5d4fbee68a1ed8a4e0a529983a6337a3b0bf8cc009cea1acc4ac27"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060op.operator == \u0022\\\u0022\u0022 \u0026\u0026 op.operands.len() \u003E= 3\u0060 appears character-identically in 2 files \u2014 src/extractor/content_stream.rs, src/extractor/xobjects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f03b1053fa2406b12d07b8bdd1049959dd7d63d5776e916d51743f05bf4bd2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.ends_with(\u0027(\u0027) || result.ends_with(\u0027[\u0027) || result.ends_with(\u0027{\u0027)\u0060 appears character-identically in 2 files \u2014 src/tables/cell_text.rs, src/tables/detect_rects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/cell_text.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5fc2254db4b94d4368eb65a1bdebeb3b800c4ac1c74b70664518428db7d2cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reverse_font_ratio \u003C 0.85 \u0026\u0026 y_diff \u003E 1.0\u0060 appears character-identically in 2 files \u2014 src/tables/cell_text.rs, src/types.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/cell_text.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"52de36446a362f721b2a29de406e2e011319751c7428544a25075ae3610d440e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text_rendering_mode == 3 \u0026\u0026 !include_invisible\u0060 appears character-identically in 2 files \u2014 src/extractor/content_stream.rs, src/extractor/xobjects.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/extractor/content_stream.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6f81207e3947a96bb2e6fc32bc9382397a2622572d212173a6dc6d726be94b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x1.is_finite() \u0026\u0026 y1.is_finite() \u0026\u0026 x2.is_finite() \u0026\u0026 y2.is_finite()\u0060 appears character-identically in 3 files \u2014 src/lib.rs, src/python.rs, src/tables/structured.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lib.rs"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a59f88fbe4c4102ffc167c584f924d68f8c265cb79247bf98867b7563e4d60"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060decoded_text_counts_within\u0060 turns every \u0060Err\u0060 into \u0060DecodedTextCounts::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":"src/detector.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71916385d1d5089262bd2bec95439d431ccc9692f1da326da0a66fafc9c1f8d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060build_type3_scales\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":"src/extractor/fonts.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8617aea3220f9c80ed0b84473555b934cbc2e6aabddfabe02f2cc2cd36e0da14"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_kids\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/structure_tree.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8f7b03e9074d6d8b3fa934ae7408c37d84e803231bfa5ed402fe04fbfc9e46"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060s.contains(\u0022MHz\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060s.contains(\u0022MHz\u0022)\u0060 also satisfies \u0060s.contains(\u0022Hz\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6c0fa1fc0d528ba1d27fb42cf9afa2439bd915da588e91031a0c1490c43d3d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060s.contains(\u0022kHz\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060s.contains(\u0022kHz\u0022)\u0060 also satisfies \u0060s.contains(\u0022Hz\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/tables/detect_heuristic.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2370a3909cdc17ec5a04fd8c3bc9b4f0e54e6dfaf9c4005cdc961f4d32cf086"}}],"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-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-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-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-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-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":6,"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."]}]}